Results 281 to 290 of about 375,041 (317)
Some of the next articles are maybe not open access.
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
Algorithm + strategy = parallelism
Journal of Functional Programming, 1998The process of writing large parallel programs is complicated by the need to specify both the parallel behaviour of the program and the algorithm that is to be used to compute its result. This paper introduces evaluation strategies : lazy higher-order functions that control the ...
Philip W. Trinder +3 more
openaire +1 more source
Parallel evolutionary algorithms
Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694), 2004We are trying to piece together the knowledge of evolution with the help of biology, informatics and physics to create a complex evolutionary structure. It can speed up the creation of optimization algorithms with high quality features. The adaptive significance of GAs with sexual reproduction and an artificial immune system is presented. An artificial
Pavel Osmera +2 more
openaire +1 more source
2010
Given a set of weighted hyper-rectangles in a k-dimensional space, the chaining problem is to identify a set of colinear and nonoverlapping hyper-rectangles of total maximal weight. This problem is used in a number of applications in bioinformatics, string processing, and VLSI design.
Mohamed Ibrahim Abouelhoda +1 more
openaire +1 more source
Given a set of weighted hyper-rectangles in a k-dimensional space, the chaining problem is to identify a set of colinear and nonoverlapping hyper-rectangles of total maximal weight. This problem is used in a number of applications in bioinformatics, string processing, and VLSI design.
Mohamed Ibrahim Abouelhoda +1 more
openaire +1 more source
A parallel selection algorithm
BIT, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Gupta, G. P. Bhattacharjee
openaire +1 more source
Engineering parallel algorithms
Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing HPDC-96, 1996The rise of explicit parallel programming involves new problems: lack of structure for parallel algorithms and the ad hoc development of parallel algorithms. We use skeletons to characterize and design parallel algorithms and define a process to refine the designs step by step into programs. The paper introduces a high level library on top of MPI which
openaire +1 more source
On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing, 1987Abstract The mapping problem arises when the communication structure of a parallel algorithm differs from the interconnection architecture of the intended parallel machine (topological variation). This problem is compounded when the number of processes required by the algorithm exceeds the number of processors available in the architecture ...
Francine Berman, Lawrence Snyder 0001
openaire +1 more source
A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS
Parallel Algorithms and Applications, 1995In this work, a parallel scheduling algorithm for scheduling a set of n partially ordered tasks on an m-processor parallel computing system is studied. The method is based on a conventional list scheduling, in particular, an earliest-task-first approach. Otherwise, the algorithm developed is an original algorithm.
Muslim Bozyigit, Amin A. Abdulghani
openaire +1 more source
Randomized parallel algorithms
1996In this paper we show some important randomized techniques for the parallel processing of discrete problems. In particular, we present a few parallel randomized algorithms frequently used for shortest paths problems, matching problems, depth first search and maximum independent set problems.
Andrea Clementi +2 more
openaire +1 more source