Sciweavers

252 search results - page 10 / 51
» Task Assignment and Scheduling under Memory Constraints
Sort
View
RTCSA
2007
IEEE
14 years 1 months ago
Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada
SAMOS
2010
Springer
13 years 5 months ago
Power aware heterogeneous MPSoC with dynamic task scheduling and increased data locality for multiple applications
A new heterogeneous multiprocessor system with dynamic memory and power management for improved performance and power consumption is presented. Increased data locality is automatic...
Oliver Arnold, Gerhard Fettweis
IOR
2007
106views more  IOR 2007»
13 years 7 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
DAC
2011
ACM
12 years 7 months ago
Throughput maximization for periodic real-time systems under the maximal temperature constraint
We study the problem on how to maximize the throughput for a periodic real-time system under the given peak temperature constraint. We assume that different tasks in our system ma...
Huang Huang, Gang Quan, Jeffrey Fan, Meikang Qiu
ISQED
2010
IEEE
161views Hardware» more  ISQED 2010»
13 years 9 months ago
Minimizing the power consumption of a Chip Multiprocessor under an average throughput constraint
- In a multi-core system, power and performance may be dynamically traded off by utilizing power management (PM). This paper addresses the problem of minimizing the total power con...
Mohammad Ghasemazar, Ehsan Pakbaznia, Massoud Pedr...