A two-class parallel queue with pure space sharing among rigid jobs and general service times

  • Authors:
  • Dimitrios Filippopoulos;Helen Karatza

  • Affiliations:
  • Aristotle University of Thessaloniki, Thessaloniki, Greece;Aristotle University of Thessaloniki, Thessaloniki, Greece

  • Venue:
  • valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.