Throughput calculation for basic stochastic rendezvous networks (Q3820001)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4092765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Throughput calculation for basic stochastic rendezvous networks |
scientific article; zbMATH DE number 4092765 |
Statements
Throughput calculation for basic stochastic rendezvous networks (English)
0 references
1989
0 references
computer performance
0 references
distributed software
0 references
queueing
0 references
decomposition
0 references
Ada tasking performance
0 references
rendezvous
0 references
distributed program
0 references
stochastic network
0 references
Petri nets
0 references
0.89436686
0 references
0.88478035
0 references
0.87566227
0 references
0.87434196
0 references
0.87407345
0 references
0.87180984
0 references
