Sciweavers

3927 search results - page 3 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
EUROSYS
2007
ACM
14 years 8 months ago
Sealing OS processes to improve dependability and safety
In most modern operating systems, a process is a -protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms—dynamic code ...
Galen C. Hunt, Mark Aiken, Manuel Fähndrich, ...
ICCD
2002
IEEE
88views Hardware» more  ICCD 2002»
14 years 7 months ago
Improving Processor Performance by Simplifying and Bypassing Trivial Computations
During the course of a program’s execution, a processor performs many trivial computations; that is, computations that can be simplified or where the result is zero, one, or equ...
Joshua J. Yi, David J. Lilja
CGO
2005
IEEE
14 years 4 months ago
Sentinel PRE: Hoisting beyond Exception Dependency with Dynamic Deoptimization
Many excepting instructions cannot be removed by existing Partial Redundancy Elimination (PRE) algorithms because the ordering constraints must be preserved between the excepting ...
Rei Odaira, Kei Hiraki
RTSS
2005
IEEE
14 years 4 months ago
Improving Soft Real-Time Performance through Better Slack Reclaiming
Modern operating systems frequently support applications with a variety of timing constraints including hard real-time, soft real-time, and best-effort. To guarantee performance, ...
Caixue Lin, Scott A. Brandt
SIGSOFT
2002
ACM
14 years 11 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...