Performance Of Stochastic Rendezvous Networks With Priority Tasks

Multi-tasking multiprocessor systems frequently use rendezvous for intertask communication, and Stochastic Rendezvous Networks are a form of performance model for such systems. Tasks are frequently given different priorities to adjust the system performance. This paper considers a pre-emptive-resume priority discipline for executing tasks sharing each processor. An iterative algorithm is proposed, based on the wellknown "MVA Priority Approximation". Throughput errors below 10% are found in many cases. The worst accuracy (as usual) is for low-priority tasks on highly-utilized processors. 1 Introduction This paper considers the performance of multiprocessor multi-tasking systems with rendezvous, and the effect of priorities among tasks. Multi-tasking software applications are growing in importance, either for single processors, or for multi-processors and networks. Performance models of these systems should take into account the software communications behavior, which introduces queuein..