Sciweavers

10 search results - page 2 / 2
» The Limits of Alias Analysis for Scalar Optimizations
Sort
View
TSP
2010
12 years 11 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
13 years 8 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
APLAS
2005
ACM
13 years 10 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
IEEEPACT
2008
IEEE
13 years 11 months ago
Exploiting loop-dependent stream reuse for stream processors
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers,...
TSP
2011
170views more  TSP 2011»
12 years 11 months ago
Low-Delay Prediction- and Transform-Based Wyner-Ziv Coding
—This paper studies low-delay Wyner–Ziv coding, i.e., lossy source coding with side information at the decoder, with emphasis on the extreme of zero delay. To achieve zero dela...
Xuechen Chen, Ertem Tuncel