From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on ip-172-31-74-118.ec2.internal X-Spam-Level: X-Spam-Status: No, score=0.8 required=3.0 tests=BAYES_50 autolearn=ham autolearn_force=no version=3.4.5-pre1 Date: 18 Oct 91 01:02:54 GMT From: micro-heart-of-gold.mit.edu!wupost!cs.utexas.edu!utgpu!cunews!bertrand!gr eg@bloom-beacon.mit.edu (Greg Franks) Subject: port scheduling Message-ID: List-Id: 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