Results 271 to 280 of about 346,755 (328)
Generalization of preemptive and non-preemptive priority queues
, 2010 Tom Maertens +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Queue-dependent servers queueing system
Microelectronics Reliability, 1993Abstract A Markovian queue with number of servers depending upon queue length is discussed. The system starts another server whenever the queue length in front of first server reaches a certain length N. Associating the costs with the opening of a new server and the waiting of the customers, a relationship is developed to obtain the optimum value of ...
R.L. Garg, Paramjit Singh
openaire +1 more source
Fair queueing without per-flow queues: A Virtual Queueing Machine
2014 International Conference on Computing, Networking and Communications (ICNC), 2014In this paper, we present a novel fair-queueing solution, dubbed Virtual Queueing Machine (VQM), that avoids the one-queueing-per-flow architecture found in many existing solutions. Its objective is to provide throughput fairness among competing backlogged flows while protecting the response times for short-lived flows.
Gary Chang, C. C. Lee
openaire +1 more source
Queue Length Dependent Priority Queues
Management Science, 1971Priority rules that are mixtures of pre-emption and postponable rules are analyzed. Whether a pre-emption occurs is made to depend on some factor in addition to priority class. A lower priority customer is pre-empted if and only if the queue length of higher priority customers is N, a decision parameter.
openaire +1 more source
Finite Queues and Cyclic Queues
Operations Research, 1960The finite queue problem, for which tables exist [Peck, L. G., R. N. Hazelwood. 1958. Finite Queuing Tables. ORSA Publications in Operations Research No. 2. Wiley, New York.], is a special case of the cyclic queue [Koenigsberg, E. 1958. Oper. Res. Quart. 9 22–35].
openaire +1 more source
2001
Abstract Suppose now that the random walker of Exercise (1) delays its steps in the following way. When at the point n, it waits a random length of time having the exponential distribution with parameter 0n before moving to its next position; different ‘holding times’ are independent of each other and of further information concerning ...
C. Armero, M.J. Bayarri
openaire +2 more sources
Abstract Suppose now that the random walker of Exercise (1) delays its steps in the following way. When at the point n, it waits a random length of time having the exponential distribution with parameter 0n before moving to its next position; different ‘holding times’ are independent of each other and of further information concerning ...
C. Armero, M.J. Bayarri
openaire +2 more sources
Operations Research, 1964
Customers of different priorities are arriving at a counter in accordance with a Poisson process. The customers are served by a single server in order of priority and for each priority in order of arrival. Two cases are considered: (i) service with privileged interruptions and (ii) service without interruption.
openaire +1 more source
Customers of different priorities are arriving at a counter in accordance with a Poisson process. The customers are served by a single server in order of priority and for each priority in order of arrival. Two cases are considered: (i) service with privileged interruptions and (ii) service without interruption.
openaire +1 more source
Biometrika, 1957
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire +1 more source
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire +1 more source
After Dinner Conversation
Is a “better life” always the one you aren’t living? In this work of philosophical short fiction, Colin accompanies his friend Alistair to join “Queue,” a daily ritual where people line up for a chance to enter a mysterious hut that promises access to a better life on the other side of a wall. While Alistair desperately clings to the hope of escape and
Jianfeng Ren, Andric Li
openaire +2 more sources
Is a “better life” always the one you aren’t living? In this work of philosophical short fiction, Colin accompanies his friend Alistair to join “Queue,” a daily ritual where people line up for a chance to enter a mysterious hut that promises access to a better life on the other side of a wall. While Alistair desperately clings to the hope of escape and
Jianfeng Ren, Andric Li
openaire +2 more sources