The Community for Technology Leaders
Computer Architecture and High Performance Computing, Symposium on (2005)
Rio de Janeiro, Brazil
Oct. 24, 2005 to Oct. 27, 2005
ISSN: 1550-6533
ISBN: 0-7695-2446-X
pp: 235-242
Anthony Sulistio , University of Melbourne, Australia
Rajkumar Buyya , University of Melbourne, Australia
<p>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.</p> <p>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.</p>

A. Sulistio and R. Buyya, "A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-based Proportional Share Systems," Computer Architecture and High Performance Computing, Symposium on(SBAC-PAD), Rio de Janeiro, Brazil, 2005, pp. 235-242.
80 ms
(Ver 3.3 (11022016))