6601 search results - page 768 / 1321 » Optimal Distributed Arc-Consistency |
211
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
229
click to vote
CLUSTER
2008
IEEE
2008
IEEE
A trace-driven emulation framework to predict scalability of large clusters in presence of OS Jitter
16 years 1 months ago
—Various studies have pointed out the debilitating effects of OS Jitter on the performance of parallel applications on large clusters such as the ASCI Purple and the Mare Nostrum...
198
click to vote
SAC
2004
ACM
16 years 19 days ago
2004
ACM
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
183
click to vote
GECCO
2004
Springer
16 years 17 days ago
2004
Springer
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
230
click to vote
IPPS
2003
IEEE
16 years 14 days ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...