Sciweavers

171 search results - page 23 / 35
» Minimal TCB Code Execution
Sort
View
CODES
2009
IEEE
14 years 2 months ago
On compile-time evaluation of process partitioning transformations for Kahn process networks
Kahn Process Networks is an appealing model of computation for programming and mapping applications onto multi-processor platforms. Autonomous processes communicate through unboun...
Sjoerd Meijer, Hristo Nikolov, Todor Stefanov
IWMM
2007
Springer
130views Hardware» more  IWMM 2007»
14 years 1 months ago
Accordion arrays
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
Craig B. Zilles
ACSAC
2006
IEEE
14 years 1 months ago
Known/Chosen Key Attacks against Software Instruction Set Randomization
Instruction Set Randomization (ISR) has been proposed as a form of defense against binary code injection into an executing program. One proof-of-concept implementation is Randomiz...
Yoav Weiss, Elena Gabriela Barrantes
CGO
2005
IEEE
14 years 1 months ago
Superword-Level Parallelism in the Presence of Control Flow
In this paper, we describe how to extend the concept of superword-level parallelization (SLP), used for multimedia extension architectures, so that it can be applied in the presen...
Jaewook Shin, Mary W. Hall, Jacqueline Chame
CODES
2003
IEEE
14 years 24 days ago
A low power scheduler using game theory
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...
N. Ranganathan, Ashok K. Murugavel