A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-based Proportional Share Systems

Authors:
Anthony Sulistio;Rajkumar Buyya
Affiliations:
University of Melbourne, Australia;University of Melbourne, Australia
Venue:
SBAC-PAD '05 Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing
Year:
2005

Citing 0
Cited 8

A recovery mechanism for errors caused by a late subjob in a system handling SLA-based Grid workflows

International Journal of Web and Grid Services
GarQ: An efficient scheduling data structure for advance reservations of grid resources

International Journal of Parallel, Emergent and Distributed Systems
Fair resource sharing in hierarchical virtual organizations for global grids

GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
A new grid resource management mechanism with resource-aware policy administrator for SLA-constrained applications

Future Generation Computer Systems
Incentive-based scheduling framework for grid computing

SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
SLA based policy administrator for efficient resource management in computational grid

APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Non-clairvoyant scheduling of multiple bag-of-tasks applications

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Versatile time-cost algorithm VTCA for scheduling non-preemptive tasks of time critical workflows in cloud computing systems

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grid and peer-to-peer (P2P) network technologies enable aggregation of distributed resources for solving large-scale and computationally-intensive applications. These technologies are well-suited for Bag-of-Tasks (BoT) applications, because each application consists of many parallel and independent tasks. With multiple users competing for the same resources, the key challenge is to finish a user application within a specified deadline. In this paper, we propose a time optimization algorithm that schedules a user application on auction-based resource allocation systems. These allocation systems, which are based on proportional share, allow users to bid higher in order to gain more resource shares. Therefore, this algorithm adjusts a user bid periodically on these systems in order to finish the application on time.