Heuristic for resources allocation on utility computing infrastructures

Proceedings of the 6th International Workshop on Middleware for Grid Computing, MGC'08, held at the ACM/IFIP/USENIX 9th International Middleware Conference

Volumn , Issue , 2008, Pages

  Silva, João Nuno ^a   Veiga, Luís ^a   Ferreira, Paulo ^a  

^a INESC ID   (Portugal)

Author keywords

Bag of tasks; Resource allocation; Resource allocation on utility computing; Scheduling heuristics

Indexed keywords

BAG-OF-TASKS; CONCURRENT TASKS; COST EFFECTIVE; GRID INFRASTRUCTURES; IN-LINE; ON-DEMAND COMPUTING; PARALLEL COMPUTING; PROCESSING TIME; RESOURCES ALLOCATION; SCHEDULING HEURISTICS; UTILITY COMPUTING; VIABLE SOLUTIONS;

BUDGET CONTROL; CLUSTER COMPUTING; COMPUTER RESOURCE MANAGEMENT; MIDDLEWARE; PARALLEL ARCHITECTURES; RESOURCE ALLOCATION; SCHEDULING;

GRID COMPUTING;

EID: 77953111192     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1462704.1462713     Document Type: Conference Paper

References (14)

1. Amazon.com, Inc. Amazon elastic compute cloud (amazon ec2). http://aws.amazon.com/ec2.
2. D. P. Anderson and G. Fedak. The computational and storage potential of volunteer computing. In IEEE/ACM International Symposium on Cluster Computing and the Grid, May 2006.
3. A. Bouteiller, H. L. Bouziane, T. Hérault, P. Lemarinier, and F. Cappello. Hybrid preemptive scheduling of mpi applications on the grids. In Int. Journal of High Performance Computing Special issue, 20:77-90, 2006.
4. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in grid environments. Heterogeneous Computing Workshop, 2000. (HCW 2000) Proceedings. 9th, pages 349-363, 2000.
5. CS Department of Computer Science - University of California, Santa Barbara. Eucalyptus. http://eucalyptus.cs.ucsb.edu/.
6. Enomaly Inc. Enomalism : Elastic computing platform - virtual server managemen. http://enomalism.com.
7. Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv., 31(4):406-471, 1999.
8. C. B. Lee, Y. Schwartzman, J. Hardy, and A. Snavely. Are user runtime estimates inherently inaccurate? In Job Scheduling Strategies for Parallel Processing, 10th International Workshop, JSSPP 2004. Springer, 2005.
9. Message Passing Interface Forum. MPI: A message-passing interface standard. Technical report, University of Tennessee, Knoxville, TN, USA, 1994.
10. A. W. Mu'alem and D. G. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the ibm sp2 with backfilling. IEEE Trans. Parallel Distrib. Syst., 12(6):529-543, 2001.
11. M. Netto, R. Calheiros, R. Silva, C. De Rose, C. Northfleet, and W. Cirne. Transparent resource allocation to exploit idle cluster nodes in computational grids. e-Science and Grid Computing, 2005. First International Conference on, December 2005.
12. Persistence of Vision Raytracer Pty. Ltd. Persistence of vision raytracer. http://www.povray.org/.
13. C. A. F. D. Rose, T. Ferreto, R. N. Calheiros, W. Cirne, L. B. Costa, and D. Fireman. Allocation strategies for utilization of space-shared resources in bag of tasks grids. Future Gener. Comput. Syst., 24(5):331-341, 2008.
14. D. Zhou and V. Lo. Cluster computing on the fly: resource discovery in a cycle sharing peer-to-peer system. Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on, pages 66-73, April 2004.