Upper bounds for static resource allocation in a distributed system
From MaRDI portal
Publication:1158747
DOI10.1016/0022-0000(81)90015-5zbMath0473.68022OpenAlexW2047902293MaRDI QIDQ1158747
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (13)
Nonclairvoyant scheduling ⋮ Shared-object system equilibria: delay and throughput analysis ⋮ The minimum color sum of bipartite graphs ⋮ A distributed resource allocation algorithm for many processes ⋮ On chromatic sums and distributed resource allocation ⋮ Near-optimal distributed edge coloring ⋮ Multicoloring trees. ⋮ Unnamed Item ⋮ Vertex-strength of fuzzy graphs ⋮ A modular drinking philosophers algorithm ⋮ On-line Scheduling with Optimal Worst-Case Response Time ⋮ Near-optimal, distributed edge colouring via the nibble method ⋮ A technique for decomposing algorithms which use a single shared variable
Cites Work
This page was built for publication: Upper bounds for static resource allocation in a distributed system
