1720 search results - page 104 / 344 » Unranking Combinations in Parallel |
123
Voted
CHARME
2001
Springer
15 years 8 months ago
2001
Springer
We describe SAFL+: a call-by-value, parallel language in the style of ML which combines imperative, concurrent and functional programming. Synchronous channels allow communication ...
122
click to vote
IEEEPACT
1999
IEEE
15 years 8 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
124
Voted
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
129
Voted
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
129
Voted
ICS
1995
Tsinghua U.
15 years 7 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...