Results 261 to 270 of about 16,132 (297)
Some of the next articles are maybe not open access.

Processor-shared buffers with reneging

Performance Evaluation, 1994
Summary: Motivated by buffer design questions in data networks, we consider a processor shared queue with finite buffer capacity and reneging. Reneging models events such as the timing-out of a communication path due to excessive delays, or decisions to preempt a path in order to re-route it according to some congestion control mechanism.
Edward G. Coffman Jr.   +3 more
openaire   +1 more source

Redundancy with Processor Sharing servers

ACM SIGMETRICS Performance Evaluation Review, 2019
The main motivation to investigate redundancy models comes from empirical evidence suggesting that redundancy can help improve the performance of real-world applications. Under redundancy, a job that arrives to this system is dispatched to d servers uniformly chosen at random in order to benefit from the variability of the length of these queues.
Elene Anton   +3 more
openaire   +1 more source

Processor-shared service systems with queue-dependent processors

Computers & Operations Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Madhu Jain 0001   +2 more
openaire   +1 more source

Processor-Shared Time-Sharing Models in Heavy Traffic

SIAM Journal on Computing, 1986
Probability models are presented to computer systems with processor- shared (time-sliced) service discipline. The response (sojourn) time of an arriving job that requires T units of processing time is shown to be approximately Gaussian/normal under moderately heavy traffic conditions, e.g. when the number of terminals is large.
Donald P. Gaver, Patricia A. Jacobs
openaire   +1 more source

Pricing schemes in processor sharing systems

Telecommunication Systems, 2015
In this paper we study charging schemes for bandwidth or server usage under the processor sharing discipline. Specifically, we analyze post-payment and pre-payment (or payment on arrival) schemes in three charging frameworks: fixed-rate charging, Vickrey---Clarke---Groves based charging, and congestion based charging for users with logarithmic ...
Sharad Birmiwal   +2 more
openaire   +1 more source

Duration specifications for shared processors

1992
We present a specification oriented real-time semantics for real-time programs consisting of communicating sequential processes running on a shared processor configuration. The semantics, which is given in Duration Calculus [7], separates properties of a (compiled) program from properties attributable to a scheduling strategy.
Zhou Chaochen   +3 more
openaire   +1 more source

Predictable revenue under processor sharing

2012 46th Annual Conference on Information Sciences and Systems (CISS), 2012
This paper considers the case of a single service provider employing processor sharing discipline and serving randomly arriving users with random service requirements. The operator is assumed to charge a user based on the service rate allocated. The pricing mechanisms considered in this paper are the fixed rate pricing, Vickrey-Clarke-Groves (VCG ...
Sharad Birmiwal   +2 more
openaire   +1 more source

A discrete shared processor model for DQDB

Computer Networks and ISDN Systems, 1990
Abstract The Distributed Queue Dual Bus (DQDB) protocol is being considered by the IEEE 802.6 and ANSI T1S1.1 as an important component in their Metropolitan Area Networks (MAN) and Broadband ISDN User Network Interface (BISDN-UNI) standards respectively.
Philip G. Potter, Moshe Zukerman
openaire   +1 more source

Fluid approximations for a processor-sharing queue

Queueing Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong Chen 0012   +2 more
openaire   +2 more sources

Analysis of A time‐shared processor

Naval Research Logistics Quarterly, 1964
AbstractThis paper analyzes a queueing structure for a time‐shared service facility (or processor) and compares these results with a straightforward first‐come first‐served discipline. The assumption is that the processing time for each job is chosen from a geometric distribution.
openaire   +2 more sources

Home - About - Disclaimer - Privacy