Results 141 to 150 of about 17,203,757 (202)

Latency and energy-aware adaptive service migration in mobile edge computing. [PDF]

Sci Rep
Li L, Lv J, Wang S, Hu C, Sun G, Li N.
europepmc   +1 more source

BSxCuBE-Web - a web application for bioSAXS high-throughput collection and experimental control. [PDF]

J Synchrotron Radiat
Florial JB, Oscarsson M, Beteva A, Fisher S, Kieffer J, Calio A, Fisher H, Brennich M, Moussaoui D, Popov A, Soler-Lopez M, Pernot P, Tully MD, McCarthy AA.   +13 more
europepmc   +1 more source

BBR-n+ congestion control: Real-time performance with smart exit and advanced AQMs. [PDF]

PLoS One
Ahsan M, Hussain M.
europepmc   +1 more source

Application of Smart Sensors in Commodity Management. [PDF]

Sensors (Basel)
Chung CK, Chung MY, Sung GM.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Loading Parameter for a Queuing System

Journal of Mathematical Sciences, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Soloviev, I. A., Zeifman, A. I.
openaire   +4 more sources

Study on Queuing System Optimization of Bank Based on BPR [PDF]

Procedia Environmental Sciences, 2011
This paper focuses on improving the queuing system of bank based on BPR. Firstly, the bottleneck problems of bank queuing is analyzed as well as the concept, classification and methodologies of BPR (business process reengineering).
Tong Yifei
exaly   +2 more sources

The Price of Anarchy of Strategic Queuing Systems

Journal of the ACM, 2023
Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish behavior of the participants, has been an important area of research in algorithmic game theory. Classical work on such bounds in repeated games makes the strong assumption that the subsequent rounds of the repeated games are independent beyond any influence on ...
Jason Gaitonde, Éva Tardos
openaire   +2 more sources

The Output of Multiserver Queuing Systems

Operations Research, 1978
We derive a recurrence relation for ξn, the time until the nth departure measured from T0, any well-defined instant in time. While the recurrence, valid for the G/G/s queue, is generally not easy to work with, in certain cases we can use it to obtain the distribution and moments of ξn.
openaire   +1 more source

Fair Queuing Memory Systems

2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06), 2006
We propose and evaluate a multi-thread memory scheduler that targets high performance CMPs. The proposed memory scheduler is based on concepts originally developed for network fair queuing scheduling algorithms. The memory scheduler is fair and provides Quality of Service (QoS) while improving system performance.
Kyle J. Nesbit, Nidhi Aggarwal, James Laudon, James E. Smith 0001   +3 more
openaire   +2 more sources

Closed Queuing Systems with Exponential Servers

Operations Research, 1967
The results contained herein pertain to the problem of determining the equilibrium distribution of customers in closed queuing systems composed of M interconnected stages of service. The number of customers, N, in a closed queuing system is fixed since customers pass repeatedly through the M stages with neither entrances nor exits permitted.
William J. Gordon, Gordon F. Newell
openaire   +1 more source