Sciweavers

92 search results - page 9 / 19
» Optimal versus Heuristic Global Code Scheduling
Sort
View
OPODIS
2010
14 years 7 months ago
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
Piyush Garyali, Matthew Dellinger, Binoy Ravindran
AIPS
2006
14 years 11 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
CP
2001
Springer
15 years 2 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
RTAS
2005
IEEE
15 years 3 months ago
Improving WCET by Optimizing Worst-Case Paths
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compi...
Wankang Zhao, William C. Kreahling, David B. Whall...
89
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 9 months ago
One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
Abstract—This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one-bit randomized scalar quantizers in the presence...
Ye Wang, Prakash Ishwar, Venkatesh Saligrama