Discovering piecewise linear models of grid workload

CCGrid 2010 - 10th IEEE/ACM International Conference on Cluster, Cloud, and Grid Computing

Volumn , Issue , 2010, Pages 474-484

  Élteto, Tamás ^a   Germain Renaud, Cécile ^a   Bondon, Pascal ^b   Sebag, Michèle ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIV PARIS SUD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER COMPUTING; PIECEWISE LINEAR TECHNIQUES;

COMPARATIVE EXPERIMENTS; COMPLEX DATA; COMPUTING ACTIVITY; INTELLIGENT RESOURCE; PIECEWISE LINEAR; PIECEWISE LINEAR MODELS; ROBUST MODELS; WORK-LOAD MODELS;

GRID COMPUTING;

EID: 77954928404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2010.69     Document Type: Conference Paper

References (36)

1. The Grid Observatory Portal. www.grid-observatory.org.
2. L. Breiman. Bagging predictors. Mach. Learn., 24(2), 1996.
3. J. Brevik, D. Nurmi, and R. Wolski. Predicting bounds on queuing delay in space-shared computing environments. In IISWC, pages 213-224, 2006.
4. P. Burns. Robustness of the ljung-box test and its rank equivalent. In The Journal of Derivatives, pages 7-18, 2002.
5. R. A. Davis, T. Lee, and G. Rodriguez-Yam. Structural break estimation for nonstationary time series models. J. American Statist. Assoc., 101:229-239, 2006.
6. P. A. Dinda and D. R. O'Hallaron. Host load prediction using linear models. Cluster Computing, 3(4):265-280, 2000.
7. A. B. Downey. Using queue time predictions for processor allocation. In IPPS'97, JSSPP'97, pages 35-57, 1997.
8. B. Efron. Bootstrap. another look at jackknife. Ann. Statist., 7(1):1-26, 1979.
9. A. Iosup et al. The Grid Workloads Archive. Future Gener. Comput. Syst., 24(7):672-686, 2008.
10. E. Laure et al. Programming the Grid with gLite. Computational Methods in Science and Technology, 12(1):33-45, 2006.
11. F. Gagliardi et. al. Building an Infrastructure for scientific Grid computing: status and goals of the EGEE project. Phil. Trans. of the Royal Society A, 1833, 2005.
12. S. Andreozzi et al. Glue Schema Specification, V1.3. Technical report, Open Grid Forum, 2008.
13. R. Gott III. Implications of the copernican principle for our future prospects. Nature, (363):315-319, 1993.
14. L. Ilijašić and L. Saitta. Characterization of a computational grid as a complex system. In Procs. of GMAC '09, pages 9-18, 2009.
15. S. Jha, M. Parashar, and O. Rana. Investigating autonomic behaviours in grid-basedcomputational science applications. In Proceedings of GMAC'09, pages 29-38, 2009.
16. B.-D. Lee and J. M. Schopf. Run-time prediction of parallel applications on shared environments. In CLUSTER, pages 487-491, 2003.
17. T-W Lee and Y. Yang. Bagging binary and quantile predictors for times series. Journal of econometrics, 135(1-2):465-497, 2006.
18. H. Li and M. Muskulus. Analysis and modeling of job arrivals in a production grid. SIGMETRICS Perform. Eval. Rev., 34(4):59-70, 2007.
19. D. Lingrand, T. Glatard, and J. Montagnat. Modeling the latency on production grids with respect to the execution context. Parallel Computing, 35(2009):493-511, 2009.
20. C. Loomis. The Grid Observatory. In Grids Meet Autonomic Computing workshop at ICAC'09. ACM, 2009.
21. M. Macias, O. Rana, G. Smith, J. Guitart, and J. Torres. Maximising revenue in grid markets using an economically enhanced resource manager. Concurrency and Computation: Practice and Experience, 2008.
22. J. Meng, S. T. Chakradhar, and A. Raghunathan. Best-effort parallel execution framework for recognition and mining applications. In IPDPS, pages 1-12, 2009.
23. N. Mi, G. Casale, L. Cherkasova, and E. Smirni. Injecting realistic burstiness to a traditional client-server benchmark. In Proceedings of ICAC '09, pages 149-158, 2009.
24. A. Mutz, R. Wolski, and J. Brevik. Eliciting honest value information in a batch-queue environment. In Proceedings of GRID '07, pages 291-297, 2007.
25. 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, 2006.
26. T. Élteto″, C. Germain-Renaud, P. Bondon, and M. Sebag. Discovering linear models of grid workload. RR 7112, INRIA, 2009.
27. J. Perez, C. Germain-Renaud, B. Kégl, and C. Loomis. Utility-based reinformcement learning for reactive grids. In The 5th IEEE ICAC Autonomic Computing, 2008.
28. J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Scientific, 1989.
29. W. Smith, V. E. Taylor, and I. T. Foster. Using runtime predictions to estimate queue wait times and improve scheduler performance. In IPPS/SPDP '99, JSSPP'99, pages 202-219, 1999.
30. O. Sonmez, N. Yigitbasi, A. Iosup, and D. Epema. Tracebased evaluation of job runtime and queue wait time predictions in grids. In Proceedings of HPDC '09, 2009.
31. G. Tesauro, N. K. Jong, R. Das, and M. N. Bennani. On the use of hybrid reinforcement learning for autonomic resource allocation. Cluster Computing, 10(3):287-299, 2007.
32. D. Thain, J. Bent, A. Arpaci-Dusseau, R.Arpaci-Dusseau, and M. Livny. Gathering at the well: Creating communities for grid i/o. In Procs of Supercomputing, 2001.
33. D. Vengerov. A reinforcement learning approach to dynamic resource allocation. Eng. Appl. Artif. Intell., 20(3), 2007.
34. R. Wolski, N. T. Spring, and J. Hayes. Predicting the cpu availability of time-shared unix systems on the computational grid. Cluster Computing, 3(4):293-301, 2000.
35. L. Yang, J. M. Schopf, and I. Foster. Conservative scheduling: Using predicted variance to improve scheduling decisions in dynamic environments. In SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing, page 31, 2003.
36. X. Zhang, C. Furtlehner, J. Perez, C. Germain-Renaud, and M. Sebag. Toward autonomic grids: analyzing the job flow with affinity streaming. In Proc. of the 15th ACM SIGKDD, pages 987-996, 2009.