Open Access
Queueing network models for parallel processing of task systems: an operational approach
Victor W. K. Mak
- 01 Sep 1986
TL;DR: A computationally efficient approximate solution method is developed to compute the performance measures for series-parallel-reducible task systems using queueing network models.
read more
Abstract: Computer performance modeling of possibly complex computations running on highly concurrent systems is considered. Earlier works in this area either dealt with a very simple program structure or resulted in methods with exponential complexity. A computationally efficient approximate solution method is developed to compute the performance measures for series-parallel-reducible task systems using queueing network models. Numerical results for a number of test cases are presented and compared to those of simulations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analytic Queueing Network Models for Parallel Processing of Task Systems
TL;DR: An efficient algorithm to determine the mean completion time and related performance measures for a task system: a set of tasks with precedence relationships in their execution sequence, such that the resulting graph is acyclic.
119
Performance of multi-level client-server systems with parallel service operations
Greg Franks,Murray Woodside +1 more
- 01 Oct 1998
TL;DR: The new approximation may moderate a concluszon made by Heidelberger and Trivedi, that decomposition gives greatly superior accuracy to the much cheaper complementary delay approach; these delay approximations are only a little less accurate.
44
Design of testbed and emulation tools
Stephen F. Lundstrom,Michael J. Flynn +1 more
- 01 Sep 1986
TL;DR: The research summarized in this report was concerned with the design of testbed and emulation tools suitable to assist in projecting, with reasonable accuracy, the expected performance of highly concurrent computing systems on large, complete applications.
Hierarchical Analyses Applied to Computer System Performance: Review and Call for Further Studies
TL;DR: This review applies hierarchical analysis to computer system performance, reducing evaluation cost by an order of magnitude, and proposes extensions to hybrid simulation methods for more accurate modeling of task service demands and job service times.
References
Mean-Value Analysis of Closed Multichain Queuing Networks
TL;DR: It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product terms and normalization constants.
1.2K
CSIM: a C-based process-oriented simulation language
Herb Schwetman
- 01 Dec 1986
TL;DR: A number of additional features dealing with modeling system resources, message passing, data collection and debugging which ease the task of building simulation models are added to CSIM.
280
Analytic Queueing Models for Programs with Internal Concurrency
Heidelberger,Trivedi +1 more
TL;DR: In this paper, the authors considered analytical queueing models of programs with internal concurrency and developed two approximate solution methods for the performance prediction of such systems. But the results of the approximations are compared to those of simulations.
159
Analytic Queueing Network Models for Parallel Processing of Task Systems
TL;DR: An efficient algorithm to determine the mean completion time and related performance measures for a task system: a set of tasks with precedence relationships in their execution sequence, such that the resulting graph is acyclic.
119