The communication complexity of distributed task allocation
Authors:
Open Access
- 16 July 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 67-76
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A survey of hard real-time scheduling for multiprocessor systemsACM Computing Surveys, 2011
- Distributed computation in dynamic networks2010
- The -server problemComputer Science Review, 2009
- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND2009
- A note on efficient aggregate queries in sensor networksTheoretical Computer Science, 2007
- The implementation of the Cilk-5 multithreaded language1998
- On the distributional complexity of disjointnessTheoretical Computer Science, 1992
- Monotone Circuits for Connectivity Require Super-Logarithmic DepthSIAM Journal on Discrete Mathematics, 1990
- Multiprocessor online scheduling of hard-real-time tasksIEEE Transactions on Software Engineering, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973