Analysis of a finite buffer with non-preemptive priority scheduling (Q4243932)
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 1289902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of a finite buffer with non-preemptive priority scheduling |
scientific article; zbMATH DE number 1289902 |
Statements
Analysis of a finite buffer with non-preemptive priority scheduling (English)
0 references
27 February 2000
0 references
shared buffer model
0 references
first passage-time analysis
0 references
Laplace-Stieltjes transform
0 references
non-preemptive priority
0 references
0.9238991
0 references
0.9165358
0 references
0.90793633
0 references
0.9042092
0 references
0.8945852
0 references
0.8863381
0 references
