10106 search results - page 245 / 2022 » Algorithm Selection and Scheduling |
173
click to vote
MICRO
1998
IEEE
15 years 10 months ago
1998
IEEE
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
185
click to vote
CODES
2008
IEEE
15 years 8 months ago
2008
IEEE
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
151
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
181
click to vote
ISORC
2002
IEEE
15 years 11 months ago
2002
IEEE
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...
177
click to vote
IEEEPACT
1998
IEEE
15 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...