Stochastic analysis of gang scheduling in parallel and distributed systems
Performance Evaluation
Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
Maximum Processing Rates of Memory Bound Systems
Journal of the ACM (JACM)
An analytical model for a parallel fault-tolerant computing system
Performance Evaluation
Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A two-class parallel system with general service times of the parallel class
Journal of Computer and System Sciences
Hi-index | 0.00 |
We analyze a parallel system model with one queue, two servers and rigid jobs. Each job arriving to the queue may require either one or two servers. Jobs that require one server (type-1 jobs) have exponentially distributed service requirements while jobs requiring two servers (type-2 jobs) have general service time distribution. The FCFS scheduling discipline is assumed and all jobs are served according to pure space sharing. By applying the supplementary variable method we derive closed-form expressions, exact as well as approximate, for the steady-state mean queue length and utilization of the servers. In addition, we investigate the utilization as well as the throughput of the system as the load reaches its maximal value inside the stability region. Numerical results are presented that give insight into the impact of each parameter on system performance.