Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer (Long Beach, Calif.) Jg. 48; H. 8; S. 46 - 55
Hauptverfasser: Halappanavar, Mahantesh, Pothen, Alex, Azad, Ariful, Manne, Fredrik, Langguth, Johannes, Khan, Arif
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.08.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
algorithm design
Algorithm design and analysis
Algorithms
Computer architecture
Computer graphics
Computer platforms
graph matching
Irregular applications
matching algorithms
multithreaded architectures
Multithreading
parallel architectures
Parallel programming
Workloads
ISSN:0018-9162, 1558-0814
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2015.215