This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized wi...
详细信息
Andorra-I is an experimental parallel Prolog system that transparently exploits both dependent and-parallelism and or-parallelism. It constitutes the first implementation of the Basic Andorra model, a parallel executi...
详细信息
Thk paper describes how program transformation using a rnetalanguage can be an effective methodology for developim~ gcorrect and efficient parallel programs. As an example, a class of different parallel matrix multipl...
详细信息
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the network as a loosely-coupled multiprocessor...
详细信息
A data race is a typical case of unintended nondeterminism, which occurs when two or more processes concurrently access the same memory location, with at least one of the accesses being a write access. This paper pres...
详细信息
Reader-writer synchronization relaxes the constraints of mutual exclusion to permit more than one process to inspect a shared object concurrently, as long as none of them changes its value. On uniprocessors, mutual ex...
详细信息
Given x1,...,xN, parallel prefix computes x1 o x2 o ... o x(k), for 1 less-than-or-equal-to k less-than-or-equal-to N, with associative operation o. We show optimal schedules for parallel prefix computation with a fix...
详细信息
ISBN:
(纸本)9780897913904
Given x1,...,xN, parallel prefix computes x1 o x2 o ... o x(k), for 1 less-than-or-equal-to k less-than-or-equal-to N, with associative operation o. We show optimal schedules for parallel prefix computation with a fixed number of resources p greater-than-or-equal-to 2 for a prefix of size N greater-than-or-equal-to p(p + 1)/2. The time of the optimal schedules with p resources is [2N/(p + 1)] for N greater-than-or-equal-to p(p + 1)/2, which we prove to be the strict lower bound(i.e., which is what can be achieved maximally). We then present a pipelined form of optimal schedules with [2N/(p + 1)] + [(p - 1)/2] - 1 time, which takes a constant overhead of [(p - 1)/2] time more than the optimal schedules. parallel prefix is an important common operation in many algorithms including the evaluation of polynomials, general Hornor expressions, carry look-ahead circuits and ranking and packing problems. A most important application of parallel prefix is loop parallelizing transformation.
The IPS-2 parallel program measurement tools provide performance data from application programs, the operating system, hardware, network, and other sources. Previous versions of IPS-2 allowed programmers to collect in...
详细信息
暂无评论