523 search results - page 65 / 105 » Load balancing using dynamic cache allocation |
125
Voted
PPOPP
1993
ACM
15 years 6 months ago
1993
ACM
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programm...
124
click to vote
PARLE
1993
15 years 6 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
111
Voted
ICFP
1997
ACM
15 years 6 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
115
Voted
SIGCOMM
2009
ACM
15 years 8 months ago
2009
ACM
To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to...
103
Voted
GRID
2007
Springer
15 years 8 months ago
2007
Springer
Application scheduling studies on large-scale shared resources have advocated the use of resource provisioning in the form of advance reservations for providing predictable and de...