GeaFlow: A Graph Extended and Accelerated Dataflow System
Abstract
Supplemental Material
- Download
- 185.74 MB
References
Index Terms
- GeaFlow: A Graph Extended and Accelerated Dataflow System
Recommendations
Large-Scale Stream Graph Processing: Doctoral Symposium
DEBS '17: Proceedings of the 11th ACM International Conference on Distributed and Event-based SystemsDynamically changing graphs are a powerful abstraction used to represent temporal relationships and connections occurring between data entities in various real-world organizations, such as social and telecommunication networks. The increasing volume, ...
A survey on dynamic graph processing on GPUs: concepts, terminologies and systems
AbstractGraphs that are used to model real-world entities with vertices and relationships among entities with edges, have proven to be a powerful tool for describing real-world problems in applications. In most real-world scenarios, entities and their ...
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and ArchitecturesThere has been significant recent interest in parallel graph processing due to the need to quickly analyze the large graphs available today. Many graph codes have been designed for distributed memory or external memory. However, today even the largest ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 371Total Downloads
- Downloads (Last 12 months)354
- Downloads (Last 6 weeks)31
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in

