* port scheduling
@ 1991-10-18 1:02 micro-heart-of-gold.mit.edu!wupost!cs.utexas.edu!utgpu!cunews!bertrand!gr
0 siblings, 0 replies; only message in thread
From: micro-heart-of-gold.mit.edu!wupost!cs.utexas.edu!utgpu!cunews!bertrand!gr @ 1991-10-18 1:02 UTC (permalink / raw)
Greetings...
I am looking for information on scheduling policies for "ports" on
message-passing systems. For example, consider a task with several
message ports. Is it better to process messages in a first-come,
first-served basis regardless of the port to which it is destined, or
is it best to accept messages each port one at a time, and implement
some sort of visit policy (such as round robin) between all the ports.
(The first case consists of a single message queue for the task while
the second case consists of a message queue for each port).
Please send email as I tend to pop into these groups rather
infrequently.
Thanks
--
Greg Franks, (613) 788-5726 | "The reason that God was able to
Systems Engineering, Carleton University, | create the world in seven days is
Ottawa, Ontario, Canada K1S 5B6. | that he didn't have to worry about
greg@sce.carleton.ca ...!cunews!sce!greg | the installed base" -- Enzo Torresi
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1991-10-18 1:02 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1991-10-18 1:02 port scheduling micro-heart-of-gold.mit.edu!wupost!cs.utexas.edu!utgpu!cunews!bertrand!gr
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox