ABSTRACT
We present an efficient algorithm for effecting round-robin service in discrete-event simulation systems. The approach generalizes and improves upon a previous approach in which a single arrival and a single departure event is considered and handled at a time; further, the previous approach is already an improvement over naive round-robin scheduling currently in use in simulation libraries. The prior proposal offered a run-time complexity of <i>O(n</i><sup>2</sup>), because the processing of each event required an entire traversal of the job pool. We propose a generalized algorithm which includes the previous case and also accommodates burst arrivals and batch departures, further reducing run-time complexity to <i>O (n</i> log <i>n</i>). This is achieved through a detailed but efficient computation of multiple departure times, while simultaneously obviating the need for a job pool update with each departure. Empirical results are presented to compare performance with previously proposed algorithms.
- Cormen, T., C. Leiserson, R. Rives, and C. Stein. 2001. Introduction to Algorithms, Chapter 14: Augmenting Data Structures. 2d ed. Boston, MA: McGraw-Hill. Google ScholarDigital Library
- Fishman, G. S. 2001. Discrete-Event Simulation. New York: Springer-Verlag. Google ScholarDigital Library
- Law, A. and W. D. Kelton. 2000. Simulation Modeling and Analysis. 3d ed. Boston, MA: McGraw-Hill. Google ScholarDigital Library
- Mascarenhas, E. and V. Rego. 1996. Ariadne: Architecture of a Portable Threads system supporting Thread Migration. Software - Practice and Experience 26(3):327--357.Google ScholarCross Ref
- McHaney, R. 1991. Computer Simulation: A practical perspective. San Diego, CA: Academic Press. 1991. Google ScholarDigital Library
- Sang, J., K. Chung, and V. Rego. 1994. Efficient algorithms for simulating service disciplines. Simulation Practice & Theory 1:223--244. Google ScholarDigital Library
- Schwetman, H. D. 1988. Using CSIM to model complex systems. In Proceedings of the 1988 Winter Simulation Conference, ed. M. Abrams, P. Haigh, and J. Comfort, 246 - 253. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers. Google ScholarDigital Library
Recommendations
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
Motivated by modern call centers, we consider large-scale service systems with multiple server pools and a single customer class. For such systems, we propose a simple routing rule which asymptotically minimizes the steady-state queue length and virtual ...
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers
Motivated by call centers, we study large-scale service systems with homogeneous impatient customers and heterogeneous servers; the servers differ with respect to their speed of service. For this model, we propose staffing and routing rules that are ...
Service Interruptions in Large-Scale Service Systems
Large-scale service systems, where many servers respond to high demand, are appealing because they can provide great economy of scale, producing a high quality of service with high efficiency. Customer waiting times can be short, with a majority of ...
Comments