Sciweavers

223 search results - page 5 / 45
» A Compiler Scheme for Reusing Intermediate Computation Resul...
Sort
View
CASES
2009
ACM
13 years 5 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
WCNC
2010
IEEE
13 years 11 months ago
Frequency Reuse Techniques for Attaining Both Coverage and High Spectral Efficiency in OFDMA Cellular Systems
—Inter-cell interference (ICI) is always a big obstacle to attain wide area coverage and high spectral efficiency in cellular systems. In this work we make a study of two well-kn...
Zheng Xie, Bernhard Walke
JACM
2002
107views more  JACM 2002»
13 years 7 months ago
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
Hisao Kameda, Odile Pourtallier
ICS
2009
Tsinghua U.
14 years 2 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
POPL
1996
ACM
14 years 2 days ago
Discovering Auxiliary Information for Incremental Computation
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...
Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum