Gang scheduling in a distributed system under processor failures and time-varying gang size

In this paper we study the performance of a distributed system which is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on disti...

Full description

Saved in:
Bibliographic Details
Published inThe Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings pp. 330 - 336
Main Author Karatza, H.D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Concurrent computing
Distributed computing
Hardware
Informatics
Parallel processing
Processor scheduling
Resource management
Routing
System performance
Time varying systems
Online AccessGet full text
ISBN0769519105
9780769519104
ISSN1071-0485
DOI10.1109/FTDCS.2003.1204355

Cover

More Information
Summary:In this paper we study the performance of a distributed system which is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. System performance is examined and compared in cases where different distributions for the number of parallel tasks per job (gang size) are employed We examine cases where gang size is defined by a specific distribution and also a case where gang size distribution varies with time.
ISBN:0769519105
9780769519104
ISSN:1071-0485
DOI:10.1109/FTDCS.2003.1204355