Proceedings ArticleDOI
Improved parallel prefix computation on optical multi-trees
Prasanta K. Jana
- pp 414-418
Reads0
Chats0
TLDR
A new and improved parallel algorithm for prefix computation on the same network and although the algorithm requires O(log n) electronic moves +4 optical moves using the same number of processors, the number of data points involved in the algorithm is n/sup 3/ in contrast to n/Sup 2/.Abstract:
A parallel algorithm for prefix computation was reported on a recently proposed interconnection network called optical multi-trees (OMULT). Using 2n/sup 3/-n/sup 2/ processors, the algorithm was shown to run in O(log n)/sup A/ electronic moves +5 optical moves for n/sup 2/ data points. In this paper we present a new and improved parallel algorithm for prefix computation on the same network. Although the algorithm requires O(log n) electronic moves +4 optical moves using the same number of processors, the number of data points involved in our algorithm is n/sup 3/ in contrast to n/sup 2/.read more
Citations
More filters
Journal ArticleDOI
An Improved Parallel Prefix Computation on 2D-Mesh Network
TL;DR: An improved parallel prefix computation algorithm on n × n mesh network that requires 2n + 5 times is proposed that can be compare with the traditional parallel prefix algorithm that requires 3n + 2 time on same architecture.
Journal ArticleDOI
Generalized Matrix Multiplication and its Object Oriented Model
TL;DR: Development that point toward a need for reconsidering usefulness of matrix multiplication generalized on the basis of the theory of algebraic semirings are summarized to propose generalized matrix-matrix multiply-and-update (MMU) operation and its object oriented model.
Journal ArticleDOI
Permutation algorithms on optical multi-trees
Prasanta K. Jana,Koushik Sinha +1 more
TL;DR: This paper develops efficient parallel algorithms for some commonly used permutations namely, bit reversal, vector reversal, perfect shuffle, unshuffle and transpose on the OMULT network.
Proceedings ArticleDOI
Fast parallel prefix on multi-mesh of trees
TL;DR: This paper proposes a parallel algorithm for prefix computation for N = n4 data on an iV-processor multi-mesh of trees which takes 3.75 log N + 6 time for N data points.
Parallel Prefix Algorithm for OTIS-HHC Architecture
TL;DR: An algorithm for parallel prefix computation on OTIS-Hyper Hexa-cell is proposed, in this architecture, the time complexity of the algorithm for n 2 data elements is O(n) electronic moves and O( n) OTIS moves.
References
More filters
Journal ArticleDOI
Parallel Prefix Computation
TL;DR: A recurstve construction is used to obtain a product circuit for solving the prefix problem and a Boolean clrcmt which has depth 2[Iog2n] + 2 and size bounded by 14n is obtained for n-bit binary addmon.
Book
The design and analysis of parallel algorithms
TL;DR: Kurskod av teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskapskap Huvudområden och successiv fördjupning.
Journal ArticleDOI
Comparison between optical and electrical interconnects based on power and speed considerations
TL;DR: Conditions are determined for which optical interconnects can transmit information at a higher data rate and consume lc3s power than the equivalent electrical interconnections.
Journal ArticleDOI
The power of parallel prefix
TL;DR: This study assumes the weakest PRAM model, where shared memory locations can only be exclusively read or written (the EREW model) to solve the prefix computation problem, when the order of the elements is specified by a linked list.