Multi-criteria scheduling of pipeline workflows

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2007, Pages 515-524

  Benoit, Anne ^a   Rehn Sonigo, Veronika ^a   Robert, Yves ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; GRAPH THEORY; NUCLEAR PROPULSION;

BI-CRITERIA; CHALLENGING PROBLEM; CLUSTER COMPUTING; EXTENSIVE SIMULATIONS; INTERNATIONAL CONFERENCES; MAPPING PROBLEMS; MULTI-CRITERIA SCHEDULING; NP-HARD; PARALLEL PLATFORMS; RELATIVE PERFORMANCE; SPEED PROCESSORS; WORK-FLOWS; WORKFLOW APPLICATIONS;

PIPELINES;

EID: 53349142207     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2007.4629278     Document Type: Conference Paper

References (22)

1. B. A. Shirazi, A. R. Hurson, and K. M. Kavi, Scheduling and load balancing in parallel and distributed systems. IEEE Computer Science Press, 1995.
2. M. Cole, "Bringing Skeletons out of the Closet: A Pragmatic Manifesto for Skeletal Parallel Programming," Parallel Computing, vol. 30, no. 3, pp. 389-406, 2004.
3. F. Rabhi and S. Gorlatch, Patterns and Skeletons for Parallel and Distributed Computing. Springer Verlag, 2002.
4. S. H. Bokhari, "Partitioning problems in parallel, pipeline, and distributed computing," IEEE Trans. Computers, vol. 37, no. 1, pp. 48-57, 1988.
5. P. Hansen and K.-W. Lih, "Improved algorithms for partitioning problems in parallel, pipeline, and distributed computing," IEEE Trans. Computers, vol. 41, no. 6, pp. 769-771, 1992.
6. B. Olstad and F. Manne, "Efficient partitioning of sequences," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1322-1326, 1995.
7. A. Pinar and C. Aykanat, "Fast optimal load balancing algorithms for 1D partitioning," J. Parallel Distributed Computing, vol. 64, no. 8, pp. 974-996, 2004.
8. P. Bhat, C. Raghavendra, and V. Prasanna, "Efficient collective communication in distributed heterogeneous systems," in ICDCS'99 19th International Conference on Distributed Computing Systems. IEEE Computer Society Press, 1999, pp. 15-24.
9. _, "Efficient collective communication in distributed heterogeneous systems," Journal of Parallel and Distributed Computing, vol. 63, pp. 251-263, 2003.
10. T. Saif and M. Parashar, "Understanding the behavior and performance of non-blocking communications in MPI," in Proceedings of Euro-Par 2004: Parallel Processing, ser. LNCS 3149. Springer, 2004, pp. 173-182.
11. J. Subhlok and G. Vondran, "Optimal mapping of sequences of data parallel tasks," in Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'95. ACM Press, 1995, pp. 134-143.
12. _, "Optimal latency-throughput tradeoffs for data parallel pipelines," in ACM Symposium on Parallel Algorithms and Architectures SPAA'96. ACM Press, 1996, pp. 62-71.
13. M. A. Iqbal, "Approximate algorithms for partitioning problems," Int. J. Parallel Programming, vol. 20, no. 5, pp. 341-361, 1991.
14. M. A. Iqbal and S. H. Bokhari, "Efficient algorithms for a class of partitioning problems," IEEE Trans. Parallel and Distrbuted Systems, vol. 6, no. 2, pp. 170-175, 1995.
15. K. Taura and A. A. Chien, "A heuristic algorithm for mapping communicating tasks on heterogeneous resources," in Heterogeneous Computing Workshop. IEEE Computer Society Press, 2000, pp. 102-115.
16. O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, "Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms," in HeteroPar'2004: International Conference on Heterogeneous Computing, jointly published with ISPDC'2004: International Symposium on Parallel and Distributed Computing. IEEE Computer Society Press, 2004, pp. 296-302.
17. "DataCutter Project: Middleware for Filtering Large Archival Scientific Datasets in a Grid Environment," http://www.cs.umd.edu/projects/ hpsl/ResearchAreas/DataCutter.htm.
18. M. Beynon, A. Sussman, U. Catalyurek, T. Kurc, and J. Saltz, "Performance optimization for data intensive grid applications," in PProceedings of the Third Annual International Workshop on Active Middleware Services (AMS'01). IEEE Computer Society Press, 2001.
19. M. D. Beynon, T. Kurc, A. Sussman, and J. Saltz, "Optimizing execution of component-based applications using group instances," Future Generation Computer Systems, vol. 18, no. 4, pp. 435-448, 2002.
20. M. Spencer, R. Ferreira, M. Beynon, T. Kurc, U. Catalyurek, A. Sussman, and J. Saltz, "Executing multiple pipelined data analysis operations in the grid," in 2002 ACM/IEEE Supercomputing Conference. ACM Press, 2002.
21. N. Vydyanathan, U. Catalyurek, T. Kurc, P. Saddayappan, and J. Saltz, "An approach for optimizing latency under throughput constraints for application workflows on clusters," Ohio State University, Columbus, OH, Research Report OSU-CISRC-1/07-TR03, Jan. 2007, available at ftp://ftp.cse.ohio-state.edu/pub/tech-report/2007.
22. M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.