The processor‐sharing queueing model for time‐shared systems with bulk arrivals

DOI10.1002/net.3230010103zbMath0256.60061OpenAlexW2058412536MaRDI QIDQ5671465

Richard R. Muntz, Leonard Kleinrock, Eugène Rodemich

Publication date: 1971

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230010103

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) General topics in the theory of software (68N01)

Related Items (15)

A solution for the \(M^ X/G/1\)-PS process response time ⋮ An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue ⋮ Sojourn times in a processor sharing queue with multiple vacations ⋮ Analysis of the M/G/1 processor-sharing queue with bulk arrivals ⋮ Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Batch processor sharing with hyper-exponential service time ⋮ Batch sojourn time in the processor sharing queue with geometric batch size ⋮ Sojourn time in a Processor Sharing queue with batch arrivals ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications ⋮ A survey on discriminatory processor sharing ⋮ Energy-performance trade-off for processor sharing queues with setup delay ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Batch arrival processor-sharing with application to multi-level processor-sharing scheduling

Cites Work

• Distribution of attained service in time-shared systems

This page was built for publication: The processor‐sharing queueing model for time‐shared systems with bulk arrivals