Sciweavers

49 search results - page 7 / 10
» A Trace-Driven Comparison of Algorithms for Parallel Prefetc...
Sort
View
ICPADS
1998
IEEE
13 years 11 months ago
Probability Based Replacement Algorithm for WWW Server Arrays
This paper describes a scalable Web server array architecture which uses a caching policy called Probability Based Replacement (PBR) algorithm [5, 6]. The server array consists of...
K. H. Yeung, K. W. Suen
ICDCSW
2003
IEEE
13 years 12 months ago
A Study of the Performance and Parameter Sensitivity of Adaptive Distributed Caching
A self-organized approach to manage a distributed proxy system called Adaptive Distributed Caching (ADC) has been proposed previously. We model each proxy as an autonomous agent th...
Markus J. Kaiser, Kwok Ching Tsui, Jiming Liu
IEEEPACT
2009
IEEE
14 years 1 months ago
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
Qingda Lu, Jiang Lin, Xiaoning Ding, Zhao Zhang, X...
JAVA
2001
Springer
13 years 11 months ago
A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
Peter R. Cappello, Dimitros Mourloukos
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
14 years 2 days ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel