Revisiting SRPT for job scheduling in computing clusters

DOI10.1007/978-3-030-27181-7_17MaRDI QIDQ2177563zbMATH OpenOpenAlexFDO

Authors Huanle Xu, Huangting Wu, Wing Cheong Lau

Publication date 6 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-27181-7_17

zbMATH Keywords

competitive performance bounddual-fittingjob schedulingSRPT

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• New results on competitive analysis of online SRPT scheduling
• SRPT is 1.86-competitive for completion time scheduling
• Online scheduling on identical machines using SRPT
• scientific article; zbMATH DE number 6469165
• SRPT optimally utilizes faster machines to minimize flow time

Cited in

(5)

• New results on competitive analysis of online SRPT scheduling
• An improved analysis of SRPT scheduling algorithm on the basis of functional optimization
• SRPT optimally utilizes faster machines to minimize flow time
• Online scheduling on identical machines using SRPT
• SRPT is 1.86-competitive for completion time scheduling

This page was built for publication: Revisiting SRPT for job scheduling in computing clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177563)