In the context of discrete event simulation, the marking of a stochastic Petri net (SPN) corresponds to the state of the underlying stochastic process of the simulation and the firing of a transition corresponds to the occurrence of an event. A study is made of the modeling power of SPNs with timed and immediate transitions, showing that such Petri nets provide a general framework for simulation. The principle result is that for any (finite or) countable state GSMP (generalized semi-Markov process) there exists an SPN having a marking process that mimics the GSMP in the sense that the two processes (and their underlying general state-space Markov chains) have the same finite dimensional distributions.>

This paper considers access control for local area computer communication networks. We propose two distributed access control schemes for a bus network. The schemes are simple and asynchronous, and provide for collision-free communication among ports. In addition, one of the schemes provides a bounded, guaranteed time to transmisidon for each port. We also show that this scheme is efficient in the use of the bus bandwidth, in the sense that there is only a small fraction of time during which the bus is idle when there is at least one packet available for transmission.

This paper provides an analysis of the performance of an access control scheme recently proposed by Eswaran, Hamacher, and Shedler for a local bus network. The control scheme is simple and asynchronous, and provides for collision-free communication among ports of the network. It is also efficient in the use of the bus bandwidth, in the sense that there is only a small fraction of time during which the bus is idle when there is at least one packet available for transmission. The performance analysis emphasizes the characteristics of bus access response times at the individual ports.

A technique ~s presented for the estmaatton by simulation of response time characteristics of queuemg network models of multlprogrammed computer systems The techmque is based on the regenerative method for the simulation of stochastic systems and the ~dea of trackmg a marked job m the network Illustrative numencal results m part obtained from a simulation of a queuemg model of a database management system are reported KEY WORDS AND PHRASES, queuemg

Closed queuing networks arise naturally as models of multiprogrammed computer systems and subsystems. Techniques for the efficient simulation of such models can be obtained from analytical results on the stochastic structure of the queuing networks. In this paper, confidence intervals are derived for a class of new work rate estimators in a closed queuing network. Numerical results are given which demonstrate that a substantial reduction in the length of confidence intervals is obtainable by use of the proposed estimators.

This paper presents results of an approximation study of cyclic queueing phenomena that occur in multiprogrammed computer systems. Based on Wald’s identity and using ideas of diffusion, the objective is to develop convenient and nearly explicit formulas relating processor utilization in such systems to simple program parameters and the level of multiprogramming. Some numerical results to indicate the quality of the proposed approximation are given.

A probabilistic model is presented of program material in a paging machine. The sequences of page references in the model are associated with certain sequences of LRU stack distances and have reference patterns formalizing a notion of “locality” of reference. Values for parameters of the model can be chosen to make the page-exception characteristics of the generated sequences of page references consistent with those of actual program traces. The statistical properties of the execution intervals (times between page-exception) for sequences of references in the model are derived, and an application of these results is made to a queuing analysis of a simple multiprogrammed paging system. Some numerical results pertaining to the program model and the queuing analysis are given.

article Free Access Share on A Cyclic-Queue Model of System Overhead in Multiprogrammed Computer Systems Authors: P. A. W. Lewis IBM Thomas J. Watson Research Center, Yorktown Heights, New York and Imperial College, University of London IBM Thomas J. Watson Research Center, Yorktown Heights, New York and Imperial College, University of LondonView Profile , G. S. Shedler IBM Research Center, San Jose, California IBM Research Center, San Jose, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 18Issue 2April 1971 pp 199–220https://doi.org/10.1145/321637.321642Published:01 April 1971Publication History 33citation784DownloadsMetricsTotal Citations33Total Downloads784Last 12 Months11Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF