Hyperplane Grouping and Pipelined Schedules: How to Execute Tiled Loops Fast on Clusters of SMPs

Author： Athanasaki Maria Sotiropoulos Aristidis Tsoukalas Georgios Koziris Nectarios Tsanakas Panayiotis

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.33, Iss.3, 2005-09, pp. : 197-226

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient hybrid parallelisation of tiled algorithms on SMP clusters

By Drosinos Nikolaos Koziris Nectarios

International Journal of Computational Science and Engineering, Vol. 4, Iss. 2, 2009-07 ,pp. : 112-126

Inderscience Publishers

Access to resources Recommend Favorite

Software Data Prefetching for Software Pipelined Loops

By Sánchez J. González A.

Journal of Parallel and Distributed Computing, Vol. 58, Iss. 2, 1999-08 ,pp. : 236-259

Academic Press

Access to resources Recommend Favorite

Adapting a parallel sparse direct solver to architectures with clusters of SMPs

By Amestoy P.R. Duff I.S. Pralet S. Vomel C.

Parallel Computing, Vol. 29, Iss. 11, 2003-11 ,pp. : 1645-1668

Elsevier

Access to resources Recommend Favorite

Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)

By Bader D.A. JáJá J.

Journal of Parallel and Distributed Computing, Vol. 58, Iss. 1, 1999-07 ,pp. : 92-108

Academic Press

Access to resources Recommend Favorite

Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search

International Journal of Multimedia Data Engineering and Management (IJMDEM), Vol. 3, Iss. 4, 2012-10 ,pp. : 75-87

IGI Global_journal

Access to resources Recommend Favorite