Sciweavers

94 search results - page 10 / 19
» Detecting loop-carried dependences in programs with dynamic ...
Sort
View
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 7 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
CF
2005
ACM
13 years 10 months ago
Dynamic loop pipelining in data-driven architectures
Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over micro...
João M. P. Cardoso
ISCA
2009
IEEE
199views Hardware» more  ISCA 2009»
14 years 3 months ago
SigRace: signature-based data race detection
Detecting data races in parallel programs is important for both software development and production-run diagnosis. Recently, there have been several proposals for hardware-assiste...
Abdullah Muzahid, Darío Suárez Graci...
FMCAD
2009
Springer
14 years 3 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
CSFW
2011
IEEE
12 years 8 months ago
Modular Protections against Non-control Data Attacks
—This paper introduces YARRA, a conservative extension to C to protect applications from non-control data attacks. YARRA programmers specify their data integrity requirements by ...
Cole Schlesinger, Karthik Pattabiraman, Nikhil Swa...