ACM DL

Modeling and Computer Simulation (TOMACS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Modeling and Computer Simulation (TOMACS), Volume 8 Issue 3, July 1998

Towards a polynomial-time randomized algorithm for closed product-form networks
Wu-Lin Chen, Colm Art O'Cinneide
Pages: 227-253
DOI: 10.1145/290274.290277
We present a Markov chain Monte Carlo method for class throughputs in closed multiclass product-form networks. The method is as follows. For a given network, we construct a “regularized” network with a highly simplified structure...

A rejection technique for sampling from log-concave multivariate distributions
Josef Leydold
Pages: 254-280
DOI: 10.1145/290274.290287
Different universal methods (also called automatic or black-box methods) have been suggested for sampling form univariate log-concave distributions. The descriptioon of a suitable universal generator for multivariate distributions in arbitrary...

A denotational semantics for a process-based simulation language
Chris Tofts, Graham Birtwistle
Pages: 281-305
DOI: 10.1145/290274.290303
In this article, we present semantic translations for the actions of &mgr;Demos, a proocess-based, discrete event simulation language. Our formal translation schema permits the automatic construction of a process algebraic representatioon of the...

Automatic modeling of file system workloads using two-level arrival processes
Peter P. Ware, Thomas W. Page, Jr., Barry L. Nelson
Pages: 305-330
DOI: 10.1145/290274.290317
This article describes a method for analyzing, modeling, and simulating a two-level arrival-counting process. This method is particlarly appropriate when the number of independent processes is large, as is the case in our motivating application...