1095 search results - page 66 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
91
Voted
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
EUROPAR
2008
Springer
14 years 12 months ago
2008
Springer
The use of virtualization is rapidly expanding from server consolidation to various computing systems including PC, multimedia set-top box and gaming console. However, different fr...
90
Voted
CF
2005
ACM
15 years 4 days ago
2005
ACM
In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex schedu...