Scheduling of tasks with batch-shared I/O on heterogeneous systems

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Vydyanathan, Nagavijayalakshmi ^a   Khanna, Gaurav ^a   Catalyurek, Umit ^a,b   Kurc, Tahsin ^b   Sadayappan, P ^a   Saltz, Joel ^a,b  

^a The Ohio State University   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; GRAPH THEORY; HEURISTIC METHODS; MEDICAL IMAGING; SCHEDULING;

FILE SHARING; HYPERGRAPH PARTITIONING; ITERATIVE MAPPING-REFINEMENT HEURISTICS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33847097420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639388     Document Type: Conference Paper

References (28)

1. T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. Hensgen, and R. F. Freund. A comparison study of static mapping heuristics for a class of meta- tasks on heterogeneous computing systems. Journal of Parallel and Distributed Computing, 61:810-837, 2001.
2. T. N. Bui, C. Heigham, C. Jones, and F. T. Leighton. Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms. In Proceedings of the 26th ACM/IEEE Design Automation Conference, pages 775-778, 1989.
3. H. Casanova. Simgrid: A toolkit for the simulation of application scheduling. In Proceedings of the IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2001), pages 430-441, 2001.
4. H. Casanova, G. Obertelli, F. Berman, and R. Wolski. The AppLeS parameter sweep template: User-level middleware for the grid. In Proceedings of the 2000 ACM/IEEE SC00 Conference, pages 75-76, 2000.
5. H. Casanova, D, Zagorodnov, F. Berman, and A. Legrand, Heuristics for scheduling parameter sweep applications in grid environments. In Proceedings of the 9th Heterogeneous Computing Workshop (HCW'00), pages 349-363. IEEE Computer Society, 2000.
6. U. V. Çatalyürek and C. Aykanat. Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, 1999.
7. C. Chang, B. Moon, A. Acharya, C. Shock, A. Sussman, and J. Saltz. Titan: A high performance remote-sensing database. In Proceedings of the 1997 International Conference on Data Engineering, pages 375-384. IEEE Computer Society Press, April 1997.
8. M. M. Eshaghian and Y. C. Wu. Mapping heterogeneous task graphs ontp heterogeneous system graphs. In Proceedings of the 6th Heterogeneous Computing Workshop, pages 147-160, Geneva, Switzerland, April 1997. IEEE Computer Society Press.
9. C. Faloutsos and S. Roseman. Fractals for secondary key retrieval. In the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, PA, March 1989.
10. C. Fiduccia and R. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of the 19th IEEE Design Automation Conference, pages 175-181, Las Vegas, Nevada, June 1982.
11. A. Giersch, Y. Robert, and F. Vivien. Scheduling tasks sharing flies from distributed repositories. In Euro-Par 2004: Parallel Processing: 10th International Euro-Par Conference, volume 3149 of Lecture Notes in Computer Science, pages 246-253, Sept. 2004.
12. S. M. Hart and C. L. S. Chen. Simulated annealing and the mapping problem: A computational study. Computers Operations Research, 21(4):455-461, 1994.
13. O. Ibarra and C. Kim. Heuristic algorithms for scheduling independent tasks on nonindentical processors. Journal of the ACM, 24(2):280-289, Apr 1977.
14. M. Iverson and F. Ozguner. Dynamic, competitive scheduling of multiple dags in a distributed heterogeneous environment. In Proceedings of the 7th Heterogeneous Computing Workshop, Orlando, FL, March 1998. IEEE Computer Society Press.
15. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research, 37(6): 865-892, November 1989.
16. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: Applications in VLSI domain. In 34th Design Automation Conference, Anaheim, CA, June 1997.
17. K. Kaya and C. Aykanat, Iterative-improvement-based heuristics for adaptive scheduling of tasks sharing files on heterogeneous master-slave environments, IEEE Transactions on Parallel and Distributed Systems, 2006. accepted subject to minor revision.
18. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307, February 1970.
19. G. Khanna, N. Vydyanathan, T. Kurc, U. Catalyurek, P. Wyckoff, J. Saltz, and P. Sadayappan. A hypergraph partitioning based approach for scheduling of tasks with batchshared I/O. In Proceedings of the 5th IEEE/ACM International Symposium on Cluster Computing and the Grid (CC-Grid 2005), 2005.
20. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, May 1983.
21. A. Legrand, L. Marchal, and H. Casanova. Scheduling distributed applications: the simgrid simulation framework. In Proceedings of the IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2003), pages 138-145, 2003.
22. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Willey-Teubner, Chichester, U.K., 1990.
23. M. Maheswaran, S. Ali, H. J. Siegel, D. A. Hensgen, and R. F. Freund. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In Heterogeneous Computing Workshop (HCW'99), pages 30-44, Apr. 1999.
24. H. Maini, K. Mehrotra, C. Mohan, and S. Ranka. Genetic algorithms for graph partitioning and incremental graph partitioning. In Supercomputing '94: Proceedings of the 1994 ACM/IEEE conference on Supercomputing, pages 449-457, New York, NY, US A, 1994. ACM Press.
25. L. A. Sanchis. Multiple-way network partitioning. IEEE Transactions on Computers, 38(1):62-81, January 1989.
26. E.-G. Talbi and P. Bessiere. A parallel genetic algorithm for the graph partitioning problem. In ICS '91: Proceedings of the 5th international conference on Supercomputing, pages 312-320, New York, NY, USA, 1991. ACM Press.
27. D. Thain, J. Bent, A. Arpaci-Dusseau, R. Arpaci-Dusseau, and M. Livny. Pipeline and batch sharing in grid workloads. In Proceedings of High-Performance Distributed Computing (HPDC-12), pages 152-161, Seattle, Washington, June 2003.
28. M. Uysal, T. M. Kurc, A. Sussman, and J. Saltz. A performance prediction framework for data intensive applications on large scale parallel machines. In Proceedings of the Fourth Workshop on Languages, Compilers and Runtime Systems for Scalable Computers, number 1511 in Lecture Notes in Computer Science, pages 243-258. Springer-Verlag, May 1998.