Sciweavers

2095 search results - page 277 / 419
» Improved pebbling bounds
Sort
View
NCA
2007
IEEE
16 years 1 months ago
Implementing Atomic Data through Indirect Learning in Dynamic Networks
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...
ACSAC
2006
IEEE
16 years 24 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 23 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 23 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»
16 years 4 days 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,...