Referenced Items are not available for this document.
Service resources allocation and scheduling is one of the challenging and complex problems in computation-economy-driven open grid service architecture. This paper proposes a time-cost tradeoff workflow scheduling algorithm in which cost is optimized for schedules with the expectation to minimize workflow duration. Dynamic service selection strategy is adopted to adapt to dynamic shared and autonomous resources in grids. Simulation results show that the algorithm can achieve less completion time and lower cost which can meet requirements in practical applications
Published in:
Computer Supported Cooperative Work in Design, 2006. CSCWD '06. 10th International Conference on
Date of Conference: 3-5 May 2006
- Page(s):
- 1 - 6
- E-ISBN :
- 1-4244-0165-8
- Print ISBN:
- 1-4244-0164-X
- INSPEC Accession Number:
- 9199840
- Conference Location :
- Nanjing
- Digital Object Identifier :
- 10.1109/CSCWD.2006.253058
- 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.
