A general and efficient divide-and-conquer algorithm framework for multi-core clusters

Divide-and-conquer is one of the most important patterns of parallelism, being applicable to a large variety of problems. In addition, the most powerful parallel systems available nowadays are computer clusters composed of distributed-memory nodes that contain an increasing number of cores that shar...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Cluster computing Ročník 20; číslo 3; s. 2605 - 2626
Hlavní autori:	González, Carlos H., Fraguela, Basilio B.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2017 Springer Nature B.V
Predmet:	Algorithms Clusters Computer Communication Networks Computer Science Distributed memory Hybrid systems Libraries Maintenance costs Message passing Operating Systems Parallel programming Polymorphism Processor Architectures Software Divide-and-conquer High performance computing Hybrid parallelism Algorithmic skeletons Template metaprogramming Multi-core clusters
ISSN:	1386-7857, 1573-7543
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!