Gang scheduling in a two-cluster system with critical sporadic jobs and migrations

Author

Papazachos, Zafeirios C. ; Karatza, Helen D.

Author_Institution

Dept. of Inf., Aristotle Univ. of Thessaloniki, Thessaloniki, Greece

Volume

41

fYear

2009

fDate

13-16 July 2009

Firstpage

41

Lastpage

48

Abstract

Gang scheduling is a common task scheduling algorithm for parallel and distributed systems which delivers improved performance. In this paper, we consider the scheduling of critical jobs which arrive in a sporadic manner at the system. A migration scheme is implemented in order to alleviate the impact of critical sporadic jobs on the performance of gang scheduling. A simulation model consisting of two clusters is used to provide results on the performance of the system.

Keywords

parallel processing; processor scheduling; critical sporadic job; distributed system; gang scheduling; migration scheme; parallel system; processor allocation; two-cluster system; Analytical models; Checkpointing; Context; Dynamic scheduling; Informatics; Performance analysis; Processor scheduling; Scheduling algorithm; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Performance Evaluation of Computer & Telecommunication Systems, 2009. SPECTS 2009. International Symposium on

Conference_Location

Istanbul

Print_ISBN

978-1-4244-4165-5

Electronic_ISBN

978-1-56555-328-6

Type

conf

Filename

5224147