6105 search results - page 800 / 1221 » A Parallel Algorithm for Bound-Smoothing |
203
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicas...
172
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
191
click to vote
ICPP
1993
IEEE
15 years 11 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...
167
click to vote
APL
1993
ACM
15 years 11 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
165
click to vote
PODC
1994
ACM
15 years 11 months ago
1994
ACM
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...