Journal ArticleDOI
The power of parallel prefix
TLDR
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.Abstract:
The prefix computation problem is to compute all n initial products a1* . . . *a1,i=1, . . ., n of a set of n elements, where * is an associative operation. An O(((logn) log(2n/p))XI(n/p)) time deterministic parallel algorithm using p≤n processors is presented to solve the prefix computation problem, when the order of the elements is specified by a linked list. For p≤O(n1-e)(e〉0 any constant), this algorithm achieves linear speedup. Such optimal speedup was previously achieved only by probabilistic algorithms. This study assumes the weakest PRAM model, where shared memory locations can only be exclusively read or written (the EREW model).read more
Citations
More filters
Proceedings ArticleDOI
Efficient parallel queuing system simulation
Tobias Kiesling,Thomas Krieger +1 more
TL;DR: This paper investigates an alternative approach based on the technique of time-parallel simulation with fix-up computations that is simplicity and its suitability for execution in a distributed environment.
Journal ArticleDOI
An Improved Dijkstras Algorithm Based on Search Strategy
TL;DR: An improved Dijkstras shortest path algorithm based on search strategy introduces a constraint function with weighted value ω for searching each position in the state space to guide the search forward to expected direction.
Proceedings ArticleDOI
Prefix computation on faulty hypercubes
Jyh-Wen Mao,Chang-Biau Yang +1 more
TL;DR: A fault-tolerant mechanism by solving the prefix computation problem on faulty hypercube computers is proposed, which can be done in O(log n) time on a faultyhypercube computer if there exists a fault-free subcube with size of at least a half of the hypercube.
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.
Dissertation
A service-oriented architecture and language for abstracted distributed algorithms
TL;DR: A new programming model designed to provide an intuitive and efficient way of abstracting the partitioning of distributed input data when programming large, dynamic, distributed, parallel, computing environments and how this can be of use in the wider scope of such dynamic environments is described.