Benchmark Implementation using MatlabGPSS

• Reference model:
  • easy with standard GPSS elements
  • priority to change the order of concurrent events
  • scaling to 40 queues by changing a number
• Jockeying Queues:
  • trivial using unlink from front and back end of a queue
• Reneging Queues:
  • no access to an entity in the middle of a queue
  • uses the clone trick
    • every incoming entity is cloned
    • one copy enters the queue, the other waits for the reneging waiting time
    • the faster copy wins, the other one is terminated
• Classing Queues:
  • internal reordering not possible
  •  uses shuffle queue trick
    • queue consists of two sequential queues with a gate in between
    • operator call opens the gate → all entities proceed
    • unwanted entities are routed back to initial queue