Guaranteeing Fair Service to Persistent Dependent Tasks (Q4210089)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Guaranteeing Fair Service to Persistent Dependent Tasks |
scientific article; zbMATH DE number 1200721
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Guaranteeing Fair Service to Persistent Dependent Tasks |
scientific article; zbMATH DE number 1200721 |
Statements
Guaranteeing Fair Service to Persistent Dependent Tasks (English)
0 references
20 September 1998
0 references
fairness
0 references
dining philosophers problem
0 references
scheduling
0 references
interval graphs
0 references
0.86980253
0 references
0.86980253
0 references
0.8331177
0 references
0.8298093
0 references
0.8298029
0 references
0.82923114
0 references
0 references
