1095 search results - page 49 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
125
click to vote
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
157
click to vote
RTAS
2010
IEEE
15 years 2 months ago
2010
IEEE
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
142
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
158
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
133
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...