• Home
  • Search
  • Work-Scheduling Algorithms: A Nonprobabilistic Queuing Study (with Possible Application to No. 1 ESS)
  • Cite Icon14
  • https://doi.org/10.1002/j.1538-7305.1969.tb01200.xCopy DOI Icon

Work-Scheduling Algorithms: A Nonprobabilistic Queuing Study (with Possible Application to No. 1 ESS)

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In many large computer systems with real-time use (such as the No. 1 Electronic Switching System), the central processing unit handles much of its work through queues. It may spend much of its time cycling through the queues, performing the work requests it finds there. To accomodate varying degrees of urgency, the cycle may visit some hoppers more often than others. (No. 1 ESS strongly relies on this procedure.) This paper provides an approximate method for evaluating different cycles. Using the evaluation method and some approximations, we obtain a formula for the optimum relative frequency with which different queues should be visited. The model used is nonprobabilistic, and treats requests as continuous rather than discrete. The model also ignores certain interdependencies between queues. Despite these drastic simplifications, the results probably provide useful guidance, if interpreted cautiously.

Similar Papers
  • Research Article
  • Citations3

Real-Time Testing of Automatic Overload Control Systems in a Laboratory Environment

  • Sep 01, 1973
  • IEEE Transactions on Communications
  • F Man
  • Research Article
  • Citations1

The Loop Range Extension (LRE) Feature in Electronic Switching Systems (ESS)

  • Jul 01, 1980
  • IEEE Transactions on Communications
  • R Fishel +2
  • Conference Article

A relational data management system for electronic switching systems

  • Nov 06, 1979
  • W.L Gewirtz +4
  • Research Article

Modernization of the Suburban ESS: Adding Data Links to an Existing ESS

  • Jul 08, 1983
  • Bell System Technical Journal
  • C E Ishman +4
  • Conference Article
  • Citations25

Ranking the importance of alerts for problem determination in large computer systems

  • Jun 15, 2009
  • Guofei Jiang +3
  • Research Article
  • Citations6

Optimal pumping scheduling for municipal water storage systems

  • Nov 26, 2021
  • Energy Reports
  • P.B Ngancha +2
  • Conference Article
  • Citations1

Multi-log/sub 2/N self-routing networks and their applications in high speed electronic and photonic switching systems

  • Jan 01, 1989
  • C.-T Lea
  • Research Article
  • Citations344

Frustration in biomolecules.

  • Sep 16, 2014
  • Quarterly Reviews of Biophysics
  • Diego U Ferreiro +2
  • Conference Article
  • Citations9

Soft error considerations for computer web servers

  • Mar 01, 2010
  • Fan Wang +1
  • Conference Article
  • Citations1

A Microprocessor Operating System for Real-Time Applications

  • Nov 13, 1978
  • D.A Anderson
  • Research Article
  • Citations11

Maintenance Techniques of a Microprogrammed Self-Checking Control Complex of an Electronic Switching System

  • May 01, 1973
  • IEEE Transactions on Computers
  • H.Y.P Chang +3
  • Research Article
  • Citations9

Translations in the No. 1 Electronic Switching System

  • Sep 01, 1964
  • Bell System Technical Journal
  • W Ulrich +1
  • Research Article
  • Citations1

Comparative performance of COBOL programs on mini vs. large computer systems

  • Apr 01, 1978
  • ACM SIGMINI Newsletter
  • Paul J Jalics
  • Research Article
  • Citations19

Administration and Maintenance Plan

  • Oct 01, 1969
  • Bell System Technical Journal
  • Hugh J Beuscher +4
  • Research Article
  • Citations5

Advanced Mobile Phone Service: Mobile Telephone Switching Office

  • Jan 01, 1979
  • Bell System Technical Journal
  • K J S Chadha +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.