Sciweavers

2208 search results - page 47 / 442
» Memory Practices in the Sciences
Sort
View
FOCS
1998
IEEE
14 years 1 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin
ISCA
2008
IEEE
185views Hardware» more  ISCA 2008»
13 years 9 months ago
From Speculation to Security: Practical and Efficient Information Flow Tracking Using Speculative Hardware
Dynamic information flow tracking (also known as taint tracking) is an appealing approach to combat various security attacks. However, the performance of applications can severely...
Haibo Chen, Xi Wu, Liwei Yuan, Binyu Zang, Pen-Chu...
VEE
2012
ACM
252views Virtualization» more  VEE 2012»
12 years 4 months ago
libdft: practical dynamic data flow tracking for commodity systems
Dynamic data flow tracking (DFT) deals with tagging and tracking data of interest as they propagate during program execution. DFT has been repeatedly implemented by a variety of ...
Vasileios P. Kemerlis, Georgios Portokalidis, Kang...
STACS
2004
Springer
14 years 2 months ago
Digraphs Exploration with Little Memory
Under the robot model, we show that a robot needs Ω(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorith...
Pierre Fraigniaud, David Ilcinkas
SPIN
2010
Springer
13 years 7 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper