Results 281 to 290 of about 253,501 (314)

Algorithm + strategy = parallelism

Journal of Functional Programming, 1998
The 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, Kevin Hammond, Hans-Wolfgang Loidl, Simon L. Peyton Jones   +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), 2004
We 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, Bronislav Lacko, Masopust Petr   +2 more
openaire   +1 more source

A parallel selection algorithm

BIT, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Gupta, G. P. Bhattacharjee
openaire   +1 more source

On mapping parallel algorithms into parallel architectures

Journal of Parallel and Distributed Computing, 1987
Abstract 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

Randomized parallel algorithms

1996
In 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, José D. P. Rolim, Erik Urland   +2 more
openaire   +1 more source

A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS

Parallel Algorithms and Applications, 1995
In 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

Parallel Chaining Algorithms

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, Hisham Mohamed 0001   +1 more
openaire   +1 more source

Engineering parallel algorithms

Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing HPDC-96, 1996
The 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

Parallel Algorithms

ACM Computing Surveys, 1996
Guy E. Blelloch, Bruce M. Maggs
openaire   +1 more source

A parallelization of the Buchberger algorithm

Proceedings of the international symposium on Symbolic and algebraic computation, 1990
We have experimented with a little elementary parallelism applied to Buchberger's algorithm. This is in contrast to [Ponder] and [Vidal], as gains can be achieved by using the method even on a single processor.
openaire   +1 more source