Runtime prediction based grid scheduling of parameter sweep jobs

Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008

Volumn , Issue , 2008, Pages 33-38

  Verboven, Sam ^a   Hellinckx, Peter ^a   Arickx, Frans ^a   Broeckhove, Jan ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; MINING;

GRID INFORMATION; GRID SCHEDULING; NEW PARAMETERS; PREDICTION MODEL; PREDICTION SYSTEMS; QUANTUM PHYSICS; REAL-WORLD; RUN-TIME INFORMATION; RUNTIME; RUNTIMES; SCHEDULING TECHNIQUES;

SCHEDULING;

EID: 67049088688     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSCC.2008.189     Document Type: Conference Paper

References (41)

1. BOINC, "Available at http://boinc.berkeley.edu/." [Online]. Available: http://boinc.berkeley.edu/
2. Seti@Home, "Available at http://setiathome.ssl.berkeley.edu." [Online]. Available: http://setiathome.ssl.berkeley.edu
3. P. Hellinckx, G. Stuer, W. Hendrickx, F. Arickx, and J. Broeckhove, "Grid-user driven grid research, the CoBRA grid," in CCGRID '06: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06). Washington, DC, USA: IEEE Computer Society, 2006, p. 49. (Pubitemid 44761831)
4. P. Hellinckx, F. Arickx, J. Broeckhove, and G. Stuer, "The CoBRA grid: a highly configurable lightweight grid," International Journal of Web and Grid Services, vol.3, pp. 267-286(20), 20 August 2007. (Pubitemid 47617191)
5. Condor, "Available at http://www.cs.wisc.edu/condor/."
6. P. Hellinckx, G. Stuer, D. Dewolfs, F. Arickx, J. Broeckhove, and T. Dhaene, "Dynamic problem-independent metacomputing characterization applied to the Condor system," in Procedings ESM2003 p.262- 269, 2003.
7. R. Wolski, "Dynamically forecasting network performance using the network weather service," Cluster Computing, vol.1, no. 1, pp. 119-132, 1998. [Online]. Available: citeseer.ist.psu.edu/wolski98dynamically.html
8. J. Brevik, D. Nurmi, and R. Wolski, "Automatic methods for predicting machine availability in desktop grid and peer-to-peer systems," in CCGRID '04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid. Washington, DC, USA: IEEE Computer Society, 2004, pp. 190-199.
9. M. A. Iverson, F. Özgüner, and L. C. Potter, "Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment," IEEE Trans. Computers, vol.48, no. 12, pp. 1374-1379, 1999. (Pubitemid 30553396)
10. S. Verboven, P. Hellinckx, F. Arickx, and J. Broeckhove, "Dynamic grid scheduling using job runtime requirements and variable resource availability," in Proceedings of EuroPar 2008, 2008.
11. X. Ren, S. Lee, R. Eigenmann, and S. Bagchi, "Resource availability prediction in fine-grained cycle sharing systems," in Proceedings of the Conference on High Performance Distributed Computing, 2006.
12. B. Reistad and D. K. Gifford, "Static dependent costs for estimating execution time," SIGPLAN Lisp Pointers, vol.VII, no. 3, pp. 65-78, 1994.
13. R. F. Freund, "Optimal selection theory for superconcurrency," in Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing. New York, NY, USA: ACM, 1989, pp. 699-703. (Pubitemid 20665970)
14. A. A. Khokhar, V. K. Prasanna, M. E. Shaaban, and C.-L. Wang, "Heterogeneous supercomputing: problems and issues," in Proc. of the 1992 Workshop on Heterogeneous Processing, 1992.
15. -, "Heterogeneous computing: Challenges and opportunities," Computer, vol.26, no. 6, pp. 18-27, 1993.
16. D. Pease, A. Ghafoor, I. Ahmad, D. L. Andrews, K. Foudil-Bey, T. E. Karpinski, M. A. Mikki, and M. Zerrouki, "PAWS: A performance evaluation tool for parallel computing systems," Computer, vol.24, no. 1, pp. 18-29, 1991.
17. J. Yang, I. Ahmad, and A. Ghafoor, "Estimation of execution times on heterogeneous supercomputer architectures," in ICPP '93: Proceedings of the 1993 International Conference on Parallel Processing. Washington, DC, USA: IEEE Computer Society, 1993, pp. 219-226.
18. T. Yang and A. Gerasoulis, "DSC: Scheduling parallel tasks on an unbounded number of processors," University of California at Santa Barbara, Tech. Rep. TRCS94-12, 20, 1994. [Online]. Available: citeseer.ist.psu.edu/ 125354.html
19. W. Smith, I. T. Foster, and V. E. Taylor, "Predicting application run times using historical information," in IPPS/SPDP '98: Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing. London, UK: Springer-Verlag, 1998, pp. 122-142. (Pubitemid 128119034)
20. F. Nadeem, M. M. Yousaf, R. Prodan, and T. Fahringer, "Soft benchmarks-based application performance prediction using a minimum training set," in E-SCIENCE '06: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing. Washington, DC, USA: IEEE Computer Society, 2006, p. 71. (Pubitemid 351147812)
21. M. A. Iverson, F. zgne, and G. J. Follen, "Run-time statistical estimation of task execution times for heterogeneous distributed computing," HPDC, vol.1, pp. 263-, 1996.
22. A. Ali, A. Anjum, J. Bunn, R. Cavanaugh, F. van Lingen, R. McClatchey, M. A. Mehmood, H. Newman, C. Steenberg, M. Thomas, and I. Willers, "Predicting the resource requirements of a job submission." [Online]. Available: citeseer.ist.psu.edu/747807.html
23. M. V. Devarakonda and R. K. Iyer, "Predictability of process resource usage: A measurement-based study on unix," IEEE Trans. Softw. Eng., vol.15, no. 12, pp. 1579-1586, 1989. (Pubitemid 20653705)
24. Å Björck, Numerical Methods for Least Squares Problems. Philadelphia: SIAM, 1996.
25. M. D. Buhmann and M. D. Buhmann, Radial Basis Functions. New York, NY, USA: Cambridge University Press, 2003.
26. V. A. Epanechnikov, "Non-parametric estimation of a multivariate probability density," Theory of Probability and its Applications, vol.14, no. 1, pp. 153-158, 1969. [Online]. Available: *http://link.aip.org/link/? TPR/14/153/1
27. R. L. Eubank, Spline Smoothing and Nonparametric Regression. Dekker, 1988.
28. M. D. Morris, "The design and analysis of computer experiments. thomas j. santner , brian j. williams , and william i. notz," Journal of the American Statistical Association, vol.99, pp. 1203-1204, December 2004, available at *http://ideas.repec.org/a/bes/jnlasa/v99y2004p1203- 1204.html.
29. MNNT, "Available at http://www.mathworks.com/products/neuralnet/. " [Online]. Available: http://www.mathworks.com/products/neuralnet/
30. Joone, "Available at http://www.jooneworld.com/." [Online]. Available: http://www.jooneworld.com/
31. A. M. Andrew, "An introduction to support vector machines and other kernel-based learning methods," Robotica, vol.18, no. 6, pp. 687-689, 2000.
32. J. A. K. Suykens, T. V. Gestel, J. D. Brabanter, B. D. Moor, and J. Vandewalle, Least Squares Support Vector Machines. KU Leuven, 2002.
33. C.-C. Chang and C.-J. Lin, "LIBSVM - a library for support vector machines." [Online]. Available: http://www.csie.ntu.edu.tw/ cjlin/libsvm/
34. P. E. Hart, "The condensed nearest neighbour rule," IEEE Transaction Information Theory, 1968.
35. J. Friedman, F. Baskettand, and L. Sustek, "An algorithm for finding nearest neighbors," IEEE Transaction on computer, vol.24, pp. 1000-1006, 1975.
36. JAMA, "Available at: http://math.nist.gov/javanumerics/jama/."
37. W. K. Edwards, Core Jini. Upper Saddle River, NJ, USA: Prentice Hall PTR, 1999.
38. Jini, "Availbable at *http://www.jini.org."
39. MATLAB, "Available at *http://www.mathworks.com/."
40. J. Broeckhove, F. Arickx, P. Hellinckx, V. Vasilevsky, and A. Nesterov, "The 5h resonance structure studied with a three-cluster j-matrix model," Journal of Physics G Nuclear Physics, vol.34, pp. 1955-1970, Sep. 2007.
41. W. Cirne, D. Paranhos, L. Costa, E. Santos-Neto, F. Brasileiro, J. Sauve, F. A. B. Silva, C. O. Barros, and C. Silveira, "Running bag-of-tasks applications on computational grids: The MyGrid approach," ICPP, vol.00, p. 407, 2003.