Referenced Items are not available for this document.
This paper explores the problem of dynamically scheduling large scale applications over wide area networks and then proposes an adaptive scheduling algorithm to provide quality of service. Our adaptive algorithm takes into account unexpected events and priority fluctuations and gives high priority to jobs with low probability of failure. Experimental results show that the new approach outperforms traditional scheduling approaches in grid computing environments
Published in:
Network Computing and Applications, 2006. NCA 2006. Fifth IEEE International Symposium on
Date of Conference: 24-26 July 2006
- Page(s):
- 273 - 276
- Print ISBN:
- 0-7695-2640-3
- INSPEC Accession Number:
- 9077017
- Conference Location :
- Cambridge, MA
- Digital Object Identifier :
- 10.1109/NCA.2006.12
- 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.
