Round-robin scheduling algorithm with multiple distributed windows

DOI10.1007/3-540-45801-8_76MaRDI QIDQ3044863zbMATH OpenFDO

Authors Bum Sik Bae, Hyeong-Ho Lee, Hyeung Sub Lee, Jin Seek Choi

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2344/23440814.htm

zbMATH Keywords

Bandwidth guaranteeIntegrated services networkQuality-of-serviceRound-robinScheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Round robin scheduling -- a survey
• Due window scheduling for parallel machines
• Round-robin scheduling with regard to rest differences
• A fair service and dynamic round robin scheduling algorithm
• Round robin scheduling of heterogeneous parallel servers in heavy traffic
• Windows scheduling of arbitrary-length jobs on multiple machines
• Dynamic windows scheduling with reallocation

Cited in

(6)

• A fair service and dynamic round robin scheduling algorithm
• Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth
• A round robin scheduling policy for Ada
• scientific article; zbMATH DE number 2165697 (Why is no real title available?)
• Round robin thread selection optimization in multithreaded processors
• Approximate sorting of packet-scheduling in high-speed networks

This page was built for publication: Round-robin scheduling algorithm with multiple distributed windows

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