Results 271 to 280 of about 253,501 (314)
Some of the next articles are maybe not open access.
Structuring of Parallel Algorithms
Journal of the ACM, 1968The structuring of algorithms suitable for execution on parallel processors is discussed. Two examples of such algorithms are given. The first example exhibits a restructuring of Bellman's dynamic programming technique; the second presents a method of parsing MAD-type statements in parallel.
openaire +1 more source
Parallel clustering algorithms
Parallel Computing, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaobo Li 0001, Zhixi Fang
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
ACM Computing Surveys, 1984
This is an extensive survey of parallel algorithms used to solve graph problems. In the first part some models of parallel computation are shortly described and discussed. They include: systolic arrays, associative processors, various models of array processors (also known as SIMD machines) and multiple CPU computers.
Michael J. Quinn, Narsingh Deo
openaire +2 more sources
This is an extensive survey of parallel algorithms used to solve graph problems. In the first part some models of parallel computation are shortly described and discussed. They include: systolic arrays, associative processors, various models of array processors (also known as SIMD machines) and multiple CPU computers.
Michael J. Quinn, Narsingh Deo
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 +1 more source
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 +1 more source