Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.62, Iss.4, 2002-04, pp. : 517-543

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

Integer summing algorithms on reconfigurable meshes

By Nakano K. Wada K.

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 57-77

Elsevier

Access to resources Recommend Favorite

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

By Baumker A. Dittrich W. auf der Heide F.M.

Theoretical Computer Science, Vol. 203, Iss. 2, 1998-08 ,pp. : 175-203

Elsevier

Access to resources Recommend Favorite

A new approach to constructing optimal parallel prefix circuits with small depth

By Lin Y.-C. Hsiao J.-W.

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 97-107

Elsevier

Access to resources Recommend Favorite

Efficient parallel algorithms for numerical simulation

By Lecomber D. Rudgyard M.

Future Generation Computer Systems, Vol. 17, Iss. 8, 2001-06 ,pp. : 961-967

Elsevier

Access to resources Recommend Favorite

Efficient Low-Contention Parallel Algorithms

By Gibbons P.B. Matias Y. Ramachandran V.

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 417-442

Academic Press

Access to resources Recommend Favorite