Results 1  10
of
5,110
ON THE SINGLESERVER RETRIAL QUEUE
"... we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under ..."
Abstract
 Add to MetaCart
we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under
Cycle times in single server . . .
, 2004
"... Using the arrival theorem together with elementary facts regarding integrated tail distributions and lengthbiased sampling we obtain closed form expressions for the interoutput time and the cycle time distribution in cyclic, singleclass Jackson networks. Corresponding expressions for the normaliz ..."
Abstract
 Add to MetaCart
Using the arrival theorem together with elementary facts regarding integrated tail distributions and lengthbiased sampling we obtain closed form expressions for the interoutput time and the cycle time distribution in cyclic, singleclass Jackson networks. Corresponding expressions
COMMENTS ON A SINGLE SERVER QUEUE
, 1995
"... A review of the work of V.E. Bens and P. Brmaud on a singleserver queue G/G/1 is interpreted in terms of point processes and associated martingales. A concept of a discounted workload is introduced, and its connection with random Dirichlet series and associated semigroups is investigated. ..."
Abstract
 Add to MetaCart
A review of the work of V.E. Bens and P. Brmaud on a singleserver queue G/G/1 is interpreted in terms of point processes and associated martingales. A concept of a discounted workload is introduced, and its connection with random Dirichlet series and associated semigroups is investigated.
The Utility of Foresight in Single Server Scheduling
"... We consider a single server job queueing system with a Poisson arrival process, hyperexponentially distributed job service times, no job precedence constraints, nonpreemptive service and a lookahead table of jobs. A lookahead heuristic is described which schedules jobs to minimize average job waiti ..."
Abstract
 Add to MetaCart
We consider a single server job queueing system with a Poisson arrival process, hyperexponentially distributed job service times, no job precedence constraints, nonpreemptive service and a lookahead table of jobs. A lookahead heuristic is described which schedules jobs to minimize average job
The Vienna RNA Secondary Structure Server
 Nucleic Acids Res
, 2003
"... The Vienna RNA secondary structure server provides a web interface to the most frequently used functions of the Vienna RNA software package for the analysis of RNA secondary structures. It currently o#ers prediction of secondary structure from a single sequence, prediction of the consensus secondary ..."
Abstract

Cited by 611 (23 self)
 Add to MetaCart
The Vienna RNA secondary structure server provides a web interface to the most frequently used functions of the Vienna RNA software package for the analysis of RNA secondary structures. It currently o#ers prediction of secondary structure from a single sequence, prediction of the consensus
Logarithmic Asymptotics For SteadyState Tail Probabilities In A SingleServer Queue
, 1993
"... We consider the standard singleserver queue with unlimited waiting space and the firstin firstout service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steadystate waitingtime distribution to have smalltail asympt ..."
Abstract

Cited by 180 (14 self)
 Add to MetaCart
We consider the standard singleserver queue with unlimited waiting space and the firstin firstout service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steadystate waitingtime distribution to have small
Large Deviations and Overflow Probabilities for the General SingleServer Queue, With Applications
, 1994
"... We consider from a thermodynamic viewpoint queueing systems where the workload process is assumed to have an associated large deviation principle with arbitrary scaling: there exist increasing scaling functions (a t ; v t ; t 2 R+ ) and a rate function I such that if (W t ; t 2 R+ ) denotes the wo ..."
Abstract

Cited by 210 (19 self)
 Add to MetaCart
We consider from a thermodynamic viewpoint queueing systems where the workload process is assumed to have an associated large deviation principle with arbitrary scaling: there exist increasing scaling functions (a t ; v t ; t 2 R+ ) and a rate function I such that if (W t ; t 2 R+ ) denotes the workload process, then lim t!1 v \Gamma1 t log P (W t =a t ? w) = \GammaI (w) on the continuity set of I . In the case that a t = v t = t it has been argued heuristically, and recently proved in a fairly general context (for discrete time models) by Glynn and Whitt [8], that the queuelength distribution (that is, the distribution of supremum of the workload process Q = sup t0 W t ) decays exponentially: P (Q ? b) ¸ e \Gammaffib and the decay rate ffi is directly related to the rate function I . We establish conditions for a more general result to hold, where the scaling functions are not necessarily linear in t: we find that the queuelength distribution has an exponential tail only if l...
Mfold web server for nucleic acid folding and hybridization prediction
 Nucleic Acids Res
, 2003
"... The abbreviated name,‘mfold web server’,describes a number of closely related software applications available on the World Wide Web (WWW) for the prediction of the secondary structure of single stranded nucleic acids. The objective of this web server is to provide easy access to RNA and DNA folding ..."
Abstract

Cited by 1992 (0 self)
 Add to MetaCart
The abbreviated name,‘mfold web server’,describes a number of closely related software applications available on the World Wide Web (WWW) for the prediction of the secondary structure of single stranded nucleic acids. The objective of this web server is to provide easy access to RNA and DNA folding
Fairness and Scheduling in Single Server Queues
"... Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness ’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficu ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness ’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade and a growing literature providing an analytic framework for studying fairness has emerged. This article surveys recent developments, which include a rich variety of fairness metrics as well as a growing understanding of the fairness of common scheduling policies. Keywords: Queueing theory, Scheduling theory, Fairness
Results 1  10
of
5,110