A TIME-SHARING MODEL WITH MANY QUEUES

Abstract

The paper presents a mathematical study of a time-sharing system with a single server and many queues. In each queue a customer receives one quantum of service and is then sent to the end of the next queue, provided his service demand has not been completely satisfied. When a quantum of service is completed the server attends to the first customer in the lowest index non-empty queue. The discipline of the highest indexed queue is 'round-robin,' while all other queues obey the FIFO rule. Newly arrived customers join the end of the first queue. Mathematical expressions for the main performance measures are derived and illustrated by graphical means.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1968
Accession Number
AD0682953

Entities

People

  • B. Avi-itzhak
  • I. Adiri

Organizations

  • Technion – Israel Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Batch Processing
  • Buildings And Structures
  • Data Science
  • Engineering
  • Intensity
  • Linear Programming
  • Mathematical Models
  • Military Research
  • Models
  • Probability
  • Random Variables
  • Regression Analysis
  • Sequences
  • Statistics
  • Steady State

Readers

  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design

Technology Areas

  • Quantum Computing