3192 search results - page 287 / 639 » The minimum latency problem |
156
click to vote
GRID
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
156
click to vote
ISPA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. With the help of distributed hash tables, the structured peerto-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and...
137
click to vote
DATE
2003
IEEE
15 years 10 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
135
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
138
click to vote
ERCIMDL
2003
Springer
15 years 10 months ago
2003
Springer
Latency is a fundamental problem for all distributed systems including digital libraries. To reduce user perceived delays both caching – keeping accessed objects for future use ...