Analytic modeling of interactive systems

Muntz, Richard R.

doi:10.1109/proc.1975.9859

Cited by 31 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Bryant [B] assumes that the job loading policy is FCFL. There are many other papers concerning analytical modeling of the simultaneous use of processors and memory ([l], [4], [5], [6], [12], [13], [17], [18], [22], [26]). However, they have focused on other important aspects of the computer systems than those considered here.…”

Section: Other Related Workmentioning

confidence: 99%

Effects of job loading policies for multiprogramming systems in processing a job stream

Kameda

1986

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

The scheduling of jobs for multiprogramming systems includes the selection of jobs to be loaded into memory (job loading policy or memory schedule) and the scheduling for CPU processing (CPU schedule). There has been a successful empirical claim for the optimal CPU schedule; its optimality has been proved in a Markovian model of job-stream processing that uses the first-come-first-loaded (FCFL) job loading policy. We extend this model to gain insight into the effects of job loading policies.The model studied consists of an input stream of jobs of two classes and a multiple-resource system (the model of a multiprogramming system) with a stack for waiting jobs. The system consists of a finite amount of memory and a cyclic queue of a single (CPU) server station and a multiple (I/O) server station. The values of parameters describing each class of jobs are distinct except the mean I/O service time and the amount of memory required. The estimate of the maximum processing capacity (throughput bound) of the system is obtained and is shown to be achieved by the combination of the empirically claimed optimal CPU schedule and a job loading policy whereby the set of jobs in memory is kept to be (nearly) balanced with respect to the job stream. Furthermore, we show that the job loading policies independent of the system status have no improvement over the FCFL policy.Our investigation, supported by numerical calculations, suggests that much more care may be needed in implementing the job loading policy that aims at the optimal processing capacity than in implementing the optimal CPU schedule. This agrees with what has been conjectured on the basis of empirical studies.

show abstract

Section: Other Related Workmentioning

confidence: 99%

Effects of job loading policies for multiprogramming systems in processing a job stream

Kameda

1986

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…Buzen first used these models to study the throughput of batch systems [Munt75]. ' " ',' ..................…”

Section: -mentioning

confidence: 99%

“…In 1972, this same model was applied by Lassettre and Scherr in the design of IBM's Time Sharing Option (TSO) with a single partition [Munt75].…”

mentioning

confidence: 99%

Software Support for Fully Distributed/Loosely Coupled Processing Systems. Volume 2. Appendix-Selected Papers.

Enslow¹,

Livesey²,

LeBlanc³

et al. 1984

View full text Add to dashboard Cite

SOFTWJARE SUPPORT FOR FULLY DISTRIBUTED/LOOSELY COUPLED 1/3 PROCESSING SYSTENS-(U) GEORGIA INST OF TECH ATLANTA SCHOOL OF INFORMATION AND COMPUT. P H ENSLOJ ET AL. UNCLASSIFIED JAN 84 GIT-ICS-82/16-YOL-2 F/G 9/2 N This report has been reviewed by the RADC Public Affairs Office (PA) and is releasable to the National Technical Information Service (NTIS)• At NTIS it will be releasable to the .;eneral public, including foreign nations. RADC-TR-83-238, Vol II (of two) has been reviewed and is approved for 0 publication.

show abstract

“…Finite polulation queing model Η εφαρμογή αυτή είναι από τις πλέον τυπικές όσον αφορά τα μοντέλα ουρών, ανήκει στην κατηγορία των κλειστών μοντέλων[15,37,53], και απεικο νίζεται στο σχήμα 7.6. Το σύστημα αυτό αποτελείται από έναν πεπερασμένο αριθμό μονάδων.…”

unclassified

Αναλυση Και Σχεδιασμος Του Πυρηνα Του Λειτουργικου Συστηματος Της Πολυεπεξεργαστικης Μηχανης Simula

Παπασπυροπουλοσ¹

View full text Add to dashboard Cite

Εισαγωγή 1 1.1. To γενικό πρόβλημα της παράλληλης εξομοίωσης 1 1.2. Κριτική ανασκόπηση αλγορίθμων και αρχιτεκτονικών για παράλληλη εξομοίωση διακριτών γεγονότων 3 1.3. Περιεχόμενο Διατριβής 9 1.4. Βασικές έννοιες 12 1.4.1. Συστήματα και πρότυπα 12 1.4.2. Μέθοδοι επίλυσης προτύπων 1.4.3. Εξομοίωση 1.5. Εξομοίωση και συστήματα εξομοίωσης 1.5.1. Η εξομοίωση διακριτών γεγονότων 1.5.2. Η εξομοίωση στο επίπεδο ανάλυσης 17 1.5.3. Η εξομοίωση στο επίπεδο υλοποίησης Κεφάλαιο 2: Η Simula και η εξομοίωση διακριτών γεγονότων 2.1. Οι γλωσσικές δομές 2.1.1. Οι έννοιες block και block instance 2.1.2. Οι έννοιες class και class object 27 2.1.2.1. Δημιουργία objects και μεταβλητές αναφοράς 2.

show abstract

Analytic modeling of interactive systems

Cited by 31 publications

References 32 publications

Effects of job loading policies for multiprogramming systems in processing a job stream

Effects of job loading policies for multiprogramming systems in processing a job stream

Software Support for Fully Distributed/Loosely Coupled Processing Systems. Volume 2. Appendix-Selected Papers.

Αναλυση Και Σχεδιασμος Του Πυρηνα Του Λειτουργικου Συστηματος Της Πολυεπεξεργαστικης Μηχανης Simula

Contact Info

Product

Resources

About