20 search results - page 1 / 4 » Abstract Interpretation of FIFO Replacement |
SAS
2009
Springer
14 years 5 months ago
2009
Springer
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...
AMAST
2006
Springer
13 years 8 months ago
2006
Springer
Interpretation of FIFO Queues Tristan Le Gall, Bertrand Jeannet, and Thierry J
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page fra...
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...