Results 261 to 270 of about 3,910,298 (308)
Some of the next articles are maybe not open access.
Communications of the ACM, 1986
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was ...
W. Daniel Hillis, Guy L. Steele Jr.
openaire +2 more sources
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was ...
W. Daniel Hillis, Guy L. Steele Jr.
openaire +2 more sources
2001 IEEE Fourth Workshop on Multimedia Signal Processing (Cat. No.01TH8564), 2002
The MAP algorithm used in turbo decoders is very parallelizable. This property can be used to speed them up. The speedup is attained at the expense of increased complexity and processing hardware. The increase in processing hardware is linear with the speedup but the increase in complexity of the parallel implementation compared to the traditional ...
Ramakrishna Akella, Jack K. Wolf
openaire +1 more source
The MAP algorithm used in turbo decoders is very parallelizable. This property can be used to speed them up. The speedup is attained at the expense of increased complexity and processing hardware. The increase in processing hardware is linear with the speedup but the increase in complexity of the parallel implementation compared to the traditional ...
Ramakrishna Akella, Jack K. Wolf
openaire +1 more source
A Parallel Quicksort Algorithm
Journal of Parallel and Distributed Computing, 1993Abstract An optimal parallel version of quicksort, pquicksort, is presented and analyzed. The algorithm is designed for a p-processor MIMD (multiple instruction, multiple data) machine with shared memory and is an exclusive read, exclusive write algorithm.
Theodore Brown, Renbing Xiong
openaire +2 more sources
Synergy in parallel algorithms
Parallel Computing, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael E. Henderson +1 more
openaire +3 more sources
Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering, 2011
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size ...
Yixian Luo, Sanzheng Qiao
openaire +2 more sources
The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size ...
Yixian Luo, Sanzheng Qiao
openaire +2 more sources
Parallelization of scheduling algorithms
Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96), 2002Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm.
Min-You Wu, Wei Shu
openaire +2 more sources
Parallel algorithms and architectures
Computer Physics Communications, 1989Abstract In this paper we consider some of the central issues involved in the design of parallel algorithms. We describe several efficient algorithms for idealised shared memory architectures and draw some conclusions as to what would be required to implement them on a realistic physical architecture, i.e. one with distributed memory.
openaire +2 more sources
1984
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +2 more sources
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +2 more sources
2014
We develop a nature-inspired generic programming language for parallel algorithms, one that works for all data structures and control structures. Any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. All cells
Nachum Dershowitz, Evgenia Falkovich
openaire +2 more sources
We develop a nature-inspired generic programming language for parallel algorithms, one that works for all data structures and control structures. Any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. All cells
Nachum Dershowitz, Evgenia Falkovich
openaire +2 more sources