A lower bound on the period length of a distributed scheduler (Q689104): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of network synchronization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3883524 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the np-completeness of certain network testing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Revision as of 10:31, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the period length of a distributed scheduler |
scientific article |
Statements
A lower bound on the period length of a distributed scheduler (English)
0 references
15 May 1994
0 references
distributed systems
0 references
schedulers
0 references
synchronizers
0 references
channel access protocols
0 references
communication networks
0 references
radio networks
0 references
scheduling
0 references
