A lower bound on the period length of a distributed scheduler

DOI10.1007/BF01769705zbMATH Open0786.68039OpenAlexW2024339041MaRDI QIDQ689104FDOQ689104

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

schedulingcommunication networksdistributed systemsradio networkschannel access protocolsschedulerssynchronizers

Mathematics Subject Classification ID

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

Cites Work

• Complexity of network synchronization
• On the np-completeness of certain network testing problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

   Recommendations

• A lower bound for scheduling mechanisms 👍 👎
• Title not available (Why is that?) 👍 👎
• Near-optimal scheduling of distributed algorithms 👍 👎
• Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays 👍 👎
• Lower bound algorithms for multiprocessor task scheduling with ready times 👍 👎
• A lower bound for probabilistic distributed algorithms 👍 👎
• Title not available (Why is that?) 👍 👎
• A lower bound for randomized on-line multiprocessor scheduling 👍 👎

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

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