Sciweavers

706 search results - page 5 / 142
» Online Interval Scheduling
Sort
View
MST
2008
157views more  MST 2008»
13 years 7 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
DAC
2011
ACM
12 years 7 months ago
Customer-aware task allocation and scheduling for multi-mode MPSoCs
Today’s multiprocessor system-on-a-chip (MPSoC) products typically have multiple execution modes, and for each mode, all the products utilize the same task allocation and schedu...
Lin Huang, Rong Ye, Qiang Xu
DATE
2004
IEEE
135views Hardware» more  DATE 2004»
13 years 11 months ago
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
ORDER
2007
89views more  ORDER 2007»
13 years 7 months ago
On-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
DAC
1995
ACM
13 years 11 months ago
Interval Scheduling: Fine-Grained Code Scheduling for Embedded Systems
Abstract A central problem in embedded system co-synthesis is the generation of software for lowlevel I O. Scheduling still remains a manual task because existing coarse-grained re...
Pai H. Chou, Gaetano Borriello