Sciweavers

2944 search results - page 427 / 589
» Improving Bound Propagation
Sort
View
ACSAC
2006
IEEE
16 years 17 days ago
Engineering Sufficiently Secure Computing
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
Brian Witten
IPPS
2006
IEEE
16 years 16 days ago
Evaluating cooperative checkpointing for supercomputing systems
Cooperative checkpointing, in which the system dynamically skips checkpoints requested by applications at runtime, can exploit system-level information to improve performance and ...
Adam J. Oliner, Ramendra K. Sahoo
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
16 years 15 days ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
CC
2004
Springer
110views System Software» more  CC 2004»
15 years 12 months ago
The Limits of Alias Analysis for Scalar Optimizations
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
Rezaul Alam Chowdhury, Peter Djeu, Brendon Cahoon,...
JSSPP
2004
Springer
15 years 12 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan