Time-Shared Computer Operations With Both Interarrival and Service Times Exponential
Journal of the ACM (JACM)
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Waiting times in a transport protocol entity scheduler
ACM SIGCOMM Computer Communication Review
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
A Note on Some Mathematical Models of Time-Sharing Systems
Journal of the ACM (JACM)
Analysis of Two Time-Sharing Queueing Models
Journal of the ACM (JACM)
Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System
Journal of the ACM (JACM)
Synthesis of a Feedback Queueing Discipline for Computer Operation
Journal of the ACM (JACM)
A Generalized Multi-Entrance Time-Sharing Priority Queue
Journal of the ACM (JACM)
Adaptive Allocation of Central Processing Unit Quanta
Journal of the ACM (JACM)
Multilevel Queues with Extremal Priorities
Journal of the ACM (JACM)
An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation
Journal of the ACM (JACM)
On Optimal Scheduling Algorithms for Time-Shared Systems
Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models
ACM Computing Surveys (CSUR)
A unifying approach to scheduling
Communications of the ACM
The effects of multiplexing on a computer-communications system
Communications of the ACM
An analysis of some time-sharing techniques
Communications of the ACM
Design considerations of statistical multiplexors
Proceedings of the first ACM symposium on Problems in the optimization of data communications systems
Models of Pure time-sharing disciplines for resource allocation
ACM '69 Proceedings of the 1969 24th national conference
Studies in Markov models of computer systems
ACM '75 Proceedings of the 1975 annual conference
The UTS time-sharing system: performance analysis and instrumentation
SOSP '69 Proceedings of the second symposium on Operating systems principles
Starvation-proof priority round-robin queues for time-sharing systems
Journal of Computing Sciences in Colleges
Swap-Time Considerations in Time-Shared Systems
IEEE Transactions on Computers
The Foreground-Background queue: A survey
Performance Evaluation
A study of asynchronous time division multiplexing for time-sharing computer systems
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Multiserver Queueing Models of Multiprocessing Systems
IEEE Transactions on Computers
Analysis of round-robin variants: favoring newly arrived jobs
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Hi-index | 0.06 |
Time-shared processing systems (e.g. communication or computer systems) are studied by considering priority disciplines operating in a stochastic queueing environment. Results are obtained for the average time spent in the system, conditioned on the length of required service (e.g. message lenght or number of computations). No chage is made for swap time, and the results hold only for Markov assumptions for the arrival and service processes.Two distinct feedback models with a single quantum-controlled service are considered. The first is a round-robin (RR) system in which the service facility processes each customer for a maximum of q sec. If the customer's service is completed during this quantum, he leaves the system; otherwise he returns to the end of the queue to await another quantum of service. The second is a feedback (FBN) system with N queues in which a new arrival joins the tail of the first queue. The server gives service to a customer from the nth queue only if all lower numbered queues are empty. When taken from the nth queue, a customer is given q sec of service. If this completes his processing requirement he leaves the system; otherwise he joins the tail of the (n + 1)-st queue (n = 1, 2, · · ·, N - 1). The limiting case of N → ∞ is also treated. Both models are therefore quantum-controlled, and involve feedback to the tail of some queue, thus providing rapid service for customers with short service-time requirements. The interesting limiting case in which q → 0 (a “processor-shared” model) is also examined. Comparison is made with the first-come-first-served system and also the shortest-job-first discipline. Finally the FB∞ system is generalized to include (priority) inputs at each of the queues in the system.