Sciweavers

1494 search results - page 246 / 299
» Less Extreme Programming
Sort
View
133
Voted
HPCA
2011
IEEE
14 years 6 months ago
Calvin: Deterministic or not? Free will to choose
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
Derek Hower, Polina Dudnik, Mark D. Hill, David A....
HPDC
2011
IEEE
14 years 6 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
14 years 2 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
ESORICS
2011
Springer
14 years 1 months ago
Linear Obfuscation to Combat Symbolic Execution
Abstract. Trigger-based code (malicious in many cases, but not necessarily) only executes when specific inputs are received. Symbolic execution has been one of the most powerful t...
Zhi Wang, Jiang Ming, Chunfu Jia, Debin Gao
171
Voted
ISCA
2012
IEEE
224views Hardware» more  ISCA 2012»
13 years 4 months ago
A first-order mechanistic model for architectural vulnerability factor
Soft error reliability has become a first-order design criterion for modern microprocessors. Architectural Vulnerability Factor (AVF) modeling is often used to capture the probab...
Arun A. Nair, Stijn Eyerman, Lieven Eeckhout, Lizy...