Title
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures.
Abstract
Executing irregular, data-intensive workloads on multithreaded architectures can result in performance losses and scalability problems. Codesigning algorithms and architectures can realize high performance on irregular applications. A codesign study reveals four key lessons learned from implementing matching algorithms on various platforms.
Year
DOI
Venue
2015
10.1109/MC.2015.215
Computer
Keywords
Field
DocType
Multithreading,Computer architecture,Parallel programming,Algorithm design and analysis,Irregular applications,Computer graphics
Graph algorithms,Multithreading,Computer architecture,Algorithm design,Computer science,Matching (graph theory),Computer graphics,Scalability
Journal
Volume
Issue
ISSN
48
8
0018-9162
Citations 
PageRank 
References 
3
0.40
16
Authors
6
Name
Order
Citations
PageRank
Mahantesh Halappanavar121833.64
Alex Pothen2334.50
Ariful Azad313815.71
Fredrik Manne481.85
Johannes Langguth58512.71
Arif M. Khan662.16