Results 21 to 30 of about 16,132 (297)
Adaptive load sharing for network processors [PDF]
A novel scheme for processing packets in a router is presented, which provides for load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming traffic is scheduled to multiple processors based on a deterministic mapping.
Lukas Kencl, Jean-Yves Le Boudec
openaire +2 more sources
Pricing for Heterogeneous Services at a Discriminatory Processor Sharing Queue [PDF]
In order to deal with applications with different quality of service requirements, service differentiation has to be implemented, especially in case of congestion.
Tuffin, Bruno, Hayel, Yezekael
core +2 more sources
An Inter-Processor Communication (IPC) Data Sharing Architecture in Heterogeneous MPSoC for OFDMA
Multiprocessor system-on-chip (MPSoC) promises better data management for parallel processing than conventional SoC. This feature is very suitable for wireless communication systems.
Trio Adiono +5 more
doaj +1 more source
Load balancing in processor sharing systems [PDF]
We investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a server-dependent holding cost per unit time. Specifically, we study (i) the centralized setting in which a dispatcher routes incoming jobs based on their service time requirements so as
Altman, Eitan +2 more
openaire +4 more sources
Error Detection Algorithm for Pure Software Signature Based on Table-driven [PDF]
For the presence of temporary,intermittent,and permanent errors,the processor capturing and executing an incorrect instruction will cause a control flow error to occur.This paper proposes a pure Error Detection of Software Signature(EDSS) algorithm based
CHEN Jian,SHEN Xiaojun,YAO Yiyang,XING Yafei,JU Xiaoming
doaj +1 more source
This paper compares two discrete-time single-server queueing models with two queues. In both models, the server is available to a queue with probability 1/2 at each service opportunity.
Arnaud Devos +3 more
doaj +1 more source
On a processor sharing queue that models balking [PDF]
We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to $n+1$, we obtain explicit expressions for a tagged customer's sojourn time distribution.
Qiang Zhen +2 more
openaire +4 more sources
Nash bargaining on a processor sharing queue
This paper presents an approach through the bargaining game theory on the capacity sharing in a queue with processor sharing discipline. It has a brief review of such a type of queue and the Nash bargaining solution.
RAVALIMINOARIMALALASON, Toky Basilide +2 more
core +1 more source
Poly-symmetry in processor-sharing systems [PDF]
We consider a system of processor-sharing queues with state-dependent service rates. These are allocated according to balanced fairness within a polymatroid capacity set. Balanced fairness is known to be both insensitive and Pareto-efficient in such systems, which ensures that the performance metrics, when computable, will provide robust insights into ...
Bonald, Thomas +3 more
openaire +3 more sources
SRX–Secure Data Backup and Recovery for SGX Applications
Intel SGX improves the security of applications by shielding code and data from untrusted software in enclaves. Since enclaves lose their state when closed, that state has to be sealed, i.e., cryptographically protected with a secret key, and stored ...
Daniel Andrade +2 more
doaj +1 more source

