Filters








14,670 Hits in 5.5 sec

Using Inter-Arrival Times For Scheduling In Non-Observable Queues

Mikhail Konovalov, Rostislav Razumchik
2017 ECMS 2017 Proceedings edited by Zita Zoltay Paprika, Péter Horák, Kata Váradi, Péter Tamás Zwierczyk, Ágnes Vidovics-Dancs, János Péter Rádics  
Here we deal with the well-known problem of scheduling in several non-observable parallel single server queues with single Poisson incoming flow, when the broker (scheduler) does not observe neither the  ...  In this paper we address the following question: can the deterministic policy be improved if the broker, in addition to decisions made, utilizes also the information about the lengths of time between the  ...  INTRODUCTION In this paper we consider the following well-known problem of scheduling in parallel non-observable queues.  ... 
doi:10.7148/2017-0667 dblp:conf/ecms/KonovalovR17 fatcat:poxawvo45vaddel5qzsbqv7emu

On optimal routing in overloaded parallel queues

Bin Li, Atilla Eryilmaz, R. Srikant, Leandros Tassiulas
2013 52nd IEEE Conference on Decision and Control  
Using this result for a singleserver queue, we obtain a lower bound on the expected unused service in the parallel queueing system for any feasible routing policy.  ...  We consider the problem of routing Bernoulli arrivals to parallel queues, where each queue provides service according to an independent Bernoulli process.  ...  Fig. 1 : 1 Routing to parallel queues. n [t] denotes the number of departures from queue n in slot t under policy π. Fig. 2: (a) Forward queue; (b) Reverse queue.  ... 
doi:10.1109/cdc.2013.6759892 dblp:conf/cdc/LiEST13 fatcat:lljiwpzte5dk3lylm4gro4y5uy

Optimal routing in parallel, non-observable queues and the price of anarchy revisited

Jonatha Anselmi, Bruno Gaujal
2010 2010 22nd International Teletraffic Congress (lTC 22)  
We consider a network of parallel, non-observable queues and analyze the "price of anarchy", an index measuring the worst-case performance loss of a decentralized system with respect to its centralized  ...  counterpart in presence of non-cooperative users.  ...  In this paper, we tackle the problem of analyzing the PoA in open queueing systems of parallel and non-observable queues.  ... 
doi:10.1109/itc.2010.5608745 dblp:conf/teletraffic/AnselmiG10 fatcat:qkf5kgkscng43idhnqu2sub2d4

A survey of Markov decision models for control of networks of queues

Shaler Stidham, Richard Weber
1993 Queueing systems  
We review models for the optimal control of networks of queues, Our main emphasis is on models based on Markov decision theory and the characterization of the structure of optimal control policies.  ...  queue before their size is observed.  ...  ROUTING TO PARALLEL SERVERS FROM A COMMON QUEUE In the routing-control models discussed so far, each server has its own queue, a customer upon arrival is routed to one of the queues, and thereafter no  ... 
doi:10.1007/bf01158935 fatcat:qofdwnkvirctlm5qkh635s743y

Allocation of flows in closed bipartite queueing networks

James D. Brooks, Koushik Kar, David J. Mendonça
2016 European Journal of Operational Research  
This paper describes a novel method for allocating agents to routes in a closed bipartite queueing network to maximize system throughput using three open network approximations.  ...  Average empirical optimality gaps of 1.29%, 1.13% and 1.29% are observed for the three approximations considered.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their insightful comments towards improving this work.  ... 
doi:10.1016/j.ejor.2016.05.017 fatcat:ymikpjdbxng7vpondpm6csjyye

Limited choice and locality considerations for load balancing

Yu-Tong He, Douglas G. Down
2008 Performance evaluation (Print)  
pooled with a single queue (in other words, no routing decision need be made).  ...  We consider the problem of routing Poisson arrivals to N parallel servers under the condition that the system is heavily loaded.  ...  This will require a non-uniform choice for the routing probabilities.  ... 
doi:10.1016/j.peva.2008.03.001 fatcat:ih6mwxwwrzbkpblce27mr2bcbm

Dynamic allocation of entities in closed queueing networks: An application to debris removal

James D. Brooks, Koushik Kar, David Mendonca
2013 2013 IEEE International Conference on Technologies for Homeland Security (HST)  
This work describes a novel method for allocating entities to routes in a closed queueing network to maximize system throughput.  ...  market context in inducing optimal behavior.  ...  RELATED WORK Much work has been done in the area of optimal design of queueing systems [4] . However, very little work in routing of entities in closed networks has been done.  ... 
doi:10.1109/ths.2013.6699055 fatcat:euspen5nbrch5l5hfxjrfinyvq

Optimal Routing of Fixed Size Jobs to Two Parallel Servers

Esa Hyytiä
2013 INFOR. Information systems and operational research  
However, the routing problems are non-trivial with heterogeneous service rates.  ...  In this paper, we consider a heterogeneous system of two parallel servers processing fixed size jobs.  ...  Righter and the anonymous reviewers for their valuable comments that greatly improved the manuscript.  ... 
doi:10.3138/infor.51.4.215 fatcat:tzvbzztigvbxredxxjajtl6wqy

Adaptive channel queue routing on k-ary n-cubes

Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
The only other algorithm that uses global congestion in its routing decision is the Globally Adaptive Load-Balance (GAL) algorithm introduced in [13].  ...  CQR gives much lower latency than GAL at loads where non-minimal routing is required. It adapts rapidly to changes in traffic, is unconditionally stable, and is simple to implement.  ...  queue occupancy. 5 Unlike GAL, CQR makes its routing decision using the channel queues as described in Section 3.  ... 
doi:10.1145/1007912.1007915 dblp:conf/spaa/SinghDGT04 fatcat:jhkjqsxwffdkldpyxbxjseooam

A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOW Environment

J. Duato, A. Robles, F. Silla, R. Beivide
2001 Journal of Parallel and Distributed Computing  
We also propose a fully adaptive routing algorithm for VCT switching in NOWs. Moreover, we show that VCT routers outperform wormhole routers in a NOW environment at a lower cost.  ...  In this paper, we show that VCT routers can be simpler than wormhole ones, while still achieving the advantages of using virtual channels and adaptive routing.  ...  We have observed that it is better to increase the number of queues instead of adding more buffers per queue.  ... 
doi:10.1006/jpdc.2000.1679 fatcat:2cq77nvohfcsbahyc2hj3dy6ya

Intelligent Routing Orchestration for Ultra-Low Latency Transport Networks

Qingmin Meng, Jingcheng Wei, Xiaoming Wang, Haiyan Guo
2020 IEEE Access  
By introducing a parallel neural network classifier, an intelligent route arrangement is implemented in this work.  ...  In this paper, an SDN with flexible architecture is considered and a transport component is proposed. The component based on mesh topology is an example of joint route prediction and forwarding.  ...  In Fig. 2(a) , the routing decision selects the routing path "r0-r1-r2-r5-r8".  ... 
doi:10.1109/access.2020.3008721 fatcat:wgktfdt5jnaf5muwkbc6yxplcy

Deterministic multi-core parallel routing for FPGAs

Marcel Gort, Jason H. Anderson
2010 2010 International Conference on Field-Programmable Technology  
In the fine-grained approach, the task of routing an individual load pin on a signal is parallelized using threads.  ...  We consider coarse and fine-grained techniques for parallel FPGA routing on modern multi-core processors.  ...  ACKNOWLEDGEMENTS The authors thank Scott Chin for suggesting that node expansion might be parallelized on a fine-grain level.  ... 
doi:10.1109/fpt.2010.5681758 dblp:conf/fpt/GortA10 fatcat:uw7lhwqu4na3vi2iiqjuik3rkm

Mobility and Network Selection in Heterogeneous Wireless Networks: User Approach and Implementation

Cristian Roman, Ruizhi Liao, Peter Ball, Shumao Ou
2016 Network Protocols and Algorithms  
The Intelligent Transport Systems (ITS) wireless infrastructure needs to support various safety and non-safety services for both autonomous and non-autonomous vehicles.The existing wireless infrastructures  ...  heterogeneous wireless networks.Three cases are considered based on the mobility in the city: walking, cycling, and driving.  ...  The 'Scheduler' is split in two sections and is described in detail in section 4.2 for the MISS algorithm and section 4.3 for the process related to the parallel transmission decisions.  ... 
doi:10.5296/npa.v8i2.9327 fatcat:k5sy7opr6nd5lpcesvknqw3gzu

Micro Load Balancing in Data Centers with DRILL

Soudeh Ghorbani, Brighten Godfrey, Yashar Ganjali, Amin Firoozshahian
2015 Proceedings of the 14th ACM Workshop on Hot Topics in Networks - HotNets-XIV  
We provide a very simple in-network load balancing scheduling algorithm called DRILL which is purely local to each switch.  ...  We observe 9.5× and 2.5× improvement compared to Presto and CONGA.  ...  The CDFs of flow completion times for all flows and for only mice flows are shown in Figure 3 . We also observe a significant improvement in incast scenarios common in data centers [7] .  ... 
doi:10.1145/2834050.2834107 dblp:conf/hotnets/GhorbaniGGF15 fatcat:kydxry773feszgdsnjhicl6nwm

Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive

Hyun-Soo Ahn, Mark E. Lewis
2013 Operations Research  
We consider the question of how routing and allocation can be coordinated to meet the challenge of demand variability in a parallel queueing system serving two types of customers.  ...  Our results show that in the super-additive case jobs should never be routed away from the lower cost queue.  ...  Conclusions In this paper we consider joint routing and allocation policies in a two station parallel queueing network.  ... 
doi:10.1287/opre.1120.1157 fatcat:wrbjq52etjdaneqonqd7wbxsiy
« Previous Showing results 1 — 15 out of 14,670 results