Upper bounds for static resource allocation in a distributed system

DOI10.1016/0022-0000(81)90015-5MaRDI QIDQ1158747zbMATH OpenOpenAlexFDO

Authors Nancy Lynch

Publication date 1981

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(81)90015-5

zbMATH Keywords

resources

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Cites work

• scientific article; zbMATH DE number 3662563 (Why is no real title available?)
• scientific article; zbMATH DE number 3483531 (Why is no real title available?)
• scientific article; zbMATH DE number 3628383 (Why is no real title available?)
• On folk theorems

Cited in

(13)

• A modular drinking philosophers algorithm
• Near-optimal, distributed edge colouring via the nibble method
• Nonclairvoyant scheduling
• On chromatic sums and distributed resource allocation
• Multicoloring trees.
• Shared-object system equilibria: delay and throughput analysis
• Vertex-strength of fuzzy graphs
• A distributed resource allocation algorithm for many processes
• The minimum color sum of bipartite graphs
• On-line Scheduling with Optimal Worst-Case Response Time
• On the probe complexity of local computation algorithms
• Near-optimal distributed edge coloring
• A technique for decomposing algorithms which use a single shared variable

This page was built for publication: Upper bounds for static resource allocation in a distributed system

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