A Survey of Analytical Time-Sharing Models
Explore this paper's citation graph
Summary
The parameters which are considered in the different analytic models provide the system designer with a number of degrees of freedom with which to synthesize a t]me-shared processing system and point out needed research directions.
- Type
- review
- Published
- 1969-06-01
- Cited by
- 103
- References
- 21
- Access
- Open access
- OpenAlex
- https://openalex.org/W2080340258
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:14428010
Keywords
Citation, Computer science, World Wide Web, Operations research, Engineering
References
- Certain analytic results for time-shared processors
- Stochastic models of multiple and time-shared computer operations.
- Analysis of A time‐shared processor
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- The Queue M/G/1 With Feedback to Lower Priority Queues
- Time-Shared Computer Operations With Both Interarrival and Service Times Exponential
- Sequential Processing Machines (S.P.M) Analyzed With a Queuing Theory Model
- The Priority Problem and Computer Time Sharing
- A conservation law for a wide class of queueing disciplines
- Measures, models and measurements for time-shared computer utilities
- Some Mathematical Considerations of Time-Sharing Scheduling Algorithms
- Queues with Feedback for Time-Sharing Computer System Analysis
- Distribution of Attained Service in Time-Shared Systems
- Feedback Queueing Models for Time-Shared Systems
- Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping
- Computer scheduling methods and their countermeasures
- A Proof for the Queuing Formula: L = λW
- A Queuing Model for a Simple Case of Time Sharing
- Jobshop-Like Queueing Systems
- THE STATIONARY BEHAVIOR OF A TIME-SHARING SYSTEM UNDER POISSON ASSUMPTIONS.
Cited by
- Analytic Models for Computer System Performance Analysis (invited)
- M/G/1 round robin discipline
- Performance measurement and evaluation of time-shared operating systems
- A Survey of Techniques for Analyzing Memory Interference in Multiprocessor Computer Systems
- Starvation-proof priority round-robin queues for time-sharing systems
- The Foregound-Background Processor-Sharing Queue: a survey
- The Foreground-Background Queue
- A Generalized Multi-Entrance Time-Sharing Priority Queue
- A Note on Some Mathematical Models of Time-Sharing Systems
- Operating system performance
- Resource demanded paging and dispatching to optimize resource utilization in an operating system
- A multiple subsystem simulator of processor scheduling
- A Course of Study in Computer Hardware Architecture
- A Review of Classification Schemes for Computer Communication Networks
- The technology of computer center management: a proposed course for graduate professional programs in computer science or in information systems
- An analysis of page allocation strategies for multiprogramming systems with virtual memory
- Computer Communication Networks: Approaches, Objectives, and Performance Considerations
- Guidelines for the use of infinite source queueing models in the analysis of computer system performance
- Principles of computer system organization
- Computers and operations research: A survey
Related papers
- DETERMINING QUALITY REQUIREMENTS AT THE UNIVERSITIES TO IMPROVE THE QUALITY OF EDUCATION
- Using DataGrid Control to Realize DataBase of Querying in VB6.0
- Study and Two Types of Typical Usage of DataGrid Web Server Control
- Bidirectional Sort and Choosing a Row to Update or Delete by Click Any Cell in DataGrid
- Flexible Application of VSFlexGrid
- Personalization of e-Learning Services using Web Mining and Semantic Web
- The Future of Web Citation Practices
- Report on the workshop on reuse of Web-based information