Complexity results for throughput and latency optimization of replicated and data-parallel workflows

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2007, Pages 497-506

  Benoit, Anne ^a   Robert, Yves ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; CONFORMAL MAPPING; NUCLEAR PROPULSION; PIPELINES; THROUGHPUT;

BI-CRITERIA; CHALLENGING PROBLEM; CLUSTER COMPUTING; COMMUNICATION COSTS; COMPLEXITY RESULTS; DATA-PARALLEL; EXHAUSTIVE LIST; INHERENT COMPLEXITY; INTERNATIONAL CONFERENCES; MAPPING APPLICATIONS; MAPPING OPTIMIZATION; MAPPING PROBLEMS; NP-HARD; PARALLEL PLATFORMS; POLYNOMIAL ALGORITHMS; PROBLEM INSTANCES; SIMPLIFIED MODELS; WORKFLOW APPLICATIONS;

OPTIMIZATION;

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

References (22)

1. 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.
2. 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.
3. 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.
4. 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.
5. A. Benoit and Y. Robert, "Mapping pipeline skeletons onto heterogeneous platforms," LIP, ENS Lyon, France, Research Report 2007-05, Jan. 2007, available at graal.ens-lyon.fr/~yrobert/. Updated version of RR-2006-40. Short version to appear in ICCS'2007.
6. J. Subhlok and G. Vondran, "Optimal latency-throughput tradeoffs for data parallel pipelines," in ACM Symposium on Parallel Algorithms and Architectures SPAA'96. ACM Press, 1996, pp. 62-71.
7. S. H. Bokhari, "Partitioning problems in parallel, pipeline, and distributed computing," IEEE Trans. Computers, vol. 37, no. 1, pp. 48-57, 1988.
8. 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.
9. 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.
10. 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.
11. G. Amdahl, "The validity of the single processor approach to achieving large scale computing capabilities," in AFIPS Conference Proceedings, vol. 30. AFIPS Press, 1967, pp. 483-485.
12. Y.-K. Kwok and I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors," ACM Computing Surveys, vol. 31, no. 4, pp. 406-471, 1999.
13. H. Topcuoglu, S. Hariri, and M. Y. Wu, "Performance-effective and lowcomplexity task scheduling for heterogeneous computing," IEEE Trans. Parallel Distributed Systems, vol. 13, no. 3, pp. 260-274, 2002.
14. P. Bhat, C. Raghavendra, and V. Prasanna, "Efficient collective communication in distributed heterogeneous systems," Journal of Parallel and Distributed Computing, vol. 63, pp. 251-263, 2003.
15. 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.
16. B. Hong and V. Prasanna, "Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput," in Proceedings of the 32th International Conference on Parallel Processing (ICPP'2003). IEEE Computer Society Press, 2003.
17. F. Rabhi and S. Gorlatch, Patterns and Skeletons for Parallel and Distributed Computing. Springer Verlag, 2002.
18. M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
19. A. Benoit and Y. Robert, "Complexity results for throughput and latency optimization of replicated and data-parallel workflows," LIP, ENS Lyon, France, Research Report 2007-12, Mar. 2007, available at graal.ens-lyon.fr/~abenoit/.
20. L. Marchal, V. Rehn, Y. Robert, and F. Vivien, "Scheduling and data redistribution strategies on star platforms," LIP, ENS Lyon, France, Research Report 2006-23, June 2006.
21. 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.
22. "DataCutter Project: Middleware for Filtering Large Archival Scientific Datasets in a Grid Environment," http://www.cs.umd.edu/projects/ hpsl/ResearchAreas/DataCutter.htm.