WAITING FOR GODOT: A PROCESS SCHEDULING PROBLEM.

Michael L. Honig*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem considered is derived from a computing environment in which different but dependent computational tasks are to be scheduled for execution on multiple processors. The test customer represents a computational task that depends on the results of an associated task. The test customer's mean delay until service is derived, assuming that he always maintains his position in the queue until he reaches the server. Conditions are given for which this move-along policy is optimal, i. e. , minimizes the test customer's mean delay until service. A condition is also given for which the move-along policy is not optimal.

Original languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Circuits, Systems & Computers
PublisherIEEE
Pages321-325
Number of pages5
ISBN (Print)0818608161
StatePublished - Jan 1 1987

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'WAITING FOR GODOT: A PROCESS SCHEDULING PROBLEM.'. Together they form a unique fingerprint.

Cite this