1720 search results - page 113 / 344 » Unranking Combinations in Parallel |
132
click to vote
PARELEC
2002
IEEE
15 years 8 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
110
click to vote
MSS
1999
IEEE
15 years 8 months ago
1999
IEEE
A European consortium formed by science and industrial partners have started the EuroStore project1 to develop and market a Hierarchical Storage Management System (HSM) together w...
130
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Rendering high-quality computer animations requires intensive computation, and therefore a large amount of time. One way to speed up this process is to devise rendering algorithms...
108
Voted
JSSPP
1997
Springer
15 years 8 months ago
1997
Springer
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
116
Voted
CCGRID
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing re...