Arbitration technique based on processor task priority

Abstract

A system comprises storage and wherein the switch is adapted to receive messages from various nodes. One or more of the messages includes a priority value that is stored in the switch's storage. The switch routes the messages based, at least in part, on the priority values

1 . A computer system, comprising: 
 a switch; and    a plurality of nodes coupled to said switch;    wherein said switch receives messages from said nodes, one or more of said messages including a priority value, and said switch routes the messages based on said priority values.    
   
   
       2 . The computer system of  claim 1  wherein said switch uses said priority values as the sole criterion for deciding how to route said message.  
   
   
       3 . The computer system of  claim 1  wherein said switch decides how to route said messages based on said priority values and based on an anti-starvation algorithm.  
   
   
       4 . The computer system of  claim 1  wherein said switch decides how to route said messages based on said priority values and based on a tie breaking algorithm that is used when messages from two or more nodes have the highest, yet equal, priority value.  
   
   
       5 . The computer system of  claim 1  wherein said switch decides how to route said messages based on an algorithm that does not involve said priority values, but uses said priority values to decide how to route said messages when the non priority value-based algorithm is unable to decide between competing node messages.  
   
   
       6 . The computer system of  claim 1  wherein said switch decides how to route said messages based on said priority values and based on other criteria.  
   
   
       7 . A switch adapted to couple to a plurality of nodes, said switch comprising: 
 storage for priority values;    wherein said switch is adapted to receive messages from said nodes, one or more of said messages including a priority value that is stored in said storage; and    wherein said switch routes the messages based, at least in part, on said priority values.    
   
   
       8 . The switch of  claim 7  wherein said switch routes a first message through the switch before a second message if the first message has a priority value that indicates higher priority than the a priority value in the second message.  
   
   
       9 . The switch of  claim 7  wherein said switch uses said priority values as the sole criterion for deciding how to route said messages.  
   
   
       10 . The switch of  claim 7  wherein said switch decides how to route said messages based on said priority values and based on an anti-starvation algorithm.  
   
   
       11 . The switch of  claim 7  wherein said switch decides how to route said messages based on said priority values and based on a tie breaking algorithm that is used when messages from two or more nodes have the highest, yet equal, priority value.  
   
   
       12 . The switch of  claim 7  wherein said switch decides how to route said messages based on an algorithm that does not involve said priority values, but uses said priority values to decide how to route said messages when the non-priority value-based algorithm is unable to decide between competing node messages.  
   
   
       13 . The switch of  claim 7  wherein said switch decides how to route said messages based on said priority values and based on other criteria.  
   
   
       14 . An apparatus, comprising: 
 means for receiving messages and task priorities associated with said messages; and    means for routing said messages based on said task priorities.    
   
   
       15 . The apparatus of  claim 14  further comprising means for storing said task priorities.