Scheduling in Parallel Computing Systems: Fuzzy and Annealing TechniquesScheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques advocates the viability of using fuzzy and annealing methods in solving scheduling problems for parallel computing systems. The book proposes new techniques for both static and dynamic scheduling, using emerging paradigms that are inspired by natural phenomena such as fuzzy logic, mean-field annealing, and simulated annealing. Systems that are designed using such techniques are often referred to in the literature as `intelligent' because of their capability to adapt to sudden changes in their environments. Moreover, most of these changes cannot be anticipated in advance or included in the original design of the system. Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques provides results that prove such approaches can become viable alternatives to orthodox solutions to the scheduling problem, which are mostly based on heuristics. Although heuristics are robust and reliable when solving certain instances of the scheduling problem, they do not perform well when one needs to obtain solutions to general forms of the scheduling problem. On the other hand, techniques inspired by natural phenomena have been successfully applied for solving a wide range of combinatorial optimization problems (e.g. traveling salesman, graph partitioning). The success of these methods motivated their use in this book to solve scheduling problems that are known to be formidable combinatorial problems. Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques is an excellent reference and may be used for advanced courses on the topic. |
Contents
SETTING THE SEEN | 1 |
EXPERIMENTAL PLATFORM | 21 |
MEANFIELD ANNEALING | 57 |
Copyright | |
7 other sections not shown
Other editions - View all
Scheduling in Parallel Computing Systems Shaharuddin Salleh,Albert Y Zomaya No preview available - 1999 |
Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques Shaharuddin Salleh,Albert Y. Zomaya No preview available - 2012 |
Common terms and phrases
algorithm TS_FL-1 assigned Boltzmann centroid combinatorial optimization communication cost communication delays completion contention delay cut numbers defuzzification distribution dynamic scheduling El-Rewini Equation Evaluate FAMTS Figure fuzzy logic Gantt chart global minimum global scheduler graph partitioning graph partitioning problem heuristic Hopfield network hypercube implemented inference rules initial input interconnection interprocessor communication iterations load balancing machine mapping mean-field annealing method modules network models neurons nodes NP-complete number of doglegs number of PEs objective function output parallel computing parallel program partitioning problem pct pel pur PE.pel PE₁ performance PEs Total Tasks=36 Peterson and Anderson precedence relationship priority list processing elements processor proposed pur TS pct queue random schedule length Schedule_2 simulated annealing solution solve speedup street congestion synchronization Table task graph task scheduling problem Tasks=200 TS pct technique temperature topology Total Tasks=100 Total Total Tasks=36 Total transputer TS_MFA-1 TS_SAA Update Zomaya