Processor Reordering Rules
Published in Probability in the Engineering and Informational Sciences • Apr 1, 1990
NobleIDNI2P77W09R87S16
Authors:
Shledon M. Ross
Abstract
We consider a problem in which jobs continually arrive to a set of n processors that are arranged in an ordered list. When a job arrives the first processor in line attempts to process it; if it is unsuccessful then the next in line attempts it, and so on. Each time that processor j attempts to proc...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!