作者: D. Filippopoulos , H. Karatza
DOI: 10.1016/J.JCSS.2007.07.001
关键词: Exponential distribution 、 Monotonic function 、 Service (business) 、 Mathematics 、 Stability (probability) 、 Throughput (business) 、 Distributed computing 、 Queue 、 Class (computer programming) 、 Parallel computing 、 Server 、 Theoretical computer science 、 Computer Networks and Communications 、 Computational Theory and Mathematics 、 Applied mathematics
摘要: A parallel system with two job classes is analyzed. Type-1 jobs require one server for their execution and have exponentially distributed service times while type-2 need servers general times. The model consists of a single queue served by that may work either independently or in parallel. It assumed all are rigid share the according to pure space sharing. We provide closed-form expressions, exact as well approximate, various performance measures interest. approximate formula found be extremely accurate distributions jobs. Furthermore, maximal occupancy throughput examined. Finally, numerical results investigate impact each parameter on conducted.