Model-driven simulation of Grid scheduling strategies

Proceedings - e-Science 2007, 3rd IEEE International Conference on e-Science and Grid Computing

Volumn , Issue , 2007, Pages 287-294

  Li, Hui ^a   Buyya, Rajkumar ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; CORRELATION METHODS; MULTITASKING; SCHEDULING; SCHEDULING ALGORITHMS; SUPERCOMPUTERS; SYSTEMS ANALYSIS;

AUTO-CORRELATIONS; CORRELATION STRUCTURES; E SCIENCES; GRID SCHEDULING; GRID SCHEDULING STRATEGIES; INTERNATIONAL CONFERENCES; LONG RANGE DEPENDENCE (LRD); MODEL-DRIVEN; PERFORMANCE IMPACTS; POISSON; SCALING BEHAVIORS; SIMULATION STUDIES; SYSTEM PERFORMANCES; WORKLOAD CORRELATIONS; WORKLOAD MODELING;

GRID COMPUTING;

EID: 44949100210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/E-SCIENCE.2007.51     Document Type: Conference Paper

References (22)

1. P. Abry, M. S. Taqqu, P. Flandrin, and D. Veitch. Self-Similar Network Traffic and Performance Evaluation, K. Park and W. Willinger, editors, chapter Wavelets for the analysis, estimation, and synthesis of scaling data. Wiley, 2000.
2. A. Bucur and D. Epema. Trace-based simulations of processor co-allocation policies in multiclusters. In proceedings of the 12th IEEE Symposium on High Performance Distributed Computing (HPDC), pages 70-79, 2003.
3. R. Buyya and M. Murshed. Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurrency and Computation: Practice and Experience (CCPE), 14, 2002.
4. R. Buyya, M. Murshed, D. Abramson, and S. Venugopal. Scheduling parameter sweep applications on global grids: a deadline and budget constrained costtime optimization algorithm. SoftwarePractice and Experience, 35:491-512, 2005.
5. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in grid environments. In proceedings of the 9th Heterogeneous Computing Workshop (HCW'2000), pages 349-363, 2000.
6. C. Dumitrescu, I. Raicu, and I. Foster. Di-gruber: A distributed approach to grid resource brokering. In proceedings of Supercomputing (SC), 2005.
7. L. He, S. Jarvis, D. Spooner, D. Bacigalupo, G. Tan, and G. Nudd. Mapping dag-based applications to multiclusters with background workload. In proceedings of the 5th IEEE Symposium on Cluster Computing and The Grid (CCGrid), pages 855-862, 2005.
8. H. Li. Long range dependent job arrival process and its implications in grid environments. In MetroGrid workshop, proceedings of First Intl. Conf. on Networks for Grid Applications (GridNets), ACM Press, 2007.
9. H. Li, R. Heusdens, M. Muskulus, and L. Wolters. Analysis and synthesis of pseudo-periodic job arrivals in grids: A matching pursuit approach. In proceedings of IEEE Symposium on Cluster Computing and The Grid (CCGrid), 2007.
10. H. Li and M. Muskulus. Analysis and modeling of job arrivals in a production grid. ACM SIGMETRICS Performance Evaluation Review, 34:59-70, 2007.
11. H. Li, M. Muskulus, and L. Wolters. Modeling correlated workloads by combining model based clustering and a localized sampling algorithm. In proceedings of 21st ACM International Conference on Supercomputing (ICS), 2007.
12. H. Li and L. Wolters. Towards a better understanding of workload dynamics on data-intensive clusters and grids. In proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2007.
13. S. B. Lowen and M. C. Teich. Fractal-Based Point Processes. John Wiley and Sons, Inc., 2005.
14. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 59(2): 107-131, 1999.
15. A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou, K. Vahi, K. Blackburn, D. Meyers, and M. Samidi. Scheduling data intensive workflows onto storage-constrained distributed resources. In proceedings of the 7th IEEE Symposium on Cluster Computing and The Grid (CCGrid), 2007.
16. K. Ranganathan and I. Foster. Decoupling computation and data scheduling in distributed data-intensive applications. In proceedings of the 11th IEEE Symposium on High Performance Distributed Computing (HPDC), 2002.
17. R. Ranjan, A. Harwood, and R. Buyya. Sla-based cooperative superscheduling algorithms for computational grids. ACM Transactions on Autonomous and Adaptive Systems, 2007, to appear.
18. R. H. Riedi, M. S. Crouse, V. J. Ribeiro, and R. G. Baraniuk. A multifractal wavelet model with application to network traffic. IEEE Transactions on Information Theory, 45(3):992-1019, April 1999.
19. G. Singh, C. Kesselman, and E. Deelman. A provisioning model and its comparison with best effort for performancecost optimization in grids. In proceedings of the Sixteenth IEEE International Symposium on High-Performance Distributed Computing (HPDC07), 2007.
20. S. Song, K. Hwang, and Y-K. Kwok. Trusted grid computing with security binding and trust integration. Journal of Grid Computing, 3:53-73, 2005.
21. S. Venugopal and R. Buyya. A set coverage-based mapping heuristic for scheduling distributed data-intensive applications on global grids. In proceedings of the 7th IEEE/ACM International Conference on Grid Computing(Grid06), 2006.
22. Q. Zhang, N. Mi, A. Riska, and E. Smirni. Load unbalancing to improve performance under autocorrelated traffic. In proceedings of IEEE Intl. Conf. Distributed Computing Systems (ICDCS), 2006.