The case for crowd computing
Derek Gordon Murray, Eiko Yoneki, Jon Crowcroft et al. · 2010
We introduce and motivate "crowd computing", which combines mobile devices and social interactions to achieve large-scale distributed computation. An opportunistic network of mobile devices offers substantial aggregate bandwidth and processing power. In this paper, we analyse encounter traces to place an upper bound on the amount of computation that is possible in such networks. We also investigate a practical task-farming algorithm that approaches this upper bound, and show that exploiting social structure can dramatically increase its performance.
Cited by 90 works. doi:10.1145/1851322.1851334 Open-access PDF
Authors
References
- Finding and evaluating community structure in networks
- MapReduce: Simplified Data Processing on Large Cluster
- Mobility increases the capacity of ad hoc wireless networks
- Dryad
- Distributed computing in practice: the Condor experience
- Reality mining: sensing complex social systems
- Directed diffusion for wireless sensor networking
- Probabilistic routing in intermittently connected networks
- BOINC: A System for Public-Resource Computing and Storage
- Probabilistic Routing in Intermittently Connected Networks