Evaluation of knapsack-based scheduling using the NPACIJOBLOG

20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment, 2006. HPCS 2006

Volumn , Issue , 2006, Pages 15-

  Vanderster, Daniel C ^a   Dimopoulos, Nikitas J ^a   Parra Hernandez, Rafael ^a   Sobie, Randall J ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; RESOURCE ALLOCATION; SCHEDULING;

COMPUTATIONAL GRID DEPLOYMENT; INTERARRIVAL TIME; TASK REALLOCATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33751054586     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCS.2006.23     Document Type: Conference Paper

References (16)

1. H. Casanova. Simgrid: A toolkit for the simulation of application scheduling. In Proceedings of the IEEE Symposium on Cluster Computing and the Grid (CCGrid'01), 5 2001.
2. D. Feitelson and A. Weil. Utilization and predictability in scheduling the ibm sp2 with backfilling. In Parallel Processing Symposium, 1998.
3. J. Frey, T. Tannenbaum, M. Livny, I. Foster, and S. Tuecke. Condor-g: A computation management agent for multi-institutional grids. In Proceedings of the Tenth International Symposium on High Performance Distributed Computing. IEEE Press, 8 2001.
4. Globus Alliance Website. [Online]. Available: http://www.globus.org/.
5. GridX1 Website. [Online]. Available: http://www.gridxl.oa/.
6. R. Loulou and E. Michaelides. New greedy-like heuristics for the multidimensional 0-1 knapsack problem. Operations Research, pages 1101-1114, 11 1979.
7. NPACI JOBLOG Job Trace Repository, 2000. [Online]. Available: http://joblog.npaci.edu/.
8. J. K. Ousterhout. Scheduling techniques for concurrent systems. In Proceedings of the 3rd International Conference on Distributed Computer Systems, pages 22-30, 10 1982.
9. D. Paranhos, W. Cirne, and F. Brasileiro. Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids. In Proceedings of the Euro-Par, 2003.
10. R. Parra-Hernandez and N. Dimopoulos. Heuristic approaches for solving the multidimensional knapsack problem (mkp). WSEAS Transactions on Systems, pages 248-253, 4 2002.
11. R. Parra-Hernandez and N. Dimopoulos. A new heuristic for solving the multi-choice multidimensional knapsack problem. IEEE Transactions on Systems, Man, and Cybernetics, 35(5):708-717, 2005.
12. R. Parra-Hernandez, D. Vanderster, and N. J. Dimopoulos. Resource management and knapsack formulations on the grid. In Proceedings of Grid 2004 - 5th IEEE/ACM International Workshop on Grid Computing, pages 94-101, 11 2004.
13. H. Pirkul. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics, pages 161-172, 1987.
14. P. Sobalvarro, S. Pakin, W. Weihl, and A. Chien. Dynamic coscheduling on workstation clusters. In Proceedings of Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'98 Workshop. Springer-Verlag Heidelberg, 3 1998.
15. Virtual Data Toolkit, 2005. [Online]. Available: http://www.cs.wisx.edu/ vdt/.
16. R. Walker, M. Vetterli, R. Impey, G. Mateescu, B. Caron, A. Agarwal, A. Dimopoulos, L. Klektau, C. Lindsay, R. J. Sobie, and D. Vanderster. Federating Grids: LCG Meets Canadian HEPGrid. In Proceedings of Computing in High Energy and Nuclear Physics 2004, 2004.