Referenced Items are not available for this document.
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.
Published in:
Performance Evaluation of Computer & Telecommunication Systems, 2009. SPECTS 2009. International Symposium on
(Volume:41
)
Date of Conference: 13-16 July 2009
- Page(s):
- 41 - 48
- E-ISBN :
- 978-1-56555-328-6
- Print ISBN:
- 978-1-4244-4165-5
- INSPEC Accession Number:
- 10843560
- Conference Location :
- Istanbul
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
