Analysis of a Multi-Server, Finite Length Queue with Feedback.

Abstract

This memo contains a performance analysis of a queueing model that arose in conjunction with a multi-microprocessor system with queue memories. The model consists of s-parallel processors fed by a common queue. Arriving tasks enter service immediately if a processor is available, or join a queue to wait for a processor, or become lost if the finite capacity queue is full. A completed task may leave the system or, with some probability, spawn another task which then goes to the end of the queue. The arrival stream is assumed Poisson and the service times are exponentially distributed. This memo also contains curves of mean waiting time, fraction of lost tasks, fraction of time system is busy and mean busy period versus traffic intensity. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1977
Accession Number
ADA045457

Entities

People

  • G. Arabadjis

Organizations

  • General Electric

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Classification
  • Data Centers
  • Difference Equations
  • Equations
  • Feedback
  • Fish
  • Flow Rate
  • Governments
  • Information Processing
  • Information Systems
  • Intensity
  • Markov Processes
  • New York
  • Parallel Processors
  • Probability
  • Random Variables
  • Throughput

Readers

  • Business Analytics
  • Mathematical Modeling and Probability Theory.