Multiprocessor Synthesis for Periodic Hard Real-Time Tasks under a Given Energy Constraint
Date Issued
2006
Date
2006
Author(s)
Hsu, Heng-Ruey
DOI
en-US
Abstract
The energy-aware design for electronic systems has been an important issue in hardware and software implementations, especially for embedded systems. This paper targets a synthesis problem for heterogeneous multiprocessor systems to schedule a set of periodic real-time tasks under a given energy consumption constraint. Each task is required to execute on a processor without migration, where tasks might have different execution times on different processor types. Our objective is to minimize the processor cost of the entire system under the given timing and energy consumption constraints. The problem is first shown being NP-hard and having no polynomial-time algorithm with a constant approximation ratio unless NP = P. We propose polynomial-time approximation algorithms with (m+2)-approximation ratios for this challenging problem, where m is the number of the available processor types. Experimental results show that the proposed algorithms could always derive solutions with system costs close to those of optimal solutions.
Subjects
省電
週期性
硬式即時程序
多處理器
系統組態
Multiprocessor
Hard Real-Time Tasks
Synthesis
Periodic
Energy
SDGs
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93922046-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):e0b3e03f91af90971db564d0c8df1a6a