Computing performance bounds of fork-join parallel programs under a multiprocessing environment

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 3, 1998, Pages 295-311

  Lui, John C S ^a,b   Muntz, Richard R ^a,c   Towsley, Don ^a,d  

^a IEEE   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Analysis of multiprocessing systems; High performance computing; Performance evaluation; Performance modeling methodology

Indexed keywords

PARALLEL ALGORITHMS; QUEUEING THEORY;

FORK JOIN PARALLEL PROGRAMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032022053     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.674321     Document Type: Article

References (32)

1. F. Baccelli, A.M. Makowski, and A. Shwartz. "The Fork-Join Queue and Related Systems with Synchronization Constraints: Stochastic Ordering and Computable Bounds," Advanced Applied Probability, vol. 21, pp. 629-660, 1989.
2. F. Baccelli, W.A. Massey, and D. Towsley, "Acyclic Fork-Join Queueing Networks," J. ACM, vol. 36, no. 3, pp. 615-642, July 1989.
3. A. Beguelin, J.J. Dongarra, A. Geist, R. Manchek, and V. Sunderam, "PVM and HeNCE: Tools for Heterogeneous Network Computing," Advances in Parallel Computing: Environments and Tools for Parallel Scientific Computing, pp. 139-153, 1993.
4. S. Chen and D. Towsley, "Design and Modeling Policies for Two Server Fork/Join Queueing Systems," COINS Technical Report 91-39, Univ. of Massachusetts, 1991.
5. P.J. Courtois, Decomposability - Queueing and Computer System Applications. New York: Academic Press, 1977.
6. P.J. Courtois and P. Semal, "Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models," IEEE J. Systems and Circuits, vol. 4, no. 6, Sept., 1986.
7. L. Flatto and S. Hahn, "Two Parallel Queues Created by Arrivals with Two Demands I," SIAM J. Applied Math., vol. 44, pp. 1,041-1,053, Oct. 1984.
8. L. Flatto, "Two Parallel Queues Created by Arrivals with Two Demands II," SIAM J. Applied Math., vol. 45, pp. 861-878, Oct. 1985.
9. G.A. Geist and V.S. Sunderam, "The PVM System: Supercomputing Level Concurrent Computations on Heterogeneous Network of Workstations," Sixth Distributed Memory Computing Conf. Proc., pp. 258-261, Apr. 1991.
10. P. Heidelberger and K.S. Trivedi. "Queueing Network Models for Parallel Processing with Asynchronous Tasks." IEEE Trans. Computers, vol. 31, no. 11, pp.1,099-1,109, Nov. 1982.
11. P. Heidelberger and K.S. Trivedi, "Analytic Queueing Models for Programs with Internal Concurrency," IEEE Trans. Computers, vol. 32, no. 11, pp. 73-82, Nov. 1983.
12. C.A.R. Hoare, Communicating Sequential Processes. London: Prentice-Hall Int'l, 1985.
13. F.P. Kelly, Reversibility and Stochastic Networks. New York: Wiley, 1979.
14. C. Kim and A.K. Agrawala. "Analysis of the Fork-Join Queue." IEEE Trans. Computers, vol. 38, no. 2, pp. 250-255, Feb. 1989.
15. L. Kleinrock, Queueing Systems Vol. I: Theory. Wiley Int'l, 1975.
16. P. Konstantopoulos and J. Walrand, "Stationary and Stability of Fork-Join Networks," J. Applied Probability, vol. 26, pp. 604-614, 1989.
17. C.P. Kruskal and A. Weiss, "Allocating Independent Substasks on Parallel Processors," IEEE Trans. Software Eng., vol. 11, pp. 1,001-1,016, Oct. 1985
18. Y.C. Liu and H.G. Perros. "A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System," IEEE Trans. Computers, vol. 40, no. 3, pp. 365-770, Mar. 1991.
19. J.C.S. Lui, R.R. Muntz, and D. Towsley, "Bounding the Response Time of a Minimum Expected Delay Routing System: An Algorithmic Approach," IEEE Trans. Computers, vol. 44, no. 5, pp. 1,371-1,382, May 1995.
20. J.C.S. Lui and R.R. Muntz, "Computing Bounds on Steady State Availability of Repairable Computer Systems," J. ACM, vol. 41, no. 4, pp. 676-707, July 1994.
21. A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Applications. New York: Academic Press, 1979.
22. A. Makowski and S. Varma, "Interpolation Approximations for Symmetric Fork-Join Queues," Proc. Performance '93. Also in Performance Evaluation 20, pp. 145-165, 1994.
23. R.R. Muntz, E. De Souza, E Silva, and A. Goyal. "Bounding Availability of Repairable Computer Systems," Proc. 1989 ACM SIGMETRICS and PERFORMANCE '89. Also in special issue of IEEE Trans. Computers, vol. 38, no. 12, pp. 19-30, Dec. 1989.
24. R. Nelson and A.N. Tantawi, "Approximate Analysis of Fork/Join Synchronization in Parallel Queues," IEEE Trans. Computers, vol. 37, no. 6, June, 1988.
25. R. Nelson, D. Towsley, and A.N. Tantawi, "Performance Analysis of Parallel Processing Systems," IEEE Trans. Software Eng., vol. 14, no. 4, pp. 532-540, Apr. 1988.
26. I.C. Pyle, The Ada Programming Language. London: Prentice-Hall Int'l, 1981.
27. A. Giest, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, "PVM 3.0 User's Guide and Reference Manual," Oak Ridge National Lab., 1993.
28. S.M. Ross, Introduction to Probability Models. Academic Press, 1970.
29. C. Schimmel, Unix Systems for Modern Architectures: Symmetric Multiprocessing and Caching for Kernel Programmers. Addison-Wesley, 1994.
30. M.R. Stonebraker, "The Case for Shared-Nothing," Proc. 1986 Data Engineering Conf. IEEE, 1986.
31. A. Thomasian and A.N. Tantawi, "Approximate Solutions for M/G/1 Fork/Join Synchronization," Proc. 1994 Winter Simulation Conf., pp. 361-368, Orlando, Fla., Dec. 1994.
32. D. Towsley, J.A. Rommel, and J.A. Stankovic, "The Performance of Processor Sharing Scheduling Fork-Join in Multiprocessors". High-Performance Computer Systems, E. Gelenbe, ed., pp. 146-156. Amsterdam, North-Holland: 1988.