Paper Info
Title
Roomy: a system for space limited computations
Abstract
There are numerous examples of problems in symbolic algebra in which the required storage grows far beyond the limitations even of the distributed RAM of a cluster. Often this limitation determines how large a problem one can solve in practice. Roomy provides a minimally invasive system to modify the code for such a computation, in order to use the local disks of a cluster or a SAN as a transparent extension of RAM. Roomy is implemented as a C/C++ library. It provides some simple data structures (arrays, unordered lists, and hash tables). Some typical programming constructs that one might employ in Roomy are: map, reduce, duplicate elimination, chain reduction, pair reduction, and breadth-first search. All aspects of parallelism and remote I/O are hidden within the Roomy library.
Year
DOI
Venue
2010
10.1145/1837210.1837216
Clinical Orthopaedics and Related Research
Keywords
DocType
Volume
parallel,numerous example,disk-based,local disk,space limited computation,duplicate elimination,hash table,pair reduction,breadth-first search,programming model,open source library,minimally invasive system,chain reduction,required storage,roomy library
Conference
abs/1006.1926
Citations 
PageRank 
References 
4
0.42
3
Authors
1
Name
Order
Citations
PageRank
Daniel Kunkle1627.12