Pages that link to "Item:Q1158747"
From MaRDI portal
The following pages link to Upper bounds for static resource allocation in a distributed system (Q1158747):
Displayed 7 items.
- A technique for decomposing algorithms which use a single shared variable (Q800081) (← links)
- A modular drinking philosophers algorithm (Q1261112) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Multicoloring trees. (Q1401922) (← links)
- On-line Scheduling with Optimal Worst-Case Response Time (Q4718601) (← links)
