Parallel and I/O efficient set covering algorithms
- 25 June 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
This paper presents the design, analysis, and implementation of parallel and sequential I/O-efficient algorithms for set cover, tying together the line of work on parallel set cover and the line of work on efficient set cover algorithms for large, disk-resident instances. Our contributions are twofold: First, we design and analyze a parallel cache-oblivious set-cover algorithm that offers essentially the same approximation guarantees as the standard greedy algorithm, which has the optimal approximation. Our algorithm is the first efficient external-memory or cache-oblivious algorithm for when neither the sets nor the elements fit in memory, leading to I/O cost (cache complexity) equivalent to sorting in the Cache Oblivious or Parallel Cache Oblivious models. The algorithm also implies elow cache misses on parallel hierarchical memories (again, equivalent to sorting). Second, building on this theory, we engineer variants of the theoretical algorithm optimized for different hardware setups. We provide experimental evaluation showing substantial speedups over existing algorithms without compromising the solution's quality.Keywords
This publication has 20 references indexed in Scilit:
- Internally deterministic parallel algorithms can be fastPublished by Association for Computing Machinery (ACM) ,2012
- The Cilk++ concurrency platformThe Journal of Supercomputing, 2010
- FAWNPublished by Association for Computing Machinery (ACM) ,2009
- A large time-aware web graphACM SIGIR Forum, 2008
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer ProgramsSIAM Journal on Computing, 1998
- Efficient NC algorithms for set cover with applications to learning and geometryJournal of Computer and System Sciences, 1994
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972