Sharing a Processor Among Many Job Classes
From MaRDI portal
Publication:3930626
DOI10.1145/322203.322212zbMath0475.68012OpenAlexW2056188756WikidataQ128985122 ScholiaQ128985122MaRDI QIDQ3930626
Guy Fayolle, Roudolf Iasnogorodski, Isi Mitrani
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322203.322212
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (36)
Large deviations problems for star networks: the min policy. ⋮ On bounds of response time performance achievable by multiclass single- server queues ⋮ Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ A solution for the \(M^ X/G/1\)-PS process response time ⋮ A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Bandwidth-sharing networks under a diffusion scaling ⋮ Monotonicity of the mean queue size in DPS systems ⋮ Processor-sharing queues: Some progress in analysis ⋮ Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ Monotonicity properties for multi-class queueing systems ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS ⋮ A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions ⋮ Processor sharing: a survey of the mathematical theory ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Batch processor sharing with hyper-exponential service time ⋮ Waiting times in queues with relative priorities ⋮ Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals ⋮ The use of relative priorities in optimizing the performance of a queueing system ⋮ A Hotelling queue model with probabilistic service ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ Relative priority policies for minimizing the cost of queueing systems with service discrimination ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ A survey on discriminatory processor sharing ⋮ A queueing analysis of max-min fairness, proportional fairness and balanced fairness ⋮ Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue ⋮ Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Sojourn times in (discrete) time shared systems and their continuous time limits ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Instability of sharing systems in the presence of retransmissions ⋮ The customer response times in the processor sharing queue are associated ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers ⋮ Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
This page was built for publication: Sharing a Processor Among Many Job Classes
