Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal scheduling discipline in a single-server queue with
 

Summary: Optimal scheduling discipline in
a single-server queue with
Pareto type service times
Samuli Aalto (Helsinki University of Technology)
Urtzi Ayesta (LAAS-CNRS)
University of Maryland
26 march, 2008
Scheduling in an M/G/1 Queue
­ Poisson arrivals with rate .
Service requirements are i.i.d. with distribution F(x)=P[X x].
Complementary cumulative distribution denoted by
­ Attained service is known (total service requirement unknown)
­ Optimality criterion: Mean number of jobs in the system
service requirement
server
( ) )x(F1xF -=
Scheduling disciplines
Two important set of disciplines depending on whether the
size of jobs is known.
­ The size is known: Shortest-Remaining-Processing-Time

  

Source: Ayesta, Urtzi - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS

 

Collections: Engineering