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.6 CA-BASED SCHEDULER
7.6.1 Architecture of CA-Based Scheduler
Figure 7.13 presents the architecture of the CA-based scheduler. The scheduler operates in two modes: the learning mode (Fig. 7.13, left) and the operation mode (Fig. 7.13, right).
Figure 7.13 The architecture of a CA-based scheduler.
In the learning mode, CA rules are discovered by the GA. It is expected that the rules will be suitable for solving the scheduling problem for any initial allocation of the tasks for a given instance of the problem. The tasks of the program graph representing a given instance of the problem are initially randomly allocated to processors of the parallel system. The CA is built for the program graph and a predefined type of local neighborhood.
An initial population of GA, containing rules is created. For a given random allocation of the program graph into the system graph, the CA is initialized and equipped with the rule from the population of rules. CA evolves its states during a predefined number of steps, which results in changing the allocation of the tasks of the program graph.
The response time T for the final allocation is evaluated. For a given rule this evaluation procedure is repeated a predefined number of times for a set of test problems represented by different initial allocations. This results in evaluation of some fitness value T* for the rule, which is the sum of T values ...
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.