Minimizing energy on homogeneous processors with shared memory (Q5925517)
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 7333013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing energy on homogeneous processors with shared memory |
scientific article; zbMATH DE number 7333013 |
Statements
Minimizing energy on homogeneous processors with shared memory (English)
0 references
14 April 2021
0 references
This paper considers the system-wide energy-efficient task scheduling problem in a system architecture equipped with a multi-core processor and a shared main memory. The focus is on the case when the number of tasks is greater than the number of cores, which has been proved to be NP-hard if the number of cores is at least 2. For the multiple-cores case, based on observation from the single-core case, a polynomial-time approximation algorithm is devised with guaranteed performance.
0 references
energy minimization
0 references
scheduling
0 references
shared memory
0 references
approximation algorithm
0 references
0 references
0.9237841367721558
0 references
0.791123628616333
0 references
0.7658369541168213
0 references
0.7576144337654114
0 references
