A lower bound on the period length of a distributed scheduler

DOI10.1007/BF01769705zbMath0786.68039OpenAlexW2024339041MaRDI QIDQ689104

Shlomo Moran, Shmuel Zaks, Yossi Malka

Publication date: 15 May 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01769705

zbMATH Keywords

schedulingdistributed systemscommunication networksradio networkschannel access protocolsschedulerssynchronizers

Mathematics Subject Classification ID

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

Related Items (3)

The use of a synchronizer yields the maximum computation rate in distributed networks ⋮ Optimizing concurrency under Scheduling by Edge Reversal ⋮ Resource-sharing system scheduling and circular chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the np-completeness of certain network testing problems
• Complexity of network synchronization

This page was built for publication: A lower bound on the period length of a distributed scheduler