Time-shared Systems
From MaRDI portal
Publication:5560728
DOI10.1145/321386.321388zbMath0173.20001OpenAlexW1987334646WikidataQ56573817 ScholiaQ56573817MaRDI QIDQ5560728
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321386.321388
Related Items (56)
Queueing with priorities and standard service: Stoppable and unstoppable servers ⋮ Markov chain analyses of multiprogrammed computer systems ⋮ On the heterogeneous machine interference with limited server's availability ⋮ Processor-shared service systems with queue-dependent processors ⋮ Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Bandwidth-sharing networks under a diffusion scaling ⋮ A mathematical model to estimate average response time of parallel programs ⋮ Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals ⋮ Sojourn Time Analysis for Processor Sharing Loss System with Unreliable Server ⋮ Monotonicity properties for multi-class queueing systems ⋮ Queuing system with processor sharing and limited resources ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS ⋮ Biased Processor Sharing in Fork-Join Queues ⋮ Analysis of the M/G/1 processor-sharing queue with bulk arrivals ⋮ The equivalence between processor sharing and service in random order. ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Assigning agents to a line ⋮ Sojourn time in an M/M/1 processor sharing queue with permanent customers ⋮ Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ A scaling analysis of a star network with logarithmic weights ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ Networks of queues in discrete time ⋮ CONDITIONAL SOJOURN TIMES OF PROCESSOR-SHARING QUEUES ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ 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 ⋮ A survey on discriminatory processor sharing ⋮ Resource pooling in congested networks: Proportional fairness and product form ⋮ Decentralized Proportional Load Balancing ⋮ Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Instability of sharing systems in the presence of retransmissions ⋮ Distribution of attained service in time-shared systems ⋮ Sistemi a partizione-di-tempo: Sviluppo teorico di un algoritmo di servizio con priorita ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ Flow level convergence and insensitivity for multi-class queueing networks ⋮ On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers ⋮ Whittle indexability in egalitarian processor sharing systems ⋮ A SURVEY OF THE EVOLUTION OF QUEUEING THEORY ⋮ Asymptotic analysis of a large closed queueing network with discriminatory processor sharing ⋮ The \(M/G/1\) retrial queue with the server subject to starting failures
This page was built for publication: Time-shared Systems
