Sciweavers

2703 search results - page 258 / 541
» Optimizing memory transactions
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Efficient context adaptive entropy coding for real-time applications
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...
Guillaume Fuchs, Vignesh Subbaraman, Markus Multru...
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
15 years 10 months ago
Activity clustering for leakage management in SPMs
This paper we proposes compiler-based leakage optimization strategy for on-chip scratch-pad memories (SPMs). The idea is to keep only a small set of SPM regions active at a given ...
Mahmut T. Kandemir, Guangyu Chen, Feihui Li, Mary ...
INFOCOM
2003
IEEE
15 years 9 months ago
Fast Incremental Updates for Pipelined Forwarding Engines
— Pipelined ASIC architectures are increasingly being used in forwarding engines for high speed IP routers. We explore optimization issues in the design of memory-efficient data...
Anindya Basu, Girija J. Narlikar
CODES
2007
IEEE
15 years 10 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
CF
2006
ACM
15 years 8 months ago
Landing openMP on cyclops-64: an efficient mapping of openMP to a many-core system-on-a-chip
This paper presents our experience mapping OpenMP parallel programming model to the IBM Cyclops-64 (C64) architecture. The C64 employs a many-core-on-a-chip design that integrates...
Juan del Cuvillo, Weirong Zhu, Guang R. Gao