6105 search results - page 873 / 1221 » A Parallel Algorithm for Bound-Smoothing |
143
click to vote
CLUSTER
2007
IEEE
16 years 1 months ago
2007
IEEE
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
152
click to vote
KBSE
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its...
148
click to vote
COCO
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
155
click to vote
EUROPAR
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
160
click to vote
EUROPAR
2007
Springer
16 years 27 days ago
2007
Springer
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...