Time-shared Systems
From MaRDI portal
Publication:5560728
Cited in
(56)- Processor sharing: a survey of the mathematical theory
- Waiting times for \(M/M\) systems under state-dependent processor sharing
- The \(M/G/1\) retrial queue with the server subject to starting failures
- A cost-equation analysis of general-input general-service processor sharing system
- Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
- The equivalence between processor sharing and service in random order.
- The \(M/G/1\) processor-sharing queue with disasters
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- Queueing with priorities and standard service: stoppable and unstoppable servers
- Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing
- A scaling analysis of a star network with logarithmic weights
- Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals
- Queuing system with processor sharing and limited resources
- Conditional sojourn times of processor-sharing queues
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- A decomposition theorem and related results for the discriminatory processor sharing queue
- Bandwidth-sharing networks under a diffusion scaling
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Sojourn time analysis for processor sharing loss queuing system with service interruptions and MAP arrivals
- Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers
- Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
- On sojourn times in M/GI systems under state-dependent processor sharing
- Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
- Distribution of attained service in time-shared systems
- Decentralized proportional load balancing
- A mathematical model to estimate average response time of parallel programs
- Sojourn time in an \(\mathrm{M}/\mathrm{M}/1\) processor sharing queue with permanent customers
- Instability of sharing systems in the presence of retransmissions
- Monotonicity properties for multi-class queueing systems
- Mean sojourn times for phase-type discriminatory processor sharing systems
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- On the sojourn of an arbitrary customer in an \(M/M/1\) processor sharing queue
- ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- Mathematical problems in the theory of processor-sharing queueing systems
- Networks of queues in discrete time
- Sistemi a partizione-di-tempo: Sviluppo teorico di un algoritmo di servizio con priorita
- Flow-level convergence and insensitivity for multi-class queueing networks
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- A SURVEY OF THE EVOLUTION OF QUEUEING THEORY
- Assigning agents to a line
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
- Discriminatory Processor Sharing Queues and the DREB Method
- Resource pooling in congested networks: Proportional fairness and product form
- Analysis of the M/G/1 processor-sharing queue with bulk arrivals
- Biased Processor Sharing in Fork-Join Queues
- A survey on discriminatory processor sharing
- Sojourn time asymptotics in processor-sharing queues
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Processor-shared service systems with queue-dependent processors
- Sojourn time analysis for processor sharing loss system with unreliable server
- Markov chain analyses of multiprogrammed computer systems
- Whittle indexability in egalitarian processor sharing systems
- On the heterogeneous machine interference with limited server's availability
This page was built for publication: Time-shared Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560728)
