14 search results - page 1 / 3 » FIFO anomaly is unbounded |
CORR
2010
Springer
13 years 4 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...
AMAST
2006
Springer
13 years 8 months ago
2006
Springer
Interpretation of FIFO Queues Tristan Le Gall, Bertrand Jeannet, and Thierry J
ENTCS
2008
13 years 4 months ago
2008
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
CN
2007
13 years 4 months ago
2007
Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs ...
LICS
1993
IEEE
13 years 9 months ago
1993
IEEE
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...