ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
: Events are occurrence instances of actions. The thesis of this paper is that the use of “actions”, instead of events, greatly simplifies the problem of concurrent debugging....
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE