Task scheduling for multiprocessor systems

Savina Bansal

ISBN 10: 3843361517 / ISBN 13: 9783843361514

Published by LAP LAMBERT Academic Publishing Okt 2010, 2010

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -Parallel processing has seen incredible growth with increasingly complex scientific & engg applications coming to their realm.Task scheduling,a key issue for its success,& design of efficient algorithms play a crucial role in it.Due to NP-completeness of the problem research efforts are mainly focussed at heuristic-based approaches to generate near-optimal schedules within reasonable time & resource constraints.Most of the heuristics, however, ignore practical aspect and/or compromise too much on complexity or performance.This monograph provides an in-depth insight into these issues.An overview of state-of-the-art scheduling,reflecting changing paradigms,is also provided.In addition,for scheduling DAG structured applications,3 efficient algorithms are presented & analyzed for homogeneous, heterogeneous & mixed-parallel computing environments.Selective-duplication heuristic is introduced and its usefulness in dealing with IPC overhead is shown in comparison to list,clustering and duplication-based heuristics.An A-cube performance model is suggested to comprehensively study behavior of algorithm, application & architecture in heterogeneous environment.Books on Demand GmbH, Überseering 33, 22297 Hamburg 180 pp. Englisch.

Seller Inventory # 9783843361514

Bibliographic Details

• Title: Task scheduling for multiprocessor systems
• Publisher: LAP LAMBERT Academic Publishing Okt 2010
• Publication Date: 2010
• Language: English
• ISBN 10: 3843361517
• ISBN 13: 9783843361514
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

Parallel processing has seen incredible growth with increasingly complex scientific & engg applications coming to their realm.Task scheduling,a key issue for its success,& design of efficient algorithms play a crucial role in it.Due to NP-completeness of the problem research efforts are mainly focussed at heuristic-based approaches to generate near-optimal schedules within reasonable time & resource constraints.Most of the heuristics, however, ignore practical aspect and/or compromise too much on complexity or performance.This monograph provides an in-depth insight into these issues.An overview of state-of-the-art scheduling,reflecting changing paradigms,is also provided.In addition,for scheduling DAG structured applications,3 efficient algorithms are presented & analyzed for homogeneous, heterogeneous & mixed-parallel computing environments.Selective-duplication heuristic is introduced and its usefulness in dealing with IPC overhead is shown in comparison to list,clustering and duplication-based heuristics.An A-cube performance model is suggested to comprehensively study behavior of algorithm, application & architecture in heterogeneous environment.

About the Author

Savina Bansal,PhD (IIT)is a Professor in Electronics & Comm Engg at GZS College of Engg & Tech. Bathinda (Punjab)India. She has over 22 yrs of teaching, research and Ind. experience and has published many well-cited R.papers in reputed Int.Journals & Conf. Her research interests include Fault-tolerant real-time & multiprocessor scheduling.