1243 search results - page 182 / 249 » On the locality of bounded growth |
166
click to vote
MIDDLEWARE
2007
Springer
16 years 15 days ago
2007
Springer
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
184
click to vote
LCN
2006
IEEE
16 years 11 days ago
2006
IEEE
Infostations provide an inexpensive and high speed wireless disseminator that features discontinuous coverage by bounding many low cost, limited transmission range and high-bandwi...
159
click to vote
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
179
click to vote
JSSPP
2004
Springer
15 years 11 months ago
2004
Springer
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
147
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...