For the most recent entries see the Petri Nets Newsletter.

Throughput of Stochastic Rendezvous Networks with Caller-specific Service and Processor Contention.

Miernik, J.W.; Woodside, C.M.; Neilson, J.E.; Petriu, D.C.

In: IEEE INFOCOM'88 - The Conference on Computer Communications. Proc. of the Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies - Networks: Evolution or Revolution?, pages 1040-1049. IEEE, New York, NY, USA, 1988.

Abstract: Stochastic rendezvous networks (SRVN) are models for the throughput of distributed programs executed concurrently and synchronously on distributed computing nodes. An iterative approximation method is developed, and compared to exact throughput calculations found with timed Petri nets. The approximation has errors of a few percent in most cases, and executes very much faster than the Petri-net calculation.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography