Sensitivity analysis of knapsack-based task scheduling on the grid

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2006, Pages 317-323

  Vanderster, Daniel C ^a   Dimopoulos, Nikitas J ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER RESOURCE MANAGEMENT; DISTRIBUTED COMPUTER SYSTEMS; QUALITY OF SERVICE; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING ALGORITHMS;

COMPUTATIONAL GRIDS; KNAPSACK STRATEGY; UTILITY FUNCTION;

MULTITASKING;

EID: 34547446679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183401.1183446     Document Type: Conference Paper

References (15)

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'Ol), 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 et al. 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. R. Loulou and E. Michaelides. New greedy-like heuristics for the multidimensional 0-1 knapsack problem. Operations Research, pages 1101-1114, 11 1979.
5. G. Mounie, C Rapine, and D. Trystram. Efficient approximation algorithms for scheduling malleable tasks. In Proceedings of the 11th annual ACM Symposium on Parallel Algorithms and Architecture, pages 23-32, 1999.
6. NPACI JOBLOG Job Trace Repository. [Online]. Available: http://joblog.npaci.edu/, 2000.
7. J. K. Ousterhout. Scheduling techniques for concurrent systems. In Proceedings of the 3rd International Conference on Distributed Computer Systems, pages 22-30, 10 1982.
8. P. Barham et al. Xen and the Art of Virtualization. In Proceedings of the 19th ACM Symposium on Operating Systems Principles, 10 2003.
9. D. Paranhos, W. Cime, 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/A CM International Workshop on Grid Computing, pages 94-101, 11 2004.
13. P.G. Sobalvarro et al. Dynamic coscheduling on workstation clusters. In Proceedings of Job Scheduling Strategies for Parallel Processing: IPPS/SPDP'98 Workshop. Springer-Verlag Heidelberg, 3 1998.
14. H. Pirkul. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics, pages 161-172, 1987.
15. D. C Vanderster, N. J. Dimopoulos, R. Parra,-Hernandez, and R. J. Sobie. Evaluation of Knapsack-based Scheduling using the NPACI JOBLOG. In Proceedings of HPCS 2006 - 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment, 5 2006.