SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Conditional response times in the M/G/1 processor-sharing system · Study

ArticleShelves

ArticleConditional response times in the M/G/1 processor-sharing system

Boampong Asare1983

Article1983

Conditional response times in the M/G/1 processor-sharing system

Boampong Asare · F. GORDON FOSTER

27 citations·0/0 files stored·Journal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Optimization and Search Problems Age of Information Optimization

Abstract

The expected response time of a job that requires processing time t and meets n jobs on arrival in the M/G/1 processor-sharing system is derived.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 27 citations exist upstream.

References

1961A Proof for the Queuing Formula: L = λ W 1967Time-shared Systems 1970Waiting Time Distributions for Processor-Sharing Systems 1957On Queues with Poisson Arrivals 1971An Analysis of the M/G/1 Queue Under Round-Robin Scheduling 1978A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates 1974Direct Solutions of M/G/1 Processor-Sharing Models

Cited by

2004Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing 2006Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue 2006The M/G/1 processor-sharing queue with disasters 1987Server sharing with a limited number of service positions and symmetric queues 2006The processor-sharing queue with bulk arrivals and phase-type services 1989A Functional Equation Arising in a Queue With a Gating Mechanism

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1982Performance evaluation studies for time-sharing computer systemsarticle · 4 shared references 2007Processor sharing: A survey of the mathematical theoryarticle · 3 shared references 2000Processor-sharing models for integrated-services networksthesis · 3 shared references 2003The equivalence between processor sharing and service in random orderarticle · 3 shared references 2006Sojourn time asymptotics in processor-sharing queuesarticle · 3 shared references 2003Elastic calls in an integrated services network: the greater the call size variability the better the QoSarticle · 3 shared references

Details

Year1983

Typearticle

Published1983-12-01

VenueJournal of Applied Probability

ISSN-L0021-9002

Languageen

Citations27

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.2307/3213604

openalex_workW2313622214

Links

Imported from OpenAlex (CC0) — nothing here is generated.