๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel prefix computation on extended multi-mesh network

โœ Scribed by Prasanta K. Jana; B. Damodara Naidu; Shailendra Kumar; Monish Arora; Bhabani P. Sinha

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
333 KB
Volume
84
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Sorting Algorithm Using Multiwa
Parallel Sorting Algorithm Using Multiway Merge and Its Implementation on a Multi-Mesh Network
โœ Bhabani P. Sinha; Amar Mukherjee ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 288 KB

In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)ร‚2+

Parallel strong orientation on a mesh co
Parallel strong orientation on a mesh connected computer
โœ Manfred Schimmler ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 411 KB

Schimmler, M., Parallel strong orientation on a mesh connected computer, Parallel Computing 17 (1991) 657-664. We present a solution for the following problem: given an undirected bridgeless connected graph G = (V, E), find an orientation of each edge such that the resulting directed graph is stron