Upper bounds for static resource allocation in a distributed system
From MaRDI portal
Publication:1158747
DOI10.1016/0022-0000(81)90015-5zbMath0473.68022MaRDI 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
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N25: Theory of operating systems
68N99: Theory of software
Related Items
On-line Scheduling with Optimal Worst-Case Response Time, A technique for decomposing algorithms which use a single shared variable, 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.
Cites Work