Analytic Queueing Network Models for Parallel Processing of Task Systems

IEEE Transactions on Computers

Volumn C-35, Issue 12, 1986, Pages 1045-1054

  Thomasian, Alexander ^a   Bay, Paul F ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b NORTHROP GRUMMAN CORPORATION   (United States)

Author keywords

Computer system performance; data allocation; graph model; hierarchical decomposition; Markov chain; multiprocessing; multiprogramming; occurrence graph; parallel processing; queueing network model; task scheduling; task system

Indexed keywords

COMPUTER METATHEORY - PROBABILISTIC LOGICS; COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

ANALYTIC QUEUEING NETWORK (QN) MODEL; MARKOV CHAIN; QN SOLVER; STATE TRANSITION TIMES; TASK INITIATION/COMPLETION TASK;

PROBABILITY;

EID: 0022895657     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1986.1676712     Document Type: Article

References (23)

1. G. T. Almes and E. D. Lazowska, “The behaviour of ethernet-like computer communication networks,” in Proc. ACM 7th Symp. Operat. Syst. Principles, Pacific Grove, CA, Dec. 1979, pp. 66–81.
2. M. Ajmone-Marsan, G. Balbo, and G. Conte, “A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems,” ACM Trans. Comput. Syst., vol. 2, pp. 93–122, May 1984.
3. J. L. Baer, “A survey of some theoretical aspects of multiprocessing,” ACM Comput. Surv., vol. 5, pp. 31–80, Mar. 1983.
4. P. F. Bay, “Queueing network models of distributed systems,” Ph.D. dissertation, Dep. Elec. Eng. Syst., Univ. Southern California, Aug. 1984.
5. P. A. Bernstein and N. Goodman, “Concurrency control in distributed database systems,” ACM Comput. Surv., vol. 13, pp. 185–221, June 1981.
6. J. C. Browne, et al., “The effect on throughput of multiprocessing in a multiprogramming environment,” IEEE Trans. Comput., vol. C-22, pp. 728–735, Aug. 1973.
7. R. M. Bryant and J. R. Agre, “A queueing network approach to the module allocation problem in distributed systems,” in Proc. 1981 ACMSIGMETRICS Conf. Meas. Mod. Comput. Syst., Las Vegas, NV, May, 1981, pp. 191–204.
8. W. W. Chu, et al., “Task allocation in distributed data processing,” IEEE Computer, vol. 13, pp. 57–69, Nov. 1980.
9. E. G. Coffman, Jr., Ed., Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
10. P. J. Courtois, Decomposability: Queueing and Computer System Applications. New York: Academic, 1977.
11. L. W. Dowdy and D. V. Foster, “Comparative models of the file assignment problem,” ACM Comput. Surv., vol. 14, pp. 287–313, June 1982.
12. H. J. Fromm, et al., “Experiences with performance measurement and modeling of a processor array,” IEEE Trans. Comput., vol. C-32, pp. 15–31, Jan. 1983.
13. P. Heidelberger and K. S. Trivedi, “Queueing network models for parallel processing with asynchronous tasks,” IEEE Trans. Comput., vol. C-31, 1099–1108, Nov. 1982.
14. —, “Analytic queueing models for programs with internal concurrency,” IEEE Trans. Comput., vol. C-32, pp. 73–82, Jan. 1983.
15. S. S. Lavenberg, Ed., Computer Performance Modeling Hand-book. New York: Academic, 1983.
16. E. D. Lazowska, et al., Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: Prentice-Hall, 1984.
17. P-Y. R. Ma, et al., “A task allocation model for distributed computing IEEE Trans. Comput., vol. C-31, 41–47, Jan. 1982.
18. S. Mahmoud and J. S. Riordon, “Optimal allocation of resources in distributed information networks,” ACM Trans. Data Base Syst., vol. 1, pp. 66–78, Mar. 1976.
19. M. K. Molloy, “Performance analysis using stochastic Petri nets,” IEEE Trans. vol. 1982.
20. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1983.
21. C. H. Sauer and K. M. Chandy, “The impact of distributions and disciplines on multiple processor systems,” Commun. Ass. Comput. Mach., vol. 22, pp. 25–34, Jan. 1979.
22. A. Thomasian and B. Nadji, “Computational algorithms for queueing network models of multiprogrammed computers using generating functions,” Comput. Perform., vol. 2, 100–123, Sept. 1981.
23. A. Thomasian and I. K. Ryu, “A decomposition solution to the queueing network model of the centralized DBMS with static locking,” in Proc. ACM SIGMETRICS Conf, Minneapolis, MN, Aug. 1983, pp. 82–92.