Sciweavers

2227 search results - page 261 / 446
» Reversibility and Models for Concurrency
Sort
View
ICDE
1999
IEEE
126views Database» more  ICDE 1999»
15 years 2 days ago
Improving the Access Time Performance of Serpentine Tape Drives
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
Olav Sandstå, Roger Midtstraum
DAC
2005
ACM
14 years 11 months ago
A lattice-based framework for the classification and design of asynchronous pipelines
This paper presents a unifying framework for the modeling of asynchronous pipeline circuits. A pipeline protocol is captured in a graph-based model which defines the partial order...
Peggy B. McGee, Steven M. Nowick
POPL
2008
ACM
14 years 11 months ago
Semantics of transactional memory and automatic mutual exclusion
Software Transactional Memory (STM) is an attractive basis for the development of language features for concurrent programming. However, the semantics of these features can be del...
Andrew Birrell, Martín Abadi, Michael Isard...
POPL
2009
ACM
14 years 5 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 5 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...