Work-competitive scheduling on task dependency graphs (Q4598901)
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 6819457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Work-competitive scheduling on task dependency graphs |
scientific article; zbMATH DE number 6819457 |
Statements
Work-Competitive Scheduling on Task Dependency Graphs (English)
0 references
15 December 2017
0 references
online algorithms
0 references
distributed computing
0 references
randomized algorithms
0 references
competitive analysis
0 references
partitionable networks
0 references
0.878974437713623
0 references
0.8761081695556641
0 references
0.7590563297271729
0 references
0.758662223815918
0 references
0.758662223815918
0 references
