734 search results - page 101 / 147 » Multiprocess Time Queue |
DC
2006
13 years 11 months ago
2006
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...
ENTCS
2006
13 years 11 months ago
2006
Executing concurrent specifications on sequential hardware is important for both simulation of systems that are eventually implemented on concurrent hardware and for those most co...
COMCOM
2002
13 years 10 months ago
2002
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is ...
SIGMETRICS
2002
ACM
13 years 10 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
—It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index i...