Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Program Suitability for Parallel Processing
IEEE Transactions on Computers
A survey of techniques for recognizing parallel processable streams in computer programs
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Analytic Queueing Network Models for Parallel Processing of Task Systems
IEEE Transactions on Computers
Analytic Queueing Models for Programs with Internal Concurrency
IEEE Transactions on Computers
Queueing Network Models for Parallel Processing with Asynchronous Tasks
IEEE Transactions on Computers
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Hi-index | 14.99 |
This paper investigates some of the effects of varying the number of central processing units (CPU's) available to a multiprogramming system both when parallel processing of a single task (multitasking) is allowed and is not allowed. The variables investigated are those that would be expected to control the CPU queue length distribution and include the degree of multiprogramming, CPU service discipline, CPU service distribution, the degree of cooperation between processors engaged in multitasking, and the ratio of CPU to I/O service capacity. The computer systems are modeled by queueing networks. Analytic results are displayed in many cases with supplementation by numeric and simulation solutions when convenient or necessary. It is demonstrated that under properly defined conditions doubling the number of CPU's in a system can more than double throughput. The effectiveness of multitasking in improving throughput is found to be fairly small if the degree of multiprogramming ranges from modest to high.