Results 301 to 310 of about 677,509 (341)
Some of the next articles are maybe not open access.
Languages for parallel programming
1991Many different paradigms for parallel programming exist, nearly each of which is employed in dozens of languages. Several researchers have tried to compare these languages and paradigms by examining the expressivity and flexibility of their constructs.
openaire +1 more source
Parallel evolutionary programming
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2005This work presents a study of parallel evolutionary programming (EP). The paper is divided into two parts. The first part proposes a concept of parallel EP. Four numerical functions are used to compare the performance between the serial algorithm and the parallel algorithm.
Shisanu Tongchim, Xin Yao 0001
openaire +1 more source
Parallel Programming in MATLAB
The International Journal of High Performance Computing Applications, 2009A visit to the neighborhood PC retail store provides ample proof that we are in the multi-core era. The key differentiator among manufacturers today is the number of cores that they pack onto a single chip. The clock frequency of commodity processors has reached its limit, however, and is likely to stay below 4 GHz for years to come.
openaire +1 more source
On reductions of parallel programs
1979By a reduction of a parallel program, as informally introduced by Lipton, the number of possible execution sequences is decreased, which facilitates analysis and verification. This method is extended to simplify verification proofs of parallel programs.
Wolfgang Kowalk, Rüdiger Valk
openaire +1 more source
Parallelizing constraint programs
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming, 2010The availability of commodity multicore and multiprocessor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. Both constraint-based local search and finite-domain techniques can dramatically benefit from parallelization.
openaire +1 more source
Practical parallel programming
IEEE Concurrency, 1999Part 1 Fundamentals: basic architectural ideas classifying architectures some example applications decomposition techniques terms and measures. Part 3 Data parallelism: basic operations an inside-out syntax other data-parallel operations automatic parallelization controlling and exploiting data placement discussion.
openaire +1 more source
[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference, 2003
Although parallel programs are significantly more complex than sequential programs the same debugging methodology, augmented with the appropriate tools, can be used to debug parallel and sequential programs. Experiments have shown that these tools can reduce the debugging cycle for a parallel program dramatically. Other techniques, such as verification
openaire +1 more source
Although parallel programs are significantly more complex than sequential programs the same debugging methodology, augmented with the appropriate tools, can be used to debug parallel and sequential programs. Experiments have shown that these tools can reduce the debugging cycle for a parallel program dramatically. Other techniques, such as verification
openaire +1 more source
Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90, 1990
There is a tension between the objectives of avoiding irrelevant computation and extracting parallelism, in that a computational step used to restrict another must precede the latter. Our thesis, following [3], is that evaluation methods can be viewed as implementing a choice ofsideways information propagation graphs, or sips, which determines the set ...
openaire +1 more source
There is a tension between the objectives of avoiding irrelevant computation and extracting parallelism, in that a computational step used to restrict another must precede the latter. Our thesis, following [3], is that evaluation methods can be viewed as implementing a choice ofsideways information propagation graphs, or sips, which determines the set ...
openaire +1 more source
1996
A parallel implementation of Genetic Programming using PVM is described. Two different topologies for parallel implementation of GP are examined. Both of them are based on the island model for evolutionary algorithms. It is shown that considerable speedup of the GP execution can be achieved and that the parallel versions of the algorithm are very ...
Dimitris C. Dracopoulos, Duncan Self
openaire +1 more source
A parallel implementation of Genetic Programming using PVM is described. Two different topologies for parallel implementation of GP are examined. Both of them are based on the island model for evolutionary algorithms. It is shown that considerable speedup of the GP execution can be achieved and that the parallel versions of the algorithm are very ...
Dimitris C. Dracopoulos, Duncan Self
openaire +1 more source
Parallel simulation of data parallel programs
1996Accurate simulations of parallel programs for large datasets can often be slow; parallel execution has been shown to offer significant potential in reducing the execution time of many discrete-event simulators. In this paper, we describe the design and implementation of a parallel simulator called DPSIM that simulates the execution of data parallel ...
Sundeep Prakash, Rajive L. Bagrodia
openaire +1 more source