Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Abstract— We consider a multi-class queueing system operating under the Discriminatory Processor-Sharing (DPS) discipline. The DPS discipline provides a natural approach for mode...
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
- Collaborative filtering is a widely used and proven method of building recommender systems that provide personalized recommendations on products or services based on explicit rat...