|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Analytic Queueing Models for Programs with Internal Concurrency
January 1983 (vol. 32 no. 1)
pp. 73-82
| ASCII Text | x | ||
| P. Heidelberger, K.S. Trivedi, "Analytic Queueing Models for Programs with Internal Concurrency," IEEE Transactions on Computers, vol. 32, no. 1, pp. 73-82, January, 1983. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1983.1676125, author = {P. Heidelberger and K.S. Trivedi}, title = {Analytic Queueing Models for Programs with Internal Concurrency}, journal ={IEEE Transactions on Computers}, volume = {32}, number = {1}, issn = {0018-9340}, year = {1983}, pages = {73-82}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676125}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Analytic Queueing Models for Programs with Internal Concurrency IS - 1 SN - 0018-9340 SP73 EP82 EPD - 73-82 A1 - P. Heidelberger, A1 - K.S. Trivedi, PY - 1983 KW - queueing network models KW - Approximate solution KW - computer systems modeling KW - Markov chain KW - multiprocessing KW - multiprogramming KW - multitasking KW - parallel processing KW - performance evaluation VL - 32 JA - IEEE Transactions on Computers ER - | |||
Analytic queueing models of programs with internal concurrency are considered. The program behavior model allows a process to spawn two or more concurrent tasks at some point during its execution. Except for queueing effects, the tasks execute independently of one another, and at the end of their execution, either wait for all of their siblings to finish execution or merge with the parent if all have finished execution. Two approximate solution methods for the performance prediction of such systems are developed, and results of the approximations are compared to those of simulations. The approximations are both computationally efficient and highly accurate. The gain in performance due to multitasking and multiprocessing is studied with a series of examples.
Index Terms:
queueing network models, Approximate solution, computer systems modeling, Markov chain, multiprocessing, multiprogramming, multitasking, parallel processing, performance evaluation
Citation:
P. Heidelberger, K.S. Trivedi, "Analytic Queueing Models for Programs with Internal Concurrency," IEEE Transactions on Computers, vol. 32, no. 1, pp. 73-82, Jan. 1983, doi:10.1109/TC.1983.1676125
Usage of this product signifies your acceptance of the Terms of Use.