This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Queueing Network Models for Parallel Processing with Asynchronous Tasks
November 1982 (vol. 31 no. 11)
pp. 1099-1109
P. Heidelberger, IBM Thomas J. Watson Research Center
Computer performance models of parallel processing systems in which a job subdivides into two or more tasks at some point during its execution are considered. Except for queueing effects, the tasks execute independently of one another and do not require synchronization. An approximate solution method is developed and results of the approximation are compared to those of simulations. Bounds on the performance improvement due to overlap are derived.
Index Terms:
queueing network models, Approximate solution, computer systems modeling, multiprogramming, multitasking, parallel processing, performance evaluation
Citation:
P. Heidelberger, K.S. Trivedi, "Queueing Network Models for Parallel Processing with Asynchronous Tasks," IEEE Transactions on Computers, vol. 31, no. 11, pp. 1099-1109, Nov. 1982, doi:10.1109/TC.1982.1675926
Usage of this product signifies your acceptance of the Terms of Use.