Optimal queue-size scaling in switched networks
نویسندگان
چکیده
منابع مشابه
On Queue-Size Scaling for Input-Queued Switches
We study the optimal scaling of the expected total queue size in an n×n input-queued switch, as a function of the number of ports n and the load factor ρ, which has been conjectured to be Θ(n/(1−ρ)) (cf. [15]). In a recent work [16], the validity of this conjecture has been established for the regime where 1 − ρ = O(1/n). In this paper, we make further progress in the direction of this conjectu...
متن کاملPower Scaling in Port-Hamiltonian Telemanipulation over Packet Switched Networks
Passivity is a very suitable tool to stabilize a telemanipulator; in fact, implementing each part of a telerobotic system as a passive system and interconnecting them in a power preserving way it is possible to achieve an intrinsically passive system which is consequently characterized by a stable behavior. In [1] scattering theory has been exploited to build a communication channel that is pas...
متن کاملFinite Size Scaling in Neural Networks
We demonstrate that the fraction of pattern sets that can be stored in singleand hidden-layer perceptrons exhibits finite size scaling. This feature allows one to estimate the critical storage capacity ac from simulations of relatively small systems. We illustrate this approach by determining ac , together with the finite size scaling exponent n, for storing Gaussian patterns in committee and p...
متن کاملSize and Scaling in Ideal Polymer Networks
The scattering function and radius of gyration of an ideal polymer network are calculated depending on the strength of the bonds that form the crosslinks. Our calculations are based on an exact theorem for the characteristic function of a polydisperse phantom network that allows for treating the crosslinks between pairs of randomly selected monomers as quenched variables without resorting to re...
متن کاملScaling Load-Store Queue
In order to tolerate long latency instructions, large load and store queue is necessary to bypass in flight information to dependent instruction; but as the latency goes up, the size of the load and store queue will increase as well, which will impact cycle time, area and power. Hierarchical designs in [2] and [10] was proposed to alleviate cycle time problem, but the CAM and search functions r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2012
ISSN: 0163-5999
DOI: 10.1145/2318857.2254762