734 search results - page 101 / 147 » Multiprocess Time Queue |
102
Voted
DC
2006
15 years 17 days 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 ...
87
Voted
ENTCS
2006
15 years 17 days 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...
102
Voted
COMCOM
2002
15 years 11 days 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 ...
107
Voted
SIGMETRICS
2002
ACM
15 years 6 days 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
14 years 11 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...