Salleh / Zomaya Scheduling in Parallel Computing Systems

Fuzzy and Annealing Techniques
1999
ISBN: 978-1-4615-5065-5
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 510, 170 Seiten, eBook

Reihe: The Springer International Series in Engineering and Computer Science

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.
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.
is an excellent reference and may be used for advanced courses on the topic.

Zielgruppe

Research

Autoren/Hrsg.

Salleh, Shaharuddin

Zomaya, Albert Y.

Inhaltsverzeichnis

Preface. 1. Scheduling: Setting the Seen. 2. Parallel Computing: Experimental Platform. 3. Task Scheduling: Highlights and Framework. 4. Static Scheduling: Mean-Field Annealing. 5. Dynamic Scheduling: A Fuzzy Logic Approach. 6. Single-Row Routing: Another NP-Hard Problem. 7. Epilogue. Appendices: A. Graph Multipartitioning Using Mean-Field Annealing. B. General List Heuristic. C. Single Row Routing (Tarng et al. 1984). D. Single Row Routing (Du and Liu 1984). References. Index.