Relevant bibliographies by topics / Queues

Academic literature on the topic 'Queues'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Queues.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Queues"

1

Baek, Seung Jun, and Joon-Sang Park. "Delay-Optimal Scheduling for Two-Hop Relay Networks with Randomly Varying Connectivity: Join the Shortest Queue-Longest Connected Queue Policy." Mathematical Problems in Engineering 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/4362652.

Full text
Abstract:
We consider a scheduling problem for a two-hop queueing network where the queues have randomly varying connectivity. Customers arrive at the source queue and are later routed to multiple relay queues. A relay queue can be served only if it is in connected state, and the state changes randomly over time. The source queue and relay queues are served in a time-sharing manner; that is, only one customer can be served at any instant. We propose Join the Shortest Queue-Longest Connected Queue (JSQ-LCQ) policy as follows: (1) if there exist nonempty relay queues in connected state, serve the longest queue among them; (2) if there are no relay queues to serve, route a customer from the source queue to the shortest relay queue. For symmetric systems in which the connectivity has symmetric statistics across the relay queues, we show that JSQ-LCQ is strongly optimal, that is, minimizes the delay in the stochastic ordering sense. We use stochastic coupling and show that the systems under coupling exist in two distinct phases, due to dynamic interactions among source and relay queues. By careful construction of coupling in both phases, we establish the stochastic dominance in delay between JSQ-LCQ and any arbitrary policy.
APA, Harvard, Vancouver, ISO, and other styles
2

Tu, Rungting, Wenting Feng, Cheryl Lin, and Pikuei Tu. "Read into the lines: the positive effects of queues." Journal of Service Theory and Practice 28, no. 5 (September 10, 2018): 661–81. http://dx.doi.org/10.1108/jstp-07-2017-0119.

Full text
Abstract:
PurposeCompanies work hard to reduce queue lengths due to the common belief that queues in general are undesirable. Extant literature mainly has focused on the negative consequences of queues and overlooked the potential positive effects. The purpose of this paper is to address the benefits of queues by examining how consumers of different segments may read into the lines (queues) as well as why and when positive effects occur.Design/methodology/approachApplying and integrating psychology and marketing theories, the study develops a model with several propositions to identify and explain the mechanism and conditions under which queues have positive effects.FindingsContrary to conventional belief, queues may serve as positive signs. In certain segments, consumers can perceive a queue as a reflection of superior service/product quality, an opportunity to fulfill the need(s) for self-uniqueness or social inclusion or an avenue to avoid social exclusion. In addition, the benefits of long queues may come from consumers’ joining a line to seek desirable outcomes/gains based on their attribution of the queue, and consumers’ prefactual thinking that regards “not joining” the queue as potential losses. Furthermore, the magnitude of such effects depends on queue distinctiveness, choice heterogeneity, consumption hedonism and performance uncertainty.Originality/valueThis paper explains how, why and when a long queue can be read as positive cues and benefits both the firms and target/potential consumers. The authors demonstrate the psychological mechanisms of joining a queue based on attribution and prefactual thinking, and identify conditions under which positive queue effects are most likely to occur.
APA, Harvard, Vancouver, ISO, and other styles
3

Spicer, Scott, and Ilze Ziedins. "User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss." Journal of Applied Probability 43, no. 1 (March 2006): 274–81. http://dx.doi.org/10.1239/jap/1143936259.

Full text
Abstract:
We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C1 and C2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).
APA, Harvard, Vancouver, ISO, and other styles
4

Dao-Thi, Thu-Ha, and Jean Mairesse. "Zero-automatic queues and product form." Advances in Applied Probability 39, no. 2 (June 2007): 429–61. http://dx.doi.org/10.1239/aap/1183667618.

Full text
Abstract:
We introduce and study a new model: zero-automatic queues. Roughly, zero-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable zero-automatic queues have a product form stationary distribution and a Poisson output process. When considering the two simplest and extremal cases of zero-automatic queues, we recover the simple M/M/1 queue and Gelenbe's G-queue with positive and negative customers.
APA, Harvard, Vancouver, ISO, and other styles
5

Dao-Thi, Thu-Ha, and Jean Mairesse. "Zero-automatic queues and product form." Advances in Applied Probability 39, no. 02 (June 2007): 429–61. http://dx.doi.org/10.1017/s000186780000183x.

Full text
Abstract:
We introduce and study a new model:zero-automatic queues. Roughly, zero-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable zero-automatic queues have a product form stationary distribution and a Poisson output process. When considering the two simplest and extremal cases of zero-automatic queues, we recover the simple M/M/1 queue and Gelenbe'sG-queue with positive and negative customers.
APA, Harvard, Vancouver, ISO, and other styles
6

Zheng, Guan, Yang Zhijun, Qian Wenhua, and He Min. "On Two-Level State-Dependent Routing Polling Systems with Mixed Service." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/109325.

Full text
Abstract:
Based on priority differentiation and efficiency of the system, we consider anN+1queues’ single-server two-level polling system which consists of one key queue andNnormal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
APA, Harvard, Vancouver, ISO, and other styles
7

Spicer, Scott, and Ilze Ziedins. "User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss." Journal of Applied Probability 43, no. 01 (March 2006): 274–81. http://dx.doi.org/10.1017/s0021900200001522.

Full text
Abstract:
We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C 1 and C 2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).
APA, Harvard, Vancouver, ISO, and other styles
8

Lemeshko, Oleksandr, Oleksandra Yeremenko, Larysa Titarenko, and Alexander Barkalov. "Hierarchical Queue Management Priority and Balancing Based Method under the Interaction Prediction Principle." Electronics 12, no. 3 (January 29, 2023): 675. http://dx.doi.org/10.3390/electronics12030675.

Full text
Abstract:
This work is devoted to improving a two-level hierarchical queue management method based on priority and balancing under the interaction prediction principle. The lower level of calculations was connected with the problem optimization solution and was responsible for two tasks. Firstly, the packet flow aggregation and distribution among the macro-queues and sub-queues organized on the router interface must solve the congestion management problem. Secondly, the resource allocation problem solution was related to the balanced allocation of interface bandwidth among the sub-queues, which were weighted relative to their priorities under the traffic-engineering queues. The method’s lower-level functions were recommended to be placed on a set of processors of a routing device responsible for servicing the packets of individual macro-queues. At the same time, the processor coordinator could perform the functions of the upper-level calculations, providing interface bandwidth allocation among the macro-queues. The numerical research results of the proposed two-level hierarchical queue management method confirmed its effectiveness in ensuring high scalability. Balanced, priority-based packet flow distribution and interface bandwidth allocation among the macro-queues and sub-queues were implemented. In addition, the time was reduced for solving tasks related to queue management. The method demonstrated high convergence of the coordination procedure and the quality of the centralized calculations. The proposed approach can be used in various embedded systems.
APA, Harvard, Vancouver, ISO, and other styles
9

Boxma, Onno, Mayank Saxena, Stella Kapodistria, and Rudesindo Núñez Queija. "Two queues with random time-limited polling." Probability and Mathematical Statistics 37, no. 2 (May 14, 2018): 257–89. http://dx.doi.org/10.19195/0208-4147.37.2.4.

Full text
Abstract:
TWO QUEUES WITH RANDOM TIME-LIMITED POLLINGIn this paper, we analyse a single server polling model withtwo queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues withgenerally distributed service times. The server spends an exponentially distributed amount of time in each queue. After the completion of this residing time, the server instantaneously switches to the other queue, i.e., there is noswitch-over time. For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results. Furthermore, we also calculate the joint queue length distribution for the special case of exponentially distributed service times using singular perturbation analysis.
APA, Harvard, Vancouver, ISO, and other styles
10

Pedarsani, Ramtin, and Jean Walrand. "Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling." Journal of Applied Probability 53, no. 2 (June 2016): 421–33. http://dx.doi.org/10.1017/jpr.2016.10.

Full text
Abstract:
Abstract We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routeing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routeing decisions at the queues are independent, stationary, and ergodic. A scheduling policy is called robust if it does not depend on the arrival and service rates nor on the routeing probabilities. A policy is called throughput-optimal if it makes the system stable whenever the parameters are such that the system can be stable. We propose two robust policies: longest-queue scheduling and a new policy called longest-dominating-queue scheduling. We show that longest-queue scheduling is throughput-optimal for two groups of two queues. We also prove the throughput-optimality of longest-dominating-queue scheduling when the network topology is acyclic, for an arbitrary number of groups and queues.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Queues"

1

Hernandez, Valencia Enrique Jose Posner Edward C. "Queues of queues in communication networks /." Diss., Pasadena, Calif. : California Institute of Technology, 1988. http://resolver.caltech.edu/CaltechETD:etd-11072007-090157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Jiheng. "Limited processor sharing queues and multi-server queues." Diss., Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/34825.

Full text
Abstract:
We study two classes of stochastic systems, the limited processor sharing system and the multi-server system. They share the common feature that multiple jobs/customers are being processed simultaneously, which makes the study of them intrinsically difficult. In the limited processor sharing system, a limited number of jobs can equally share a single server, and the excess ones wait in a first-in-first-out buffer. The model is mainly motivated by computer related applications, such as database servers and packet transmission over the Internet. This model is studied in the first part of the thesis. The multi-server queue is mainly motivated by call centers, where each customer is handled by an agent. The number of customers being served at any time is limited by number of agents employed. Customers who can not be served upon arrival wait in a first-in-first-out buffer. This model is studied in the second part of the thesis.
APA, Harvard, Vancouver, ISO, and other styles
3

Breuer, Lothar. "Spatial queues." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=961030135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lim, David Eng Chung. "Investigation in to ramp queues vs. freeway queues on ramp metered freeways." Thesis, Curtin University, 2010. http://hdl.handle.net/20.500.11937/1676.

Full text
Abstract:
Freeways and highways form an integral part of any road network system demanding significant quantities of resources to plan and construct. During times of congestion and flow breakdown forms of traffic management are required to maintain the efficiency, reliability and safety of these high asset road facilities. Here within lies the responsibilities of traffic engineering professionals. The lack of adequate maintenance and management of any urban road network system hinders economic development and quality of life.Ramp metering is an active traffic management system implemented on high speed, free flowing facilities such as freeways and highways. This form of intelligent transport system has been applied to freeways throughout the world to regulate the intensity and demand proportion of freeway inflow during peak demand periods. The primary goal is to manage the existing roadway to operate at maximum efficiency. Main Roads Western Australia, the governing road authority in Western Australia is currently in a position to investigate the suitability of ramp metering on Western Australia's freeways.This research demonstrates how traffic movement and interaction can be mapped and characterised to identify forms of traffic flow breakdown that ramp metering has the potential to address. This research also documents the required components of ramp metering, how it should operate and the potential this active management system has to be applied over a system wide road network infrastructure.The Mitchell Freeway southbound direction undergoes significant forms of congestion and traffic flow breakdown during the morning peak period. A traffic characteristic of the Mitchell Freeway was developed to make an evaluation for the suitability of ramp metering as an effective management system. An analytical comparison between current freeway queues and theoretical on-ramp queues provided indication that the congestion and flow breakdown currently observed had the potential to be managed through ramp metering, ensuring the future sustainability of this vital freeway for the city of Perth, Western Australia.
APA, Harvard, Vancouver, ISO, and other styles
5

Jori, Alessandro. "Queues de Lifshitz magnétiques /." [S.l.] : [s.n.], 1998. http://library.epfl.ch/theses/?nr=1813.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dieker, Antonius Bernardus. "Extremes and fluid queues." [S.l. : Amsterdam : s.n.] ; Universiteit van Amsterdam [Host], 2006. http://dare.uva.nl/document/19721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jones, Lee K., and Richard C. 1943 Larson. "Efficient Computation of Probabilities of Events Described by Order Statistics and Application to a Problem of Queues." Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5159.

Full text
Abstract:
Consider a set of N i.i.d. random variables in [0, 1]. When the experimental values of the random variables are arranged in ascending order from smallest to largest, one has the order statistics of the set of random variables. In this note an O(N3) algorithm is developed for computing the probability that the order statistics vector lies in a given rectangle. The new algorithm is then applied to a problem of statistical inference in queues. Illustrative computational results are included.
APA, Harvard, Vancouver, ISO, and other styles
8

Roy, Kirk Andrew. "Laplace transforms, probabilities and queues." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ31000.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shalmon, Michael S. "Queues and packet multiplexing networks." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=71999.

Full text
Abstract:
This thesis has to do with certain fundamental queues that are well established as models for delay in simple packet-switching concentrators and networks. We first revisit the single server queue with Poisson arrivals and general independent service times. We then work out a complete delay analysis for a traffic concentrating tandem network of queues with deterministic service and batch Poisson sources connected to every node; this is the most comprehensive analysis available for a network which is not of Jackson type. We also show how to (partially) extend the analysis to a concentrating tree network, and to an arrival process somewhat more general that batch Poisson.
The two parts of the thesis have a close methodological relationship. Our contribution in both cases is to rederive certain known results, and to produce a variety of new ones, using techniques that are essentially qualitative. Our particular view of the stochastic processes in question is guided by a very special queue discipline, namely Last Come First Served preemptive resume; by identifying certain structural features of the sample paths, one can read, almost without calculation, a host of statistics of common interest. The LCFS preemptive resume discipline also enables us: (i) to strengthen the connection between the single server queue with general independent service times and interarrival times, and the fluctuation theory of random walks; (ii) to strengthen the connection between the queue with Poisson arrivals and branching processes.
APA, Harvard, Vancouver, ISO, and other styles
10

Baber, Jack Martyn Alec. "Queues in series with blocking." Thesis, Cardiff University, 2008. http://orca.cf.ac.uk/54697/.

Full text
Abstract:
This piece of work describes a hospital's Critical Care Unit and uses different mathematical techniques to model the behaviour seen there. The main factor that is included in these models is the problem of bed blocking in the Unit. Blocking is defined as patients who are well enough not to be in the Critical Care Unit, but remain there, for any number of reasons. These patients are using up an expensive and limited resource. The mathematical techniques that the models are built on are extensively reviewed and analysed. These are the Coxian Phase Type Distribution and Networks of Queues with Blocking Equations. Both techniques are described in detail and their distributions analysed under different circumstances. The final chapter shows how the two distributions can be used to model a complex situation such as the one found in the Critical Care Unit. The models are tested and compared. Finally, the models are tested under a number of 'what if scenarios to predict the effect of changing certain factors on the actual Unit.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Queues"

1

Haviv, Moshe. Queues. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cox, D. R. Queues. Boca Raton, Fla: Chapman & Hall, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ganesh, Ayalvadi, Neil O’Connell, and Damon Wischik. Big Queues. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-39889-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Falin, G. I., and J. G. C. Templeton. Retrial Queues. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4899-2977-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Falin, G. I. Retrial queues. London: Chapman & Hall, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

P, Sharma O. Markovian queues. New York: Ellis Horwood, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Penpushers, Bloxwich, ed. Queue lines: The Bloxwich book of queues. Bloxwich: Bloxwich Penpushers, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Denteneer, Dee. Multiaccess, Reservations & Queues. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

A, Roos Patricia, ed. Job queues, gender queues: Explaining women's inroads into male occupations. Philadelphia: Temple University Press, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Robert, Philippe. Stochastic Networks and Queues. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-662-13052-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Queues"

1

Beidler, John. "Queues." In Data Structures and Algorithms, 121–44. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1854-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Putrady, Ecky. "Queues." In Practical Web Development with Haskell, 113–34. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3739-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sericola, Bruno. "Queues." In Markov Chains, 287–380. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118731543.ch5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mehta, Ashok B. "Queues." In Introduction to SystemVerilog, 105–20. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71319-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Upadhyaya, Bhim P. "Queues." In Data Structures and Algorithms with Scala, 51–56. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-12561-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Haviv, Moshe. "The Exponential Distribution and the Poisson Process." In Queues, 1–19. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Haviv, Moshe. "Closed Networks of Exponential Queues." In Queues, 151–63. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Haviv, Moshe. "Insensitivity and Product-Form Queueing Models." In Queues, 165–79. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Haviv, Moshe. "Two-Dimensional Markov Processes and Their Applications to Memoryless Queues." In Queues, 181–216. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Haviv, Moshe. "Introduction to Renewal Theory." In Queues, 21–36. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6765-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Queues"

1

Vijayashree, K. V., and A. Anjuka. "Fluid Queues Driven by State Dependent Queues." In 3rd Annual International Conference on Operations Research and Statistics. Global Science Technology Forum, 2013. http://dx.doi.org/10.5176/2251-1938_ors13.40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ciucu, Florin, Felix Poloczek, and Amr Rizk. "Queue and Loss Distributions in Finite-Buffer Queues." In SIGMETRICS '19: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3309697.3331496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brewer, Eric A., Frederic T. Chong, Lok T. Liu, Shamik D. Sharma, and John D. Kubiatowicz. "Remote queues." In the seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/215399.215416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sela, Gal, and Erez Petrank. "Durable Queues." In SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3409964.3461791.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

El Rheddane, Ahmed, Noel De Palma, Alain Tchana, and Daniel Hagimont. "Elastic Message Queues." In 2014 IEEE 7th International Conference on Cloud Computing (CLOUD). IEEE, 2014. http://dx.doi.org/10.1109/cloud.2014.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Burns, A., and A. J. Wellings. "Accessing delay queues." In the 11th international workshop. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/584418.584428.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Hyunyoung, and Jennifer L. Welch. "Randomized shared queues." In the twentieth annual ACM symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/383962.384050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Scherer, William N., Doug Lea, and Michael L. Scott. "Scalable synchronous queues." In the eleventh ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1122971.1122994.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Caprita, Bogdan, Jason Nieh, and Clifford Stein. "Grouped distributed queues." In the twenty-fifth annual ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1146381.1146396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Amon, Tod, and Gaetano Borriello. "Sizing synchronization queues." In the 28th conference. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/127601.127752.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Queues"

1

Gelenbe, Erol, Peter Glynn, and Karl Sigman. Queues with Negative Arrivals. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada213860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Glynn, Peter W., and Donald L. Iglehart. Simulation Methods for Queues: An Overview. Fort Belvoir, VA: Defense Technical Information Center, April 1988. http://dx.doi.org/10.21236/ada197084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Glynn, Peter W., and Ward Whitt. Departures from Many Queues in Series. Fort Belvoir, VA: Defense Technical Information Center, May 1990. http://dx.doi.org/10.21236/ada238214.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Krueger, Alan. The Determinants of Queues for Federal Jobs. Cambridge, MA: National Bureau of Economic Research, January 1988. http://dx.doi.org/10.3386/w2499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ephremides, A., and Rong-Zhu Zhu. Delay Analysis of Interacting Queues with an Approximate Model. Fort Belvoir, VA: Defense Technical Information Center, January 1986. http://dx.doi.org/10.21236/ada452458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Serfozo, R. F. Extreme Values of Queues, Point Processes and Stochastic Networks. Fort Belvoir, VA: Defense Technical Information Center, June 1985. http://dx.doi.org/10.21236/ada158619.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Serfozo, Richard F. Extreme Values of Birth and Death Processes and Queues,. Fort Belvoir, VA: Defense Technical Information Center, March 1986. http://dx.doi.org/10.21236/ada169932.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Serfozo, Richard F. Extreme Values of Queues, Point Processes and Stochastic Networks. Fort Belvoir, VA: Defense Technical Information Center, November 1985. http://dx.doi.org/10.21236/ada172013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Sung S., and Richard F. Serfozo. Optimal Idle and Inspection Periods for M/G/1 Queues,. Fort Belvoir, VA: Defense Technical Information Center, March 1986. http://dx.doi.org/10.21236/ada170110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rao, R., and A. Ephremides. On the Stability of Interacting Queues in a Multiple Access System. Fort Belvoir, VA: Defense Technical Information Center, January 1986. http://dx.doi.org/10.21236/ada444296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Queues' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography