Results 1 to 10 of about 16,132 (297)
Beyond processor sharing [PDF]
While the (Egalitarian) Processor-Sharing (PS) discipline offers crucial insights in the performance of fair resource allocation mechanisms, it is inherently limited in analyzing and designing differentiated scheduling algorithms such as Weighted Fair Queueing and Weighted Round-Robin.
Samuli Aalto, Urtzi Ayesta, Sem Borst
exaly +4 more sources
Whittle indexability in egalitarian processor sharing systems [PDF]
27 pages, 6 ...
Vivek S Borkar +2 more
exaly +4 more sources
Throughput in Processor-Sharing Queues [PDF]
Processor-sharing queues are often used to model file transmission in networks. While sojourn time is a common performance metric in the queueing literature, average transmission rate is the more commonly discussed metric in the networking literature.
Chen, N, Jordan, S
openaire +4 more sources
Tool changing and tool sharing system for interconnected multi-material direct ink write 3D printers [PDF]
Direct ink write (DIW) is a material extrusion additive manufacturing technique where a flowable liquid or semi-solid ink is selectively deposited through a nozzle onto a build surface.
James P. Verheyden +9 more
doaj +2 more sources
Insensitivity in processor-sharing networks [PDF]
We consider an open network of processor-sharing nodes with state-dependent service capacities, i.e., the speed of each node may depend on the number of customers at any node. We demonstrate that the stationary distribution of the network state is insensitive to the distribution of service times if and only if the service capacities are balanced, i.e.,
T Bonald, A Proutiere
exaly +4 more sources
A retrial queueing system with processor sharing and impatient customers
Objectives. The problem of constructing and investigating a mathematical model of a stochastic system with processor sharing, repeated calls, and customer impatience is considered. This system is formalized in the form of a queueing system. The operation
V. I. Klimenok
doaj +1 more source
Shared processor scheduling [PDF]
We study the shared processor scheduling problem with a single shared processor where a unit time saving (weight) obtained by processing a job on the shared processor depends on the job. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an $O(n \log n)$
Dariusz Dereniowski, Wieslaw Kubiak
openaire +3 more sources
Word-serial unified and scalable semi-systolic processor for field multiplication and squaring
This paper exhibits a word-serial unified and scalable semi-systolic processor core for concurrently executing both multiplication and squaring operations over GF(2k).
Atef Ibrahim
doaj +1 more source
Separating arbitrary free-space beams with an integrated photonic processor
We show that a programmable photonic integrated processor can separate, directly in the optical domain, spatially-overlapped free-space optical beams with unknown shapes, sharing the same wavelength and polarization.
Maziyar Milanizadeh +10 more
doaj +1 more source
An Overview of the nMPRA and nHSE Microarchitectures for Real-Time Applications
In the context of real-time control systems, it has become possible to obtain temporal resolutions of microseconds due to the development of embedded systems and the Internet of Things (IoT), the optimization of the use of processor hardware, and the ...
Vasile Gheorghiță Găitan, Ionel Zagan
doaj +1 more source

