October 2000
Intermediate to advanced
288 pages
9h 22m
English
book
Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences
by Albert Y. Zomaya, Fikret Ercal, Stephan Olariu
Content preview from Solutions to Parallel and Distributed Computing Problems: Lessons from Biological SciencesBecome 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,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
7.2. MULTIPROCESSOR SCHEDULING
A multiprocessor system is represented by an undirected, unweighted graph, Gs = (Vs, Es) called a system graph. The set of Ns nodes, Vs of the system graph represents processors with their local memories of a parallel computer of multiple-instruction, multiple-data (MIMD) architecture. The set of edges, Es represents bidirectional channels between processors and defines a topology of the multiprocessor system. Figure 7.1a shows an example of a system graph representing a multiprocessor system consisting of two processors P0 and P1. This topology will be used in all experiments presented in this work. It is assumed that all processors have the same computational power, and that communication via links does not consume any processor time.
A parallel program is represented by a weighted directed acyclic graph Gp = (Vp, Ep), called a precedence task graph or a program graph. The set of Np nodes, Vp of the graph represents elementary tasks, which are indivisible computational units. There exists a precedence constraint relation between tasks k and l in the precedence task graph if the output produced by task k has to be communicated to task l.
A program graph has two attributes: weights bk and akl. Weights bk of the nodes describe the processing time (computational cost) needed to execute a given task on any processor of a given multiprocessor system. The set of edges, Ep of the precedence task graph describes the communication pattern between the tasks. ...
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
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.