SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Multiple class memory constrained queueing networks
12 references·6 citing·32 second hop
Multiple class memory constrained queueing networks (1982)Multiple class memory constrained queuein…Linearizer (1982)LinearizerAnalyzing queueing networks with simultaneous resource possession (1982)Analyzing queueing networks w…Approximate Solution of Queueing Networks with Simultaneous Resource Possession (1981)Approximate Solution of Queue…Some Extensions to Multiclass Queueing Network Analysis (1979)Some Extensions to Multiclass…Approximate Methods for Analyzing Queueing Network Models of Computing Systems (1978)Approximate Methods for Analy…Queuing Networks with Population Size Constraints (1977)Queuing Networks with Populat…Memory management and response time (1977)Memory management and respons…Decomposability: Queueing and Computer System Applications (1977)Decomposability: Queueing and…Decomposability of Queueing Networks (1977)Decomposability of Queueing N…Parametric Analysis of Queuing Networks (1975)Parametric Analysis of Queuin…Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Open, Closed, and Mixed Netwo…A model of a time sharing virtual memory system solved using equivalence and decomposition methods (1974)A model of a time sharing vir…Analysis of a queueing network model with class dependent window flow control (1992)Analysis of a queueing networ…Multiclass queueing networks with population constrainted subnetworks (1985)Multiclass queueing networks …Response Time Preservation (1984)Response Time PreservationIncorporating load dependent servers in approximate mean value analysis (1984)Incorporating load dependent …Analysis of Queueing Network Models with population size constraints and delayed blocked customers (1984)Analysis of Queueing Network …Workload representations in queueing models of computer systems (1983)Workload representations in q…A Proof for the Queuing Formula: L = λ W (1961)Jobshop-Like Queueing Systems (1963)A Queueing Network Model of MVS (1978)Equivalence and decomposition in queueing systems—A unified approach (1985)Closed Queuing Systems with Exponential Servers (1967)The Operational Analysis of Queueing Network Models (1978)Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues (1984)A queueing network model for semiconductor manufacturing (1996)Queueing theory in manufacturing: A survey (1999)Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms (1975)Computational algorithms for product form queueing networks (1980)A tree convolution algorithm for the solution of queueing networks (1983)Erlang capacity and uniform approximations for shared unbuffered resources (1994)Jobshop-Like Queueing Systems (2004)Mean-Value Analysis of Closed Multichain Queuing Networks (1980)The Distribution of Queuing Network States at Input and Output Instants (1981)Chapter 5 Performance evaluation of production networks (1993)A generalization of Norton's theorem for queueing networks (1993)Stochastic complement analysis of multi-server threshold queues with hysteresis (1999)Analytic Queueing Models for Programs with Internal Concurrency (1983)Queueing Networks: A Survey of Their Random Processes (1985)The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues (1985)Approximate Analysis of General Queuing Networks (1975)JMT (2009)Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks (1981)Stochastic theory of a fluid model of producers and consumers coupled by a buffer (1988)Survey of closed queueing networks with blocking (1990)Queueing Networks With Blocking. (1987)Web server performance measurement and modeling techniques (1998)Two-level iterative queuing modeling of software contention (2003)Blocking in a Shared Resource Environment (1981)An introduction to queueing theory (1993)
this work references cited by second hop

References

  • 1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers2,411 cited
  • 1977Decomposability: Queueing and Computer System Applications479 cited
  • 1975Parametric Analysis of Queuing Networks331 cited
  • 1982Linearizer207 cited
  • 1978Approximate Methods for Analyzing Queueing Network Models of Computing Systems187 cited
  • 1979Some Extensions to Multiclass Queueing Network Analysis166 cited
  • 1977Queuing Networks with Population Size Constraints122 cited
  • 1982Analyzing queueing networks with simultaneous resource possession105 cited
  • 1977Decomposability of Queueing Networks59 cited
  • 1974A model of a time sharing virtual memory system solved using equivalence and decomposition methods54 cited
  • 1981Approximate Solution of Queueing Networks with Simultaneous Resource Possession49 cited
  • 1977Memory management and response time49 cited

Cited by

  • 1984Response Time Preservation28 cited
  • 1984Analysis of Queueing Network Models with population size constraints and delayed blocked customers21 cited
  • 1984Incorporating load dependent servers in approximate mean value analysis19 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

  • 1983Workload representations in queueing models of computer systems14 cited
  • 1992Analysis of a queueing network model with class dependent window flow control13 cited
  • 1985Multiclass queueing networks with population constrainted subnetworks13 cited