Graph Theory for Computer Science
by Manikandan Rajagopal, Ramkumar Sivasakthivel, Joseph Varghese Kureethara, Niranjanamurthy M., Biswadip Basu Mallik
8Understanding Dependency Graphs in Parallel and Distributed Computing from Concept to Execution
S. Naganandhini1*, M. Vijayakumar2, K. Gopalakrishnan3 and T. Nithya4
1Department of Computer Science and Engineering, PSNA College of Engineering and Technology, Dindigul, Tamil Nadu, India
2Department of AIDS, B. Tech (AIDS), Dr. Mahalingam College of Engineering and Technology, Pollachi, Tamil Nadu, India
3Department of Computer Science and Business Systems, Dr.N.G.P Institute of Technology, Coimbatore, India
4Department of Information Technology, Velalar College of Engineering and Technology, Thindal, Erode, Tamil Nadu, India
Abstract
Parallel and distributed computing has become influential technology in addressing the growing demand for computational power in various domains, ranging from scientific simulations to big data analytics. A foundation of effective parallel and distributed computing is the understanding and management of dependencies among tasks and data elements. Dependency graphs offer a powerful abstraction to represent and analyze these dependencies and facilitate efficient scheduling, allocation of resource, and fault tolerance approach. This chapter investigates the role of dependency graphs in parallel and distributed computing, revealing their significance, applications, and also challenges. The chapter starts by explaining the introductory and basic concepts of parallel and distributed computing, focusing the need to use concurrency and parallelism to improve ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access