An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Stochastic analysis of gang scheduling in parallel and distributed systems
Performance Evaluation
Processor Saving Scheduling Policies for Multiprocessor Systems
IEEE Transactions on Computers
Maximum Processing Rates of Memory Bound Systems
Journal of the ACM (JACM)
An analytical model for a parallel fault-tolerant computing system
Performance Evaluation
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Performance Modelling of Communication Networks and Computer Architectures (International Computer S
Implementing Multiprocessor Scheduling Disciplines
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The Performance of Processor Co-Allocation in Multicluster Systems
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
ADAPTLOAD: Effective Balancing in Custered Web Servers Under Transient Load Conditions
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Aggregate matrix-analytic techniques and their applications
Aggregate matrix-analytic techniques and their applications
A two-class parallel system with general service times of the parallel class
Journal of Computer and System Sciences
Two-server parallel system with pure space sharing and Markovian arrivals
Computers and Operations Research
| Hi-index | 0.98 |
We analyze a parallel system with two identical servers and pure space sharing among rigid jobs. The parallel system is modelled as an M/M/2 queue with two types of jobs. Jobs of one type are parallel ones and require two servers while jobs of the other type need one server to start execution. Analysis of the system leads to a quartic polynomial for which a real root inside the unit disk is located. This root is then used to derive closed-form expressions for the mean queue length, mean response time as well as mean utilization of the system. The maximal utilization of the servers is also found. In addition, we provide an approximation that simplifies the previously found exact but complex expressions and gives insight into the impact of different parameters on system performance. Numerical experiments are presented and our formulae are validated by simulation.