Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures

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.) Calif.), 2015-08, Vol.48 (8), p.46-55
Hauptverfasser: Halappanavar, Mahantesh, Pothen, Alex, Azad, Ariful, Manne, Fredrik, Langguth, Johannes, Khan, Arif
Format: Artikel
Sprache:eng
Schlagworte:
algorithm design
Algorithm design and analysis
Algorithms
Computer architecture
Computer graphics
Computer platforms
graph matching
Irregular applications
matching algorithms
matching, graph algorithms, multithreaded architectures
multithreaded architectures
Multithreading
parallel architectures
Parallel programming
Workloads
Online-Zugang:Volltext bestellen
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.
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2015.215