Analysis of A time‐shared processor
From MaRDI portal
Publication:5338473
DOI10.1002/nav.3800110105zbMath0129.30902OpenAlexW1965836809MaRDI QIDQ5338473
Publication date: 1964
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800110105
Related Items (28)
Markov chain analyses of multiprogrammed computer systems ⋮ On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ A mathematical model to estimate average response time of parallel programs ⋮ Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ On a processor sharing queue that models balking ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions ⋮ The equivalence between processor sharing and service in random order. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten ⋮ Optimal resource allocation for multiqueue systems with a shared server pool ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ Networks of queues in discrete time ⋮ Queueing theory ⋮ Some aspects of queueing theory ⋮ Unnamed Item ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ M/G/1 round robin discipline ⋮ Distribution of attained service in time-shared systems ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ The \(M/G/1\) retrial queue with the server subject to starting failures
This page was built for publication: Analysis of A time‐shared processor
