A fast, energy-efficient abstraction for simultaneous breadth-first searches

Keyphrases

• Energy Efficient 100%
• High Performance 100%
• Breadth-first Search 100%
• Graph Traversal 100%
• Energy Consumption 50%
• Algorithm Design 50%
• Low Energy 50%
• Design Requirements 50%
• Hardware Design 50%
• Specific Applications 50%
• Single Thread 50%
• First-in-class 50%
• Reachability 50%
• Energy Usage 50%
• Community Detection 50%
• Target Architecture 50%
• Out-degree 50%
• Massive Computing 50%
• Embedded Computing Platforms 50%
• All-pairs Shortest Paths 50%
• Session Search 50%
• Map Graph 50%
• GPU Kernel 50%
• Hybrid Implementation 50%

Computer Science

• Energy Efficient 100%
• Graph Traversal 100%
• Energy Consumption 50%
• Algorithm Design 50%
• Computing Platform 50%
• Design Constraint 50%
• Hardware Design 50%
• Community Detection 50%
• Embedded Computing 50%
• Pair Shortest Path Problem 50%
• Outdegree 50%