Supporting distributed application workflows in heterogeneous computing environments

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn , Issue , 2008, Pages 3-10

  Wu, Qishi ^a   Gu, Yi ^a  

^a University of Memphis   (United States)

Author keywords

Graph mapping; Heuristic algorithm; Minimum end to end delay; NP complete; Pptimization problem

Indexed keywords

ANALYTICAL MODELS; COMMUNICATION LINKS; COMPLEX STRUCTURES; CRITICAL PATHS; DIRECTED ACYCLIC GRAPHS; DISTRIBUTED APPLICATIONS; EXISTING METHODS; FAST RESPONSE; GRAPH MAPPING; HETEROGENEOUS COMPUTING; HEURISTIC APPROACHES; LARGE-SCALE COMPUTING; MINIMUM END-TO-END DELAY; NETWORK NODES; NP-COMPLETE; OPTIMIZATION PROBLEMS; PPTIMIZATION PROBLEM; RESOURCE-SHARING; SCIENCE AND ENGINEERINGS; SIMULATED DATA SETS; TASK GRAPHS; WORK-FLOWS;

APPLICATIONS; DATA PROCESSING; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; PORTALS; SYSTEMS ENGINEERING; WIRELESS LOCAL AREA NETWORKS (WLAN);

HEURISTIC ALGORITHMS;

EID: 60649109658     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2008.40     Document Type: Conference Paper

References (21)

1. F. Afrati, C. Papadimitriou, and G. Papageorgiou. Scheduling dags to minimize time and communication. In Proc. of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, pages 134-138. Springer-Verlag, 1988.
2. B. Agarwalla, N. Ahmed, D. Hilley, and U. Ramachandran. Streamline: a scheduling heuristic for streaming application on the grid. In The 13th Multimedia Computing and Networking Conf., San Jose, CA, 2006.
3. T. Braun, H. Siegel, N. Beck, L. Boloni, M. Maheswaran, A. Reuther, J. Robertson, M. Theys, B. Yao, D. Hensgen, and R. Freund. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. JPDC, 61(6):810-837, June 2001.
4. L. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In Proc. of the 3rd IAPR-TC-15 Int. Workshop on Graph-based Representations, Italy, 2001.
5. P. Foggia, C. Sansone, and M. Vento. A performance comparison of five algorithms for graph isomorphism. In Proc. of 3rd IAPR-TC-15 Int. Workshop Graph-based Representations in Pattern Recognition, pages 188-199, 2001.
6. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
7. Y. Gu, Q. Wu, M. Zhu, and N. Rao. Complexity analysis of pipeline mapping problems in distributed heterogeneous networks. In Proc. of Int. Symp. on Computer and Sensor Network Systems, pages 618-625, Zhengzhou, P.R. China, Apr. 7-10 2008.
8. J. Hopcroft and J. Wong. Linear time algorithm for isomorphism of planar graphs. In Proc. of the 6th Annual ACM Symp., Theory of Computing, pages 172-184, 1974.
9. Y. Kwok and I. Ahmad. Dynaimic critical-path scheduling: an effective technique for allocating task graph to multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 7(5), May 1996.
10. Y. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406-471, Dec. 1999.
11. T. Lewis and H.EI-Rewini. Introduction to Parallel Computing. Prentice Hall, New York, 1992.
12. E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. of Computer System Science, pages 42-65, 1982.
13. T. Ma and R. Buyya. Critical-path and priority based algorithms for scheduling workflows with parameter sweep tasks on global grids. In Proc. of the 17th Int. Symp. on Computer Architecture on High Performance Computing, pages 251 - 258, 2005.
14. B. Messmer. Efficient Graph Matching Algorithms for Preprocessed Model Graphs. PhD thesis, Institute of Computer Science and Applied Mathematics, University of Bern, 1996.
15. B. Messmer and H. Bunke. Subgraph isomorphism in polynomial time. Technical Report IAM 95-003, University of Bern, Institute of Computer Science and Applied Mathematics, Bern, Switzerland, 1995.
16. M. Rahman, S. Venugopal, and R. Buyya. A dynamic critical path algorithm for scheduling scientific workflow applications on global grids. In Proc. of the 3rd IEEE Int. Conf. on e-Science and Grid Computing, pages 35-42, 2007.
17. D. Schmidt and L. Druffel. A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. J. of the ACM, 23:433-445, 1976.
18. A. Sekhar, B. Manoj, and C. Murthy. A state-space search approach for optimizing reliability and cost of execution in distributed sensor networks. In Proc. of Int. Workshop on Distributed Computing, pages 63-74, 2005.
19. J. Ullmann. An algorithm for subgraph isomorphism. J. of the ACM, 23:31-42, 1976.
20. Q. Wu, Y. Gu, M. Zhu, and N. Rao. Optimizing network performance of computing pipelines in distributed environments. In Proc. of the 22nd IEEE Int. Parallel and Distributed Processing Symp., Miami, Florida, Apr. 14-18 2008.
21. Q. Wu and N. S. V. Rao. On transport daemons for small collaborative applications over wide-area networks. In Proc. of the 24th IEEE Int. Performance Computing and Communications Conf., pages 159-166, Phoenix, AZ, Apr. 7-9 2005.