GraphTuner: An Input Dependence Aware Loop Perforation Scheme for Efficient Execution of Approximated Graph Algorithms

2017 IEEE International Conference on Computer Design (ICCD) ◽

10.1109/iccd.2017.38 ◽

2017 ◽

Cited By ~ 4

Author(s):

Hamza Omar ◽

Masab Ahmad ◽

Omer Khan

Keyword(s):

Graph Algorithms ◽

Efficient Execution

Download Full-text

On the Architectural Requirements for Efficient Execution of Graph Algorithms

2005 International Conference on Parallel Processing (ICPP'05) ◽

10.1109/icpp.2005.55 ◽

2005 ◽

Cited By ~ 43

Author(s):

D.A. Bader ◽

Guojing Cong ◽

J. Feo

Keyword(s):

Graph Algorithms ◽

Efficient Execution

Download Full-text

Efficient Execution of Graph Algorithms on CPU with SIMD Extensions

2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) ◽

10.1109/cgo51591.2021.9370326 ◽

2021 ◽

Author(s):

Ruohuang Zheng ◽

Sreepathi Pai

Keyword(s):

Graph Algorithms ◽

Efficient Execution

Download Full-text

Frameworks for designing in-place graph algorithms

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2021.07.004 ◽

2021 ◽

Author(s):

Sankardeep Chakraborty ◽

Anish Mukherjee ◽

Venkatesh Raman ◽

Srinivasa Rao Satti

Keyword(s):

Graph Algorithms

Download Full-text

Predictive Warp Scheduling for Efficient Execution in GPGPU

Proceedings of the 2021 on Great Lakes Symposium on VLSI ◽

10.1145/3453688.3461525 ◽

2021 ◽

Author(s):

Abhinish Anand ◽

Winnie Thomas ◽

Suryakant Toraskar ◽

Virendra Singh

Keyword(s):

Efficient Execution

Download Full-text

Optimizing ordered graph algorithms with GraphIt

Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization ◽

10.1145/3368826.3377909 ◽

2020 ◽

Cited By ~ 2

Author(s):

Yunming Zhang ◽

Ajay Brahmakshatriya ◽

Xinyi Chen ◽

Laxman Dhulipala ◽

Shoaib Kamil ◽

...

Keyword(s):

Graph Algorithms

Download Full-text

Application-aware Memory System for Fair and Efficient Execution of Concurrent GPGPU Applications

Proceedings of Workshop on General Purpose Processing Using GPUs - GPGPU-7 ◽

10.1145/2588768.2576780 ◽

2014 ◽

Cited By ~ 28

Author(s):

Adwait Jog ◽

Evgeny Bolotin ◽

Zvika Guz ◽

Mike Parker ◽

Stephen W. Keckler ◽

...

Keyword(s):

Memory System ◽

Application Aware ◽

Efficient Execution

Download Full-text

Efficient Execution of Dynamic Programming Algorithms on Apache Spark

2020 IEEE International Conference on Cluster Computing (CLUSTER) ◽

10.1109/cluster49012.2020.00044 ◽

2020 ◽

Author(s):

Mohammad Mahdi Javanmard ◽

Zafar Ahmad ◽

Jaroslaw Zola ◽

Louis-Noel Pouchet ◽

Rezaul Chowdhury ◽

...

Keyword(s):

Dynamic Programming ◽

Apache Spark ◽

Programming Algorithms ◽

Efficient Execution

Download Full-text

Which Graph Representation to Select for Static Graph-Algorithms on a CUDA-capable GPU

Proceedings of the 12th Workshop on General Purpose Processing Using GPUs - GPGPU '19 ◽

10.1145/3300053.3319416 ◽

2019 ◽

Author(s):

Thorsten Blaß ◽

Michael Philippsen

Keyword(s):

Graph Algorithms ◽

Graph Representation

Download Full-text

Expressing graph algorithms using generalized active messages

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '13 ◽

10.1145/2442516.2442549 ◽

2013 ◽

Cited By ~ 1

Author(s):

Nick Edmonds ◽

Jeremiah Willcock ◽

Andrew Lumsdaine

Keyword(s):

Graph Algorithms

Download Full-text

Two Streamlined Depth-First Search Algorithms

Fundamenta Informaticae ◽

10.3233/fi-1986-9105 ◽

1986 ◽

Vol 9 (1) ◽

pp. 85-94

Author(s):

Robert Endre Tarjan

Keyword(s):

Directed Graph ◽

Graph Algorithms ◽

Undirected Graph ◽

Linear Time ◽

Search Algorithms ◽

Depth First Search ◽

Time Graph

Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.

Download Full-text