Sciweavers

3202 search results - page 209 / 641
» Memory access scheduling
Sort
View
179
Voted
CSFW
2011
IEEE
14 years 5 months ago
Local Memory via Layout Randomization
—Randomization is used in computer security as a tool to introduce unpredictability into the software infrastructure. In this paper, we study the use of randomization to achieve ...
Radha Jagadeesan, Corin Pitcher, Julian Rathke, Ja...
CODES
2008
IEEE
16 years 17 days ago
Speculative DMA for architecturally visible storage in instruction set extensions
Instruction set extensions (ISEs) can accelerate embedded processor performance. Many algorithms for ISE generation have shown good potential; some of them have recently been expa...
Theo Kluter, Philip Brisk, Paolo Ienne, Edoardo Ch...
ICN
2007
Springer
16 years 8 days ago
Succinct Representation of Static Packet Forwarding Tables
We develop algorithms for the compact representation of the trie structures that are used for Internet packet forwarding. Our compact representations are experimentally compared w...
Wencheng Lu, Sartaj Sahni
ASPLOS
2004
ACM
15 years 11 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...
EUROPAR
2006
Springer
15 years 9 months ago
A Hierarchical CLH Queue Lock
Abstract. Modern multiprocessor architectures such as CC-NUMA machines or CMPs have nonuniform communication architectures that render programs sensitive to memory access locality....
Victor Luchangco, Daniel Nussbaum, Nir Shavit