Scheduling in synchronous networks and the greedy algorithm

DOI10.1016/S0304-3975(98)00240-0MaRDI QIDQ1292430zbMATH OpenOpenAlexFDO

Authors King-Shan Lui, Shmuel Zaks

Publication date 21 June 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(98)00240-0

zbMATH Keywords

scheduling algorithmsgreedy algorithmssynchronous networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Greedy Packet Scheduling
• Greedy Packet Scheduling on Shortest Paths
• Scheduling time-constrained communication in linear networks
• Scheduling transmissions in a network
• Optimal scheduling with deadline constraints in tree networks

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• The virtual path layout problem in fast networks (extended abstract)

Cited in

(13)

• Optimizing concurrency under Scheduling by Edge Reversal
• Enhancing self-scheduling algorithms via synchronization and weighting
• Scheduling periodic messages on a shared link without buffering
• Greedy Packet Scheduling
• Scheduling in multiclass networks with deterministic service times
• Multicommodity flows over time: Efficient algorithms and complexity
• Competitive analysis of scheduling algorithms for aggregated links
• Greedy Packet Scheduling on Shortest Paths
• Scheduling problems in transportation networks of line topology
• Scheduling policies using marked/phantom slot algorithms
• Scheduling time-constrained communication in linear networks
• Scheduling in the presence of processor networks : complexity and approximation
• Link scheduling in polynomial time

This page was built for publication: Scheduling in synchronous networks and the greedy algorithm

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