On the exact upper bound for the Multifit processor scheduling algorithm (Q920838): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:18, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exact upper bound for the Multifit processor scheduling algorithm |
scientific article |
Statements
On the exact upper bound for the Multifit processor scheduling algorithm (English)
0 references
1990
0 references
exact upper bound
0 references
independent tasks
0 references
identical processors
0 references
makespan
0 references
Multifit
0 references
