A Queueing Model with Finite Waiting Room and Blocking
Journal of the ACM (JACM)
A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions
Journal of the ACM (JACM)
Capacity Bounds for Multiresource Queues
Journal of the ACM (JACM)
Maximum Processing Rates of Memory Bound Systems
Journal of the ACM (JACM)
A Finite-Source Queue with Different Customers
Journal of the ACM (JACM)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
Optimality of scheduling policy for processing a job stream
ACM Transactions on Computer Systems (TOCS)
Analyzing queueing networks with simultaneous resource possession
Communications of the ACM
Memory management and response time
Communications of the ACM
Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system
Communications of the ACM
Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history
Communications of the ACM
Performance monitors for multi-programming systems
SOSP '69 Proceedings of the second symposium on Operating systems principles
Optimal scheduling policies for mixed scalar-vector multiprocessor supercomputers
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Load-balancing heuristics and process behavior
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
A model for an adaptive scheduler
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Hi-index | 0.00 |
The scheduling of jobs for multiprogramming systems includes the selection of jobs to be loaded into memory (job loading policy or memory schedule) and the scheduling for CPU processing (CPU schedule). There has been a successful empirical claim for the optimal CPU schedule; its optimality has been proved in a Markovian model of job-stream processing that uses the first-come-first-loaded (FCFL) job loading policy. We extend this model to gain insight into the effects of job loading policies.The model studied consists of an input stream of jobs of two classes and a multiple-resource system (the model of a multiprogramming system) with a stack for waiting jobs. The system consists of a finite amount of memory and a cyclic queue of a single (CPU) server station and a multiple (I/O) server station. The values of parameters describing each class of jobs are distinct except the mean I/O service time and the amount of memory required. The estimate of the maximum processing capacity (throughput bound) of the system is obtained and is shown to be achieved by the combination of the empirically claimed optimal CPU schedule and a job loading policy whereby the set of jobs in memory is kept to be (nearly) balanced with respect to the job stream. Furthermore, we show that the job loading policies independent of the system status have no improvement over the FCFL policy.Our investigation, supported by numerical calculations, suggests that much more care may be needed in implementing the job loading policy that aims at the optimal processing capacity than in implementing the optimal CPU schedule. This agrees with what has been conjectured on the basis of empirical studies.