On the Execution of Parallel Programs on Multiprocessor Systems—a Queuing Theory Approach

Journal of the ACM (JACM)

Volumn 37, Issue 2, 1990, Pages 373-414

  Baccelli, François ^a   Liu, Zhen ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY--QUEUEING THEORY;

LOWER BOUNDS; PARALLEL PROGRAMS; SYNCHRONIZED QUEUEING NETWORKS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025419614     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/77600.77622     Document Type: Article

References (44)

1. ANDREWS, G. R., AND SCHNEIDER, F. B. Concepts and notations for concurrent programming. ACM Comput. Surv. 15, 1 (Mar. 1983), 3-43.
2. BACCELLI, F. TWO parallel queues created by arrivals with two demands: The M/G/2 symmetrical case. INRIA Rapport de Recherche, No. 426. INRIA, Valbonne, France, July 1985.
3. BACCELLI, F., AND BREMAUD, P. Palm probabilities and stationary queues. In Lecture Notes in Statistics, No. 41. Springer-Verlag, New York, 1987.
4. BACCELLI, F., AND LIU, Z. On the stability condition of a precedence-based queueing discipline. Adv. Appl. Prob. 21 (1989), 883-887.
5. BACCELLI, F., AND LIU, Z. On a class of stochastic evolution equations. Ann. Prob., to appear.
6. BACCELLI, F., AND MAKOWSKI, A. Simple computable bounds for the fork-join queue. In Proceedings of the Conference for Information Science Systems. Johns Hopkins Univ., Baltimore, Md., March 1985, pp. 436-441.
7. BACCELLI, F., MAKOWSKI, A., AND SHWARTZ, A. Fork-join queue and related systems with synchronization constraints: Stochastic ordering, approximations and computable bounds. J. Adv. Prob. 21 (1989), 629-660.
8. BACCELLI, F., MASSEY, W. A., AND TOWSLEY, D. Acyclic fork-join queuing networks. J. ACM 36, 3 (July 1989), 615-642.
9. BATTAREL, G. J., AND SAVARY, H. F. Interprocess communication system of the MT35 digital exchange. Comput. Commun. Rev. 13, 2 (1983), 197-203.
10. BARLOW, R., AND PROSCHAN, F. Statistical Theory of Reliability and Life Testing. Holt, Rinehart and Winston, New York, 1975.
11. CHEN, W. K. Applied graph theory. In Applied Mathematics and Mechanics, H. A. Lauwerier and W. T. Koiter, eds. North-Holland, New York, 1971.
12. CHU, W. W., AND LEUNG, K. K. Module replication and assignment for real-time distributed processing systems. Proc. IEEE 75, 5 (May 1987), 547-562.
13. COFFMAN, E. G., AND DENNING, P. J. Operating Systems Theory. Prentice-Hall, New York, 1972.
14. COSNARD, M., AND ROBERT, Y. Algorithmique Parallèle: Une Étude de Complexité. Techniques et Sciences Informatiques, Paris, France, 1987.
15. DEVROYE, L. P. Inequalities for the completion times of stochastic PERT networks. Math. Oper. Res. 4 (1980), 441-447.
16. DODIN, B. Bounding the project completion time distribution in PERT networks. Oper. Res. 33, 4 (July-Aug. 1985), 862-881.
17. DUNCAN, T., AND HUEN, W. H. Software structure of no. 5 ESS-A distributed telephone switching system. IEEE Trans. Commun. COM-30, 6 (1982), 1379-1385.
18. ELMAGHRABY, S. E. On the expected duration of PERT type networks. Manage. Sci. 13 (1967), 469-481.
19. FLATTO, L., AND HAHN, S. TWO parallel queues created by arrivals with two demands. SIAM J. Appl. Math 44 (1984), 1041-1053.
20. GELENBE, E., AND LIU, Z. Performance analysis approximations for parallel processing on multiprocessor systems. In IFIP Working Conference on Parallel Processing (Pisa, Italy, Apr.) North-Holland, New York, 1988, pp. 363-375.
21. GELENBE, E., MONTAGNE, E., SUROS, R., AND WOODSIDE, C. M. A performance model of block-structured parallel programs. In Proceedings of the International Workshop on Parallel Algorithms and Architectures, M. Cosnard, et al., eds. North-Holland, New York, 1986, pp. 127-138.
22. GELENBE, E., NELSON, P., PHILIPS, T., AND TANTAWI, A. The asymptotic processing time for a model of parallel processing. In Proceedings of the National Computer Conference (Las Vegas). 1986.
23. HOARE, C. A. R. Communicating sequential processes. Commun. ACM 21, 8 (Aug. 1978), 666-677.
24. HOLLIDAY, M. A., AND VERNON, M. K. Exact performance estimates for multiprocessor memory and bus interference. IEEE Trans. Comput. C-36, 1 (Jan. 1987), 76-85.
25. HUANG, J. P. Modeling of software partition for distributed real-time applications. IEEE Trans. Softw. Eng. SE-11, 10 (1985), 1113-1126.
26. JONES, A. K., AND SCHWARZ, P. Experience using multiprocessor systems-A status report. ACM Comput. Surv. 12, 2 (June 1980), 121-165.
27. KINGMAN, J. F. C. The ergodic theory of subadditive stochastic processes. J. Roy. Statist. Soc. Ser. B 30 (1968), 499-510.
28. KINGMAN, J. F. C. Subadditive ergodic theory. Ann. Prob 1 (1973), 883-909.
29. KINGMAN, J. F. C. Subadditive processes. In École d'dté de Probabilité de Saint-Flour, P.-L. Hennequin, ed. Lecture Notes in Mathematics, vol. 539. Springer-Verlag, New York, 1976, 165-223.
30. LAMPORT, L. Time, clocks and the ordering of events in a distributed system. Commun. ACM 21, 7 (July 1978), 558-565.
31. Liu, Z. Evaluation des performances d'dpplications paralléles sur des systèmes multiprocesseurs. Rapport de DEA, Univ. of Paris-Sud, Paris, France, Sept. 1986.
32. LOYNES, R. M. The stability of queues with non independent inter-arrival and service times. Proc. Cambridge Ph. Soc. 58 (1962), 497-520.
33. MARSAN, M. A., BALBO, G., CONTE, G., AND GREGORETTI, F. Modeling bus contention and memory interference in a multiprocessor system. IEEE Trans. Comput. C-32, 1 (Jan. 1983), 60-71.
34. MARSAN, M. A., AND GREGORETTI, F. Memory interference models for a multiprocessor system with a shared bus and a single external common memory. Microproc. Microprog. 7 (1981), 124-133.
35. MILUTINOVIC, V., FORTES, J. A. B., AND JAMIESON, L. H. A multimicroprocessor architecture for real-time computation of a class of DFT algorithms. IEEE Trans. ASSP ASSP-34, 5 (1986), 1301-1309.
36. NELSON, R., AND TANTAWI, A. N. Approximate analysis of fork/join synchronization in parallel queues. IEEE Trans. Comput. C-37, 6 (1988), 739-743.
37. PYLE, I. C. The Ada Programming Language. Prentice-Hall International, London, 1981.
38. SIGMAN, K. Regeneration in queues with regenerative input. Queue. Syst., to appear.
39. STAFYLOPATIS, A., AND GELENBE, E. Delay analysis of resequencing systems with partial ordering. In Proceedings of PERFORMANCE 87, P.-J. Courtois and G. Latouche, eds. North Holland, New York, Dec. 1987, pp. 433-446.
40. STOYAN, D. Comparison Methods for Queues and Other Stochastic Models (English translation), D. J. Daley, ed. Wiley, New York, 1984.
41. TALBOT, F. B., PATTERSON, J. H., AND GEHRLEIN, W. V. A comparative evaluation of heuristic line balancing techniques. Manage. Sci. 32, 4 (Apr. 1986), 430-454.
42. TOWSLEY, D., AND Yu, S. P. Bounds for two server fork-join queueing systems. Tech. Rep. TR87-123. Dept. of Comput. Inf. Sci., Univ. Mass., Amherst, Mass., Nov. 1987.
43. TSITSIKLIS, J. N., PAPADIMITRIOU, C. H., AND HUMBLET, P. The performance of a precedence-based queuing discipline. J. ACM 33, 3 (July 1986), 593-602.
44. YALAMANCHILI, S., AND AGGARWAL, J. K. A characterization and analysis of parallel processor interconnection networks. IEEE Trans. Comput. C-36, 6 (June 1987), 680-691.