DocumentCode
1145441
Title
Queueing Network Models for Parallel Processing with Asynchronous Tasks
Author
Heidelberger, Philip ; Trivedi, Kishor S.
Author_Institution
IBM Thomas J. Watson Research Center
Issue
11
fYear
1982
Firstpage
1099
Lastpage
1109
Abstract
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.
Keywords
Approximate solution; computer systems modeling; multiprogramming; multitasking; parallel processing; performance evaluation; queueing network models; Central Processing Unit; Computational modeling; Computer networks; Computer performance; Computer science; Concurrent computing; Multitasking; Parallel processing; Performance analysis; Queueing analysis; Approximate solution; computer systems modeling; multiprogramming; multitasking; parallel processing; performance evaluation; queueing network models;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1982.1675926
Filename
1675926
Link To Document