Computational Schemes For Efficient Simulation Of Service Disciplines

Eficient techniques for simulating the Round-Robin and Processor-Sharing service disciplines are presented. These schemes are general an that they can be applied in any discrete-event simulation view to improve execution performance. For the Round-Robin discipline, the proposed approach is based on computation instead of process switching. For the ProcessorSharing discipline, we introduce a lazy approach in combination with any eficient priority queue structure to reduce scheduling-related computation. Using the Si simulation testbed for Simulating (process) interactions, the proposed algorithms are shown to be more efficient than the standard algorithms for simulating these service disciplines.