Sciweavers

1192 search results - page 228 / 239
» Computing Weakest Readings
Sort
View
RTCSA
1998
IEEE
15 years 6 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...
VLDB
1998
ACM
147views Database» more  VLDB 1998»
15 years 6 months ago
Architecture of Oracle Parallel Server
Oracle Parallel Server (OPS) is a shared disk RDBMS. We present a high level overview of the main architectural issues of OPS and their evolution throughout the releases of the Or...
Roger Bamford, D. Butler, Boris Klots, N. MacNaugh...
VISUALIZATION
1997
IEEE
15 years 6 months ago
Application-controlled demand paging for out-of-core visualization
In the area of scientific visualization, input data sets are often very large. In visualization of Computational Fluid Dynamics (CFD) in particular, input data sets today can surp...
Michael Cox, David Ellsworth
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 5 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
CASES
2007
ACM
15 years 5 months ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne