Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Proceedings of International Symposium on Advances in Computer and Sensor Networks and Systems, 2008

Volumn , Issue , 2008, Pages

  Gu, Yi ^a   Wu, Qishi ^a   Zhu, Mengxia ^b   Rao, Nageswara S V ^c  

^a University of Memphis   (United States)

^b Southern Illinois University at Carbondale   (United States)

^c OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

Computational complexity; Maximum frame rate; Minimum endto end delay; NP complete; Pipeline mapping

Indexed keywords

COMPUTATIONAL COMPLEXITY; HETEROGENEOUS NETWORKS; MAPPING; PIPELINES; POLYNOMIALS; SENSOR NETWORKS; WIDE AREA NETWORKS;

COMPLEXITY ANALYSIS; END TO END DELAY; FRAME RATE; HIGH-PERFORMANCE COMPUTING; NP COMPLETE; PRACTICAL IMPORTANCE; SCIENTIFIC APPLICATIONS; STREAMING DATA PROCESSING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84899146351     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Q. Wu, J. Gao, M. Zhu, N. Rao, J. Huang, and S. Iyengar, "Selfadaptive configuration of visualization pipeline over wide-area networks," IEEE Transactions on Computers, vol. 57, no. 1, pp. 55-68, January 2008.
2. M. Nykänen and E. Ukkonen, "The exact path length problem," Journal of Algorithms, vol. 42, pp. 41-53, January 2002.
3. A. Bashir, V. Susarla, and K. Vairavan, "A statistical study of the performance of a task scheduling algorithm," IEEE Transactions on Computer, vol. 32, no. 12, pp. 774-777, December 1975.
4. V. Chaudhary and J. Aggarwal, "A generalized scheme for mapping parallel algorithms," IEEE Transactions on Parallele and Distributed Systems, vol. 4, no. 3, pp. 328-346, May 1993.
5. S. Kim and J. Browne, "A general approach to mapping of parallel computation upon multiprocessors architectures," in Proceedings of International Conference on Parallel Processing, 1988, pp. 1-8.
6. B. Shirazi, M. Wang, and G. Pathak, "Analysis and evaluation of heuristic methods for static scheduling," Journal of Parallel and Distributed Computing, no. 10, pp. 222-232, 1990.
7. L. Chen and G. Agrawal, "Resource allocation in a middleware for streaming data," in The 2nd Workshop on Middleware for Grid Computing, Toronto, Canada, October 2004.
8. K. M. F. Elsayed, "Hcasp: A hop-constrained adaptive shortestpath algorithm for routing bandwidth-guaranteed tunnels in mpls networks," in Proceedings of the Ninth International Symposium on Computers and Communications, vol. 2. IEEE Computer Society, Washington, DC, USA, 2004, pp. 846-851.
9. R. Guerin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Transaction Networking, vol. 10, no. 5, pp. 613-620, 2002.
10. G. Cheng and N. Ansari, "Finding all hops shortest paths," IEEE Communication Letter, vol. 8, no. 2, February 2004.
11. B. Agarwalla, N. Ahmed, D. Hilley, and U. Ramachandran, "Streamline: a scheduling heuristic for streaming application on the grid," in Thirteenth Multimedia Computing and Networking Conference, San Jose, CA, 2006.
12. Y. Zhu and B. Li, "Overlay network with linear capacity constraints," IEEE Transactions on Parallel and Distributed Systems, to be published.
13. A. Benoit and Y. Robert, "Mapping pipeline skeletons onto heterogeneous platforms," in The International Conference on Computational Science, Lecture Notes in Computer Science, Y. Shi, D. van Albada, J. Dongarra, and P. Sloot, Eds. Springer, 2007, vol. 4487, pp. 591-598.
14. Q. Wu, Y. Gu, M. Zhu, and N. Rao, "Optimizing network performance of computing pipelines in distributed environments," in Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Miami, Florida, April 14-18 2008.
15. Terascale Supernova Initiative (TSI). http://www.phy.ornl.gov/tsi.
16. M. Zhu, Q. Wu, N. Rao, and S. Iyengar, "Optimal pipeline decomposition and adaptive network mapping to support remote visualization," Journal of Parallel and Distributed Computing, vol. 67, no. 8, pp. 947-956, August 2007.