5448 search results - page 757 / 1090 » Breakpoints and Time in Distributed Computations |
206
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
163
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
161
click to vote
HPCA
2000
IEEE
15 years 11 months ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
184
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
Processor cycle time continues to decrease faster than main memory access times, placing higher demands on cache memory hierarchy performance. To meet these demands, conventional ...
190
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...