832 search results - page 144 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
124
Voted
CCGRID
2009
IEEE
15 years 10 months ago
2009
IEEE
— We propose a novel approach for sharing cluster resources among competing jobs. The key advantage of our approach over current solutions is that it increases cluster utilizatio...
113
Voted
ISPDC
2005
IEEE
15 years 9 months ago
2005
IEEE
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
105
click to vote
DCOSS
2010
Springer
15 years 5 months ago
2010
Springer
Jamming attacks are especially harmful when ensuring the dependability of wireless communication. Finding the position of a jammer will enable the network to actively exploit a wid...
159
Voted
OPODIS
2010
15 years 1 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
142
click to vote
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...