• Publication
  • 2006
  • Issue No. 8 - August
  • Abstract - Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments
August 2006 (vol. 17 no. 8)
pp. 883-896
Cevdet Aykanat, IEEE Computer Society

Abstract—The scheduling of independent but file-sharing tasks on heterogeneous master-slave platforms has recently found important applications in Grid environments. The scheduling heuristics recently proposed for this problem are all constructive in nature and based on a common greedy criterion which depends on the momentary completion time values of the tasks. We show that this greedy decision criterion has shortcomings in exploiting the file-sharing interaction among tasks since completion time values are inadequate to extract the global view of this interaction. We propose a three-phase scheduling approach which involves initial task assignment, refinement, and execution ordering phases. For the refinement phase, we model the target application as a hypergraph and, with an elegant hypergraph-partitioning-like formulation, we propose using iterative-improvement-based heuristics for refining the task assignments according to two novel objective functions. Unlike the turnaround time, which is the actual schedule cost, the smoothness of proposed objective functions enables the use of iterative-improvement-based heuristics successfully since their effectiveness and efficiency depend on the smoothness of the objective function. Experimental results on a wide range of synthetically generated heterogeneous master-slave frameworks show that the proposed three-phase scheduling approach performs much better than the greedy constructive approach.

[1] S. Ali, H.J. Siegel, M. Maheswaran, and D. Hensgen, “Task Execution Time Modeling for Heterogeneous Computing Systems,” Proc. IEEE Ninth Heterogeneous Computing Workshop, May 2000.
[2] C.J. Alpert, J.H. Huang, and A.B. Kahng, “Multilevel Circuit Partitioning,” Proc. ACM 34th Ann. Conf. Design Automation, pp. 530-533, 1997.
[3] R. Armstrong, “Investigation of Effect of Different Run Time Distributions on Smartnet Performance,” MS thesis, Dept. of Computer Science, Naval Postgraduate School, 1997.
[4] C. Aykanat, A. Pinar, and Ü.V. Çatalyürek, “Permuting Sparse Rectangular Matrices into Block-Diagonal Form,” SIAM J. Scientific Computing, vol. 25, no. 6, pp. 1860-1879, 2004.
[5] O. Beaumont, A. Legrand, and Y. Robert, “The Master-Slave Paradigm with Heterogeneous Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 9, pp. 897-908, Sept. 2003.
[6] C. Berge, Hypergraphs. Amsterdam: North Holland, 1989.
[7] F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail, M. Faerman, S.M. Figueira, J. Hayes, G. Obertelli, J.M. Schopf, G. Shao, S. Smallen, N.T. Spring, A. Su, and D. Zagorodnov, “Adaptive Computing on the Grid Using AppLeS,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 369-382, Apr. 2003.
[8] H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, “Heuristics for Parameter Sweep Applications in Grid Environments,” Proc. Ninth IEEE Heterogeneous Computing Workshop, pp. 349-363, 2000.
[9] H. Casanova, G. Obertelli, F. Berman, and R. Wolski, “The Apples Parameter Sweep Template: User-Level Middleware for the Grid,” Proc. IEEE/ACM Supercomputing Conf. (SC '00), p. 60, 2000.
[10] Ü.V. Çatalyürek and C. Aykanat, “Hypergraph-Partitioning Based Decomposition for Parallel Sparse-Matrix Vector Multiplication,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 7, pp. 673-693, July 1999.
[11] Ü.V. Çatalyürek and C. Aykanat, “Hypergraph Model for Mapping Repeated Sparse-Matrix Vector Product Computations onto Multicomputers,” Proc. Second Int'l Conf. High Performance Computing, pp. 27-30, Dec. 1995.
[12] J.J. Dongarra, H.W. Meuer, and E. Strohmaier, “TOP 500 Supercomputer Sites, 22nd Edition,” Proc. IEEE/ACM Supercomputing Conf. (SC '03), 2003.
[13] C.M. Fidducia and R.M. Mattheyses, “A Linear-Time Heuristic for Improving Network Partitions,” Proc. ACM/IEEE 19th Design Automation Conf., pp. 175-181, 1982.
[14] “High Performance Schedulers,” The Grid: Blueprint for a New Computing Infrastructure, I. Foster and C. Kesselman, eds., pp. 279-309, Morgan-Kaufmann, 1999.
[15] A. Giersch, Y. Robert, and F. Vivien, “Scheduling Tasks Sharing Files on Heterogeneous Master-Slave Platforms,” Proc. 12th IEEE Euromico Workshop Parallel Distributed and Network-Based Processing (PDP '04), 2004.
[16] A. Giersch, Y. Robert, and F. Vivien, “Scheduling Tasks Sharing Files on Heterogeneous Clusters,” Technical Report RR-2003-28, LIP, ENS Lyon, France, May 2003.
[17] G. Karypis and V. Kumar, “Multilevel k-Way Partitioning Scheme for Irregular Graphs,” J. Parallel and Distributed Computing, vol. 48, no. 1, pp. 96-129, 1998.
[18] B.W. Kernighan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” The Bell System Technical J., vol. 49, no. 2, pp. 291-307, 1970.
[19] T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Chichester, U.K.: Wiley-Teubner, 1990.
[20] D. Lu and P.A. Dinda, “GridG: Generating Realistic Computational Grids,” ACM SIGMETRICS Performance Evaluation Rev., vol. 30, no. 4, pp. 33-40, 2003.
[21] M. Maheswaran, S. Ali, H.J. Siegel, D. Hensgen, and R. Freund, “Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems,” J. Parallel and Distributed Computing, vol. 59, no. 2, pp. 107-131, 1999.
[22] L.A. Sanchis, “Multiple-Way Network Partitioning,” IEEE Trans. Computers, vol. 38, no. 1, pp. 62-81, Jan. 1989.
[23] B. Uçar and C. Aykanat, “Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies,” SIAM J. Scientific Computing, vol. 25, no. 6, pp. 1837-1859, 2004.

Index Terms:
Scheduling, file-sharing tasks, heterogeneous master-slave platform, grid computing, iterative improvement.
Citation:
Kamer Kaya, Cevdet Aykanat, "Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 8, pp. 883-896, Aug. 2006, doi:10.1109/TPDS.2006.105
Usage of this product signifies your acceptance of the Terms of Use.