Greedy multiprocessor server scheduling

DOI10.1016/J.ORL.2005.07.005MaRDI QIDQ2466596zbMATH OpenOpenAlexFDO

Authors Carl Bussema, Eric Torng

Publication date 15 January 2008

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2005.07.005

zbMATH Keywords

algorithmsgreedyflowonline schedulingmultiprocessor\(\ell_p\) norm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 67289
• Multiprocessor scheduling by generalized extremal optimization
• Multiple server preemptive scheduling with impatience
• A scheduling problem for several parallel servers
• On multiprocessor system scheduling
• scientific article; zbMATH DE number 4072695
• scientific article; zbMATH DE number 3970495
• Shared multi-processor scheduling
• Task allocation in a multi-server system
• Multiprocessor scheduling with machine allotment and parallelism constraints

Cites work

• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 2079378 (Why is no real title available?)
• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• scientific article; zbMATH DE number 1833400 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 1445347 (Why is no real title available?)
• Algorithms for minimizing weighted flow time
• LATIN 2004: Theoretical Informatics
• Minimizing the flow time without migration
• Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
• Online Scheduling to Minimize Average Stretch
• Optimal time-critical scheduling via resource augmentation
• Server scheduling in the L _p norm

Cited in

(4)

• Non-clairvoyantly scheduling to minimize convex functions
• Fair scheduling via iterative quasi-uniform sampling
• LATIN 2004: Theoretical Informatics
• The efficiency-fairness balance of round robin scheduling

This page was built for publication: Greedy multiprocessor server scheduling

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