No-wait scheduling in single-hop multi-channel lans

DOI10.1016/J.IPL.2004.09.013MaRDI QIDQ834980zbMATH OpenOpenAlexFDO

Authors Fengfeng Zhou, Yinlong Xu, Guoliang Chen

Publication date 27 August 2009

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

Full work available at URL https://doi.org/10.1016/j.ipl.2004.09.013

zbMATH Keywords

approximation ratioLANmakespanno-waitscheduling

Mathematics Subject Classification ID

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

Recommendations

• Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
• Scheduling multicast input-queued switches
• Longest wait first for broadcast scheduling (extended abstract)

Cites work

• An experimental study of online scheduling algorithms
• Approximation algorithms for scheduling unrelated parallel machines
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: No-wait scheduling in single-hop multi-channel lans

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