AbstractParallel prefix is an important technique that has been widely accepted in many area of scientific and engineering research. In this paper we propose an improved parallel prefix computation algorithm on n × n mesh network that requires 2n + 5 times. Our proposed algorithm can be compare with the traditional parallel prefix algorithm that requires 3n + 2 time on same architecture
[[abstract]]In this paper we use the tensor product notation as the framework of a programming metho...
In an effort to reduce communication latency in mesh-type architectures, these architectures have be...
Adders are the among the most essential arithmetic units within digital systems. Parallel-prefix str...
AbstractParallel prefix is an important technique that has been widely accepted in many area of scie...
Abstract—A parallel algorithm for prefix computation reported recently on interconnection network ca...
AbstractWe present a parallel prefix algorithm which uses (2(p + 1)p (p + 1) + 2)n − 1 arithmetic an...
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
[[abstract]]Semigroup and prefix computations on two-dimensional mesh-connected computers with multi...
AbstractWe present a parallel algorithm for the prefix sums problem which runs in timeO( logn/log lo...
Parallel prefix is one of the fundamental algorithms in computer science. Parallel prefix networks a...
A parallel prefix network of width n takes n inputs, a1, a2, . . ., an, and computes each yi = a1 ○ ...
Parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms to...
Abstract. We describe and experimentally compare three theoretically well-known algorithms for the p...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
[[abstract]]In this paper we use the tensor product notation as the framework of a programming metho...
In an effort to reduce communication latency in mesh-type architectures, these architectures have be...
Adders are the among the most essential arithmetic units within digital systems. Parallel-prefix str...
AbstractParallel prefix is an important technique that has been widely accepted in many area of scie...
Abstract—A parallel algorithm for prefix computation reported recently on interconnection network ca...
AbstractWe present a parallel prefix algorithm which uses (2(p + 1)p (p + 1) + 2)n − 1 arithmetic an...
Abstract:- We are interested in solving the prefix problem of n inputs using p < n processors on ...
[[abstract]]Semigroup and prefix computations on two-dimensional mesh-connected computers with multi...
AbstractWe present a parallel algorithm for the prefix sums problem which runs in timeO( logn/log lo...
Parallel prefix is one of the fundamental algorithms in computer science. Parallel prefix networks a...
A parallel prefix network of width n takes n inputs, a1, a2, . . ., an, and computes each yi = a1 ○ ...
Parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms to...
Abstract. We describe and experimentally compare three theoretically well-known algorithms for the p...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This ...
[[abstract]]In this paper we use the tensor product notation as the framework of a programming metho...
In an effort to reduce communication latency in mesh-type architectures, these architectures have be...
Adders are the among the most essential arithmetic units within digital systems. Parallel-prefix str...
DOI
Add to ORKG