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

Full description

Saved in:

Bibliographic Details
Published in:	Cluster computing Vol. 20; no. 3; pp. 2605 - 2626
Main Authors:	González, Carlos H., Fraguela, Basilio B.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2017 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!