Slack allocation algorithm for parallel machines (Q666009): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Convex separable optimization is not much harder than linear optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Benchmarking and comparison of the task graph scheduling algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on greedy algorithms for the maximum weighted independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4252722 / rank | |||
Normal rank | |||
Latest revision as of 00:01, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Slack allocation algorithm for parallel machines |
scientific article |
Statements
Slack allocation algorithm for parallel machines (English)
0 references
7 March 2012
0 references
energy-aware scheduling
0 references
dynamic voltage scaling
0 references
real time and embedded systems
0 references
parallel and distributed computing
0 references
multiprocessor systems
0 references
