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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer (Long Beach, Calif.) Ročník 48; číslo 8; s. 46 - 55
Hlavní autoři: Halappanavar, Mahantesh, Pothen, Alex, Azad, Ariful, Manne, Fredrik, Langguth, Johannes, Khan, Arif
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9162
1558-0814
DOI:10.1109/MC.2015.215