Overview

This text 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. The book 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, such as travelling salesman and 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.

Full Product Details

Author:   Shaharuddin Salleh ,  Albert Y. Zomaya
Publisher:   Springer
Imprint:   Springer
Edition:   1999 ed.
Volume:   510
Dimensions:   Width: 15.50cm , Height: 1.20cm , Length: 23.50cm
Weight:   0.980kg
ISBN:  

9780792385332

ISBN 10:   0792385330
Pages:   170
Publication Date:   31 May 1999
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

1 Scheduling: Setting the Seen.- 1.1 Introduction.- 1.2 Problem Overview.- 1.3 Definitions.- 1.4 Task Precedence Relationships.- 1.5 NP-Completeness and Scheduling.- 1.6 Scope of this Work.- 2 Parallel Computing: Experimental Platform.- 2.1 Introduction.- 2.2 Parallel Computers.- 2.3 Transputer-Based Systems.- 2.4 Software Tools for the Transputer.- 2.5 Famts.- 2.6 Summary.- 3 Task Scheduling: Highlights and Framework.- 3.1 List Scheduling Heuristics.- 3.2 Heuristic Clustering Algorithms.- 3.3 Graph Theoretic Approaches.- 3.4 Queuing Theory.- 3.5 A Framework for Experiments.- 3.6 Case Study.- 3.7 Parallel Implementation.- 3.8 Summary.- 4 Static Scheduling: Mean-Field Annealing.- 4.1 Neural Networks.- 4.2 An Overview of Mean-Field Annealing.- 4.3 The Graph Partitioning Problem.- 4.4 Minimum Interprocessor Communication.- 4.5 MFA Model for Minimum Interprocessor Communication.- 4.6 Implementation Strategy.- 4.7 Case Study: A Fully-Connected Network.- 4.8 Different Network Topologies.- 4.9 Summary.- 5 Dynamic Scheduling: A Fuzzy Logic Approach.- 5.1 Fuzzy Logic.- 5.2 Dynamic Scheduling.- 5.3 A Fuzzy Model for Dynamic Task Allocation.- 5.4 Fuzzy Dynamic Scheduling.- 5.5 Implementation.- 5.6 Summary.- 6 Single-Row Routing: Another Computationally-Intractable Problem.- 6.1 Introduction.- 6.2 Solving the SRR Problem.- 6.3 Existing Methods.- 6.4 Simulated Annealing.- 6.5 Comparisons.- 6.6 Summary.- 7 Epilogue.- 7.1 Summary of Findings.- 7.2 Open Issues.- Appendix A: Graph Multipartitioning Using Mean-Field Annealing.- Appendix B: General List Heuristic (Gl).- Appendix C: Single Row Routing (TARNG et al. 1984).- Appendix D: Single Row Routing (DU and LIU 1984).- References.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions