1536 search results - page 78 / 308 » DPS - Dynamic Parallel Schedules |
HIPC
2003
Springer
15 years 4 months ago
2003
Springer
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
MICRO
1999
IEEE
15 years 3 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
107
click to vote
ASC
2008
14 years 11 months ago
2008
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
IPPS
2000
IEEE
15 years 3 months ago
2000
IEEE
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
104
click to vote
DAGSTUHL
2007
15 years 24 days ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...