Scheduling in synchronous networks and the greedy algorithm
From MaRDI portal
Publication:1292430
DOI10.1016/S0304-3975(98)00240-0zbMATH Open0916.68064OpenAlexW1998682557MaRDI QIDQ1292430FDOQ1292430
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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (13)
- Multicommodity flows over time: Efficient algorithms and complexity
- Enhancing self-scheduling algorithms via synchronization and weighting
- Scheduling in multiclass networks with deterministic service times
- Link scheduling in polynomial time
- Scheduling policies using marked/phantom slot algorithms
- Scheduling in the presence of processor networks : complexity and approximation
- Greedy Packet Scheduling on Shortest Paths
- Scheduling problems in transportation networks of line topology
- Optimizing concurrency under Scheduling by Edge Reversal
- Scheduling periodic messages on a shared link without buffering
- Scheduling time-constrained communication in linear networks
- Greedy Packet Scheduling
- Competitive analysis of scheduling algorithms for aggregated links
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)