657 search results - page 76 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
137
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of dea...
SCHEDULING
2008
14 years 11 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
CASES
2003
ACM
15 years 5 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
103
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
115
click to vote
HPDC
2002
IEEE
15 years 4 months ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...