Sciweavers

493 search results - page 24 / 99
» Final exam scheduler - FES
Sort
View
DAC
1989
ACM
14 years 1 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
CDC
2009
IEEE
14 years 1 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
AIPS
2007
14 years 3 days ago
Towards a Heuristic for Scheduling the James Webb Space Telescope
Scheduling the James Webb Space Telescope (JWST) requires modeling and minimizing the buildup of angular momentum of the spacecraft. Accounting for momentum management is expected...
Mark E. Giuliano, Reiko Rager, Nazma Ferdous
EOR
2008
91views more  EOR 2008»
13 years 9 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
ECRTS
2003
IEEE
14 years 3 months ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson