Sciweavers

2519 search results - page 68 / 504
» Martingales and Locality in Distributed Computing
Sort
View
ICS
2000
Tsinghua U.
14 years 11 days ago
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop ...
Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali
PDCN
2004
13 years 10 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
ICS
2010
Tsinghua U.
14 years 6 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ICDCS
2010
IEEE
14 years 20 days ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang
IEEEPACT
1998
IEEE
14 years 1 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...