Optimal processor scheduling when service times are hyperexponentially distributed and preemption overhead is not negligible
By: by Kenneth C. Sevcik.
Contributors: University of Toronto. Computer Systems Research Group.
Series: Technical report -- CSRG-16; Technical report CSRG (University of Toronto.  Computer Systems Research Group) -- 16
Publisher: Computer Systems Research Group, University of Toronto
Published: 1972
Place of publication: Toronto
Language: eng
Number of pages: 21
Subjects: Electronic data processing; Multiprogramming (Electronic computers)
Notes: Bibliography: leaf 21.