Queueing theory: Difference between revisions

Content deleted Content added
m →‎Spelling: better wording
Line 149:
; Priority: Customers with high priority are served first.<ref name="penttinen"/> Priority queues can be of two types, non-preemptive (where a job in service cannot be interrupted) and preemptive (where a job in service can be interrupted by a higher-priority job). No work is lost in either model.<ref>{{Cite book | last1 = Harchol-Balter | first1 = M.|author1-link=Mor Harchol-Balter | chapter = Scheduling: Non-Preemptive, Size-Based Policies | doi = 10.1017/CBO9781139226424.039 | title = Performance Modeling and Design of Computer Systems | pages = 499–507 | year = 2012 | isbn = 9781139226424 }}</ref>
 
; [[Shortest job first]]: The next job to be served is the one with the smallest size<ref>{{cite book|author1=Andrew S. Tanenbaum|author2=Herbert Bos|title=Modern Operating Systems|url=https://books.google.com/books?id=9gqnngEACAAJ|year=2015|publisher=Pearson|isbn=978-0-13-359162-0}}</ref>
 
; Preemptive shortest job first: The next job to be served is the one with the original smallest size<ref>{{Cite book | last1 = Harchol-Balter | first1 = M. |author1-link=Mor Harchol-Balter| chapter = Scheduling: Preemptive, Size-Based Policies | doi = 10.1017/CBO9781139226424.040 | title = Performance Modeling and Design of Computer Systems | pages = 508–517 | year = 2012 | isbn = 9781139226424 }}</ref>