Abstract
Beehive is a parallel programming framework designed for cluster-based computing environments in cloud data centers. It is specifically targeted for graph data analysis problems. The Beehive framework provides the abstraction of key-value based global object storage, which is maintained in memory of the cluster nodes. Its computation model is based on optimistic concurrency control in executing concurrent tasks as atomic transactions for harnessing amorphous parallelism in graph analysis problems. We describe here the architecture and the programming abstractions provided by this framework, and present the performance of the Beehive framework for several graph problems such as maximum flow, minimum weight spanning tree, graph coloring, and the PageRank algorithm.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 43rd International Conference on Parallel Processing Workshops, ICPPW 2014 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 331-338 |
Number of pages | 8 |
ISBN (Electronic) | 9781479956159 |
DOIs | |
State | Published - May 7 2015 |
Event | 43rd International Conference on Parallel Processing Workshops, ICPPW 2014 - Minneapolis, United States Duration: Sep 9 2014 → Sep 12 2014 |
Publication series
Name | Proceedings of the International Conference on Parallel Processing Workshops |
---|---|
Volume | 2015-May |
ISSN (Print) | 1530-2016 |
Other
Other | 43rd International Conference on Parallel Processing Workshops, ICPPW 2014 |
---|---|
Country/Territory | United States |
City | Minneapolis |
Period | 9/9/14 → 9/12/14 |
Bibliographical note
Publisher Copyright:© 2014 IEEE.
Keywords
- Cloud computing
- Graph algorithms
- Optimistic concurrency control
- Parallel programming
- Transactional memory