Sciweavers

1292 search results - page 158 / 259
» Revisiting the optimal scheduling problem
Sort
View
145
Voted
JCO
2006
83views more  JCO 2006»
15 years 6 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
SCHEDULING
2008
97views more  SCHEDULING 2008»
15 years 5 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee
139
Voted
CC
2007
Springer
16 years 9 days ago
Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. ...
Doosan Cho, Ravi Ayyagari, Gang-Ryung Uh, Yunheung...
153
Voted
INFOCOM
2003
IEEE
15 years 11 months ago
Local Scheduling Policies in Networks of Packet Switches with Input Queues
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...
Marco Ajmone Marsan, Paolo Giaccone, Emilio Leonar...
208
Voted
RTSS
1992
IEEE
15 years 10 months ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay