An improved analysis of SRPT scheduling algorithm on the basis of functional optimization

DOI10.1016/J.IPL.2012.08.009MaRDI QIDQ456176zbMATH OpenOpenAlexFDO

Authors Hiroshi Fujiwara, Yoshiyuki Sekiguchi

Publication date 23 October 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10091/00020332

zbMATH Keywords

analysis of algorithmscompetitive analysisfunctional analysison-line algorithmsscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• SRPT is 1.86-competitive for completion time scheduling
• New results on competitive analysis of online SRPT scheduling
• Revisiting SRPT for job scheduling in computing clusters
• Online scheduling on identical machines using SRPT
• scientific article; zbMATH DE number 6469165

Cites work

• Average-case competitive analyses for one-way trading
• Efficient algorithms for average completion time scheduling
• scientific article; zbMATH DE number 46153 (Why is no real title available?)
• scientific article; zbMATH DE number 50713 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• Minimizing average completion time in the presence of release dates
• SRPT is 1.86-competitive for completion time scheduling

This page was built for publication: An improved analysis of SRPT scheduling algorithm on the basis of functional optimization

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