Sciweavers

456 search results - page 26 / 92
» Compiler Optimizations for Improving Data Locality
Sort
View
ASPLOS
2004
ACM
15 years 3 months ago
Compiler orchestrated prefetching via speculation and predication
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...
Rodric M. Rabbah, Hariharan Sandanagobalane, Mongk...
92
Voted
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 1 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
LISP
2008
104views more  LISP 2008»
14 years 9 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
ICCAD
2003
IEEE
159views Hardware» more  ICCAD 2003»
15 years 6 months ago
Array Composition and Decomposition for Optimizing Embedded Applications
Optimizing array accesses is extremely critical in embedded computing as many embedded applications make use of arrays (in form of images, video frames, etc). Previous research co...
Guilin Chen, Mahmut T. Kandemir, A. Nadgir, Ugur S...
101
Voted
SIGMOD
2004
ACM
173views Database» more  SIGMOD 2004»
15 years 9 months ago
Relaxed Currency and Consistency: How to Say "Good Enough" in SQL
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applicati...
Hongfei Guo, Jonathan Goldstein, Per-Åke Lar...