Workgreen1994

Queueing-theoretic solution methods for models of parallel and distributed systems

57 citations0/0 files storedCentrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands

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 Parallel Computing and Optimization Techniques Distributed and Parallel Computing Systems

Abstract

This paper aims to give an overview of solution methods for the performance analysis of parallel and distributed systems. After a brief review of some important general solution methods, we discuss key models of parallel and distributed systems, and optimization issues, from the viewpoint of solution methodology. The QMIPS Project: The QMIPS project is a collaborative research project supported by the CEC as ESPRITBRA project no 7269. It is being carried out by the following organisations: CWI (Amsterdam), EHEI (University of Paris V), Imperial College (London), INRIA (Sophia-Antipolis), University of Erlangen, University of Newcastle, University of Torino and University of Zaragoza. 1 Introduction The purpose of this paper is to present a survey of queueing theoretic methods for the quantitative modeling and analysis of parallel and distributed systems. We discuss a number of queueing models that can be viewed as key models for the performance analysis and optimization of parallel ...

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 — 57 citations exist upstream.

References

1984Matrix-Geometric Solutions to Stochastic Models 1986Comparison Methods for Queues and Other Stochastic Models.1983The Single Server Queue 1994Stability, queue length, and delay of deterministic and stochastic queueing networks 1990An Introduction to Queueing Networks 1991Product-form queueing networks with negative and positive customers 1977Optimality of the shortest line discipline 1995Large deviations and overflow probabilities for the general single-server queue, with applications

Cited by

2006An M/M/2 parallel system model with pure space sharing among rigid jobs 2016Stochastic bounds in Fork–Join queueing systems under full and partial mapping 2015Computable Bounds in Fork-Join Queueing Systems 2012A hybrid approach to minimize state space explosion problem for the solution of two stage tandem queues 2012Control of Fork-Join Networks in heavy traffic 2015Data-Driven Performance Analysis of Scheduled Processes

Explore the map →

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

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