Sciweavers

9626 search results - page 1555 / 1926
» Invariant Based Programming
Sort
View
POS
1998
Springer
15 years 11 months ago
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Swizzling refers to the translation of object references from an external, persistent format to an internal, transient format used during application execution. Eager swizzling sc...
Kumar Brahnmath, Nathaniel Nystrom, Antony L. Hosk...
SIGGRAPH
1997
ACM
15 years 11 months ago
Interactive simulation of fire in virtual building environments
This paper describes the integration of the Berkeley Architectural Walkthrough Program with the National Institute of Standards and Technology’s CFAST fire simulator. The integ...
Richard W. Bukowski, Carlo H. Séquin
ASPLOS
1996
ACM
15 years 11 months ago
Analysis of Branch Prediction Via Data Compression
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge
ICALP
1993
Springer
15 years 11 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
171
Voted
ASPLOS
1992
ACM
15 years 11 months ago
Parity Declustering for Continuous Operation in Redundant Disk Arrays
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
Mark Holland, Garth A. Gibson
« Prev « First page 1555 / 1926 Last » Next »