Sciweavers

720 search results - page 67 / 144
» Uniform Memory Hierarchies
Sort
View
149
Voted
CASES
2010
ACM
15 years 2 months ago
Balancing memory and performance through selective flushing of software code caches
Dynamic binary translators (DBTs) are becoming increasingly important because of their power and flexibility. However, the high memory demands of DBTs present an obstacle for all ...
Apala Guha, Kim M. Hazelwood, Mary Lou Soffa
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
14 years 4 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
FOCS
2002
IEEE
15 years 9 months ago
Load Balancing with Memory
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
Michael Mitzenmacher, Balaji Prabhakar, Devavrat S...
EMSOFT
2007
Springer
15 years 10 months ago
The revenge of the overlay: automatic compaction of OS kernel code via on-demand code loading
There is increasing interest in using general-purpose operating systems, such as Linux, on embedded platforms. It is especially important in embedded systems to use memory effici...
Haifeng He, Saumya K. Debray, Gregory R. Andrews
ACMMSP
2006
ACM
232views Hardware» more  ACMMSP 2006»
15 years 10 months ago
Implicit and explicit optimizations for stencil computations
Stencil-based kernels constitute the core of many scientific applications on block-structured grids. Unfortunately, these codes achieve a low fraction of peak performance, due pr...
Shoaib Kamil, Kaushik Datta, Samuel Williams, Leon...