Waiting Time Distributions in the Preemptive Accumulating Priority Queue
MetadataShow full item record
We consider a queueing system in which a single server attends to N priority classes of customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a rate which is distinct to the class to which it belongs. Customers with greater accumulated priority levels are given preferential treatment in the sense that at every service selection instant, the customer with the greatest accumulated priority level is selected next for servicing. Furthermore, the system is preemptive so that the servicing of a customer is interrupted for customers with greater accumulated priority levels. The main objective of the paper is to characterize the waiting time distributions of each class. Numerical examples are also provided which exemplify the true benefit of incorporating an accumulating prioritization structure, namely the ability to control waiting times.
Cite this version of the work
Val Andrei Fajardo, Steve Drekic (2017). Waiting Time Distributions in the Preemptive Accumulating Priority Queue. UWSpace. http://hdl.handle.net/10012/12058
Showing items related by title, author, creator and subject.
Fajardo, Val Andrei (University of Waterloo, 2016-01-08)Priority queueing systems are oftentimes set up so that arriving customers are placed into one of $N$ distinct priority classes. Moreover, to determine the order of service, each customer (upon arriving to the system) is ...
From the ground up: Building a roadmap of research priorities for a national research data management community Cheung, Melissa; Dearborn, Dylanne; Da Sylva, Lyne; Khair, Shahira; Szigeti, Kathy (2019-05)Launched in 2015, the Canadian Association of Research Libraries (CARL) Portage Network is dedicated to the shared stewardship of research data in Canada through fostering national communities of practice for research data, ...
Zhang, Yifan (University of Waterloo, 2018-05-18)Existing studies of priority queue implementations often focus on improving canonical operations such as insert and deleteMin, while sacrificing design simplicity and pre- dictable worst-case latency. Design simplicity is ...