loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05)
A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-based Proportional Share Systems
Rio de Janeiro, Brazil
October 24-October 27
ISBN: 0-7695-2446-X
ASCII Text
x 
 
Anthony Sulistio, Rajkumar 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, pp. 235-242, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CAHPC.2005.9,
author = {Anthony Sulistio and Rajkumar Buyya},
title = {A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-based Proportional Share Systems},
journal ={Computer Architecture and High Performance Computing, Symposium on},
volume = {0},
year = {2005},
issn = {1550-6533},
pages = {235-242},
doi = {http://doi.ieeecomputersociety.org/10.1109/CAHPC.2005.9},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Architecture and High Performance Computing, Symposium on
TI - A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-based Proportional Share Systems
SN - 1550-6533
SP235
EP242
A1 - Anthony Sulistio,
A1 - Rajkumar Buyya,
PY - 2005
KW - null
VL - 0
JA - Computer Architecture and High Performance Computing, Symposium on
ER -
 
Anthony Sulistio, University of Melbourne, Australia
Rajkumar Buyya, University of Melbourne, Australia

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.

Citation:
Anthony Sulistio, Rajkumar Buyya, "A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-based Proportional Share Systems," sbac-pad, pp.235-242, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.