Basic and Advanced Task Scheduling Techniques for Parallel Systems.DUBLIN, Ireland -- Research and Markets (http://www.researchandmarkets.com/reports/c56657) has announced the addition of "Task Scheduling (algorithm) task scheduling - The assignment of start and end times to a set of tasks, subject to certain constraints. Constraints are typically either time constraints (the payload must be installed before the payload bay doors are closed) or resource constraints (this task for Parallel Systems" to their offering Task scheduling for parallel systems can become a quagmire of heuristics heu·ris·tic adj. 1. Of or relating to a usually speculative formulation serving as a guide in the investigation or solution of a problem: , models, and methods that have been developed over the past decades. The author of this innovative text cuts through the confusion and complexity by presenting a consistent and comprehensive theoretical framework along with realistic parallel system models. These new models, based on an investigation of the concepts and principles underlying task scheduling, take into account heterogeneity het·er·o·ge·ne·i·ty n. The quality or state of being heterogeneous. heterogeneity the state of being heterogeneous. , contention for communication resources, and the involvement of the processor in communications. For readers who may be new to task scheduling, the first chapters are essential. They serve as an excellent introduction to programming parallel systems, and they place task scheduling within the context of the program parallelization process. The author then reviews the basics of graph theory graph theory Mathematical theory of networks. A graph consists of vertices (also called points or nodes) and edges (lines) connecting certain pairs of vertices. An edge that connects a node to itself is called a loop. , discussing the major graph models used to represent parallel programs. Next, the author introduces his task scheduling framework. He carefully explains the theoretical background of this framework and provides several examples to enable readers to fully understand how it greatly simplifies and, at the same time, enhances the ability to schedule. The second half of the text examines both basic and advanced scheduling techniques, offering readers a thorough understanding of the principles underlying scheduling algorithms A method used to schedule jobs for execution. Priority, length of time in the job queue and available resources are examples of criteria used. . The final two chapters address communication contention in scheduling and processor involvement in communications. Each chapter features exercises that help readers put their new skills into practice. An extensive bibliography leads to additional information for further research. Finally, the use of figures and examples helps readers better visualize and understand complex concepts and processes. Researchers and students in distributed and parallel computer systems will find that this text dramatically improves their ability to schedule tasks accurately and efficiently. About the Author: Oliver Sinnen, PhD, is a senior lecturer senior lecturer n. Chiefly British A university teacher, especially one ranking next below a reader. in the Department of Electrical and Computer Engineering at the University of Auckland Not to be confused with Auckland University of Technology. The University of Auckland (Māori: Te Whare Wānanga o Tāmaki Makaurau) is New Zealand's largest university. , New Zealand New Zealand (zē`lənd), island country (2005 est. pop. 4,035,000), 104,454 sq mi (270,534 sq km), in the S Pacific Ocean, over 1,000 mi (1,600 km) SE of Australia. The capital is Wellington; the largest city and leading port is Auckland. . Areas covered: - Parallel Systems and Programming. - Graph Representations. - Task Scheduling. - Fundamental Heuristics. - Advanced Task Scheduling. - Communication Contention in Scheduling. - Processor Involvement in Communication. For more information visit http://www.researchandmarkets.com/reports/c56657 |
|
||||||||||||
Printer friendly
Cite/link
Email
Feedback
Reader Opinion