A time optimization algorithm for scheduling bag-of-task applications in auction-based proportional share systems

  • A. Sulistio University of Melbourne
  • R. Buyya University of Melbourne

Resumo


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.
Palavras-chave: Scheduling algorithm, Application software, Resource management, Peer to peer computing, Processor scheduling, Grid computing, Computer applications, Large-scale systems, Computer networks, Distributed computing
Publicado
24/10/2005
SULISTIO, A.; BUYYA, R.. A time optimization algorithm for scheduling bag-of-task applications in auction-based proportional share systems. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 17. , 2005, Rio de Janeiro/RJ. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2005 . p. 235-242.