663 search results - page 73 / 133 » A Parallel Algorithm for Enumerating Combinations |
144
click to vote
GCC
2004
Springer
15 years 7 months ago
2004
Springer
This paper addresses the dynamic scheduling of moldable jobs with QoS demands (soft-deadlines) in multiclusters. A moldable job can be run on a variable number of resources. Three ...
CCGRID
2004
IEEE
15 years 5 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...
124
click to vote
ICDCS
2011
IEEE
14 years 1 months ago
2011
IEEE
—Massively parallel scientific applications, running on extreme-scale supercomputers, produce hundreds of terabytes of data per run, driving the need for storage solutions to im...
129
click to vote
FCT
2009
Springer
15 years 8 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
155
click to vote
PODC
2012
ACM
13 years 4 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...