Abstract
Design-to-time real-time scheduling is an approach to solving time-sensitive problems where multiple methods are available for many subproblems. It is an alternative to the anytime algorithm approach, scheduling discrete methods rather than anytime algorithms with the goal of maximizing the value of the scheduled computation. In this paper we briefly introduce the design-to-time approach, describe how design-to-time can be used to schedule anytime algorithms including some experimental results, and examine anytime characteristics of our design-to-time scheduling algorithm.
- Keith S. Decker and Victor R. Lesser. Quantitative modeling of complex computational task environments. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 217--224, Washington, July 1993.Google Scholar
- Alan Garvey. Design-to-time real-time scheduling. Ph.D. Dissertation, Department of Computer Science, University of Massachusetts, Amherst, MA, February 1996. Google ScholarDigital Library
- Alan Garvey, Marty Humphrey, and Victor Lesser. Task interdependencies in design-to-time real-time scheduling. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 580--585, Washington, D.C., July 1993.Google ScholarDigital Library
- Alan Garvey and Victor Lesser. Design-to-time real-time scheduling. IEEE Transactions on Systems, Man and Cybernetics, 23(6):1491--1502, 1993.Google ScholarCross Ref
- Alan Garvey and Victor Lesser. Design-to-time scheduling with uncertainty. CS Technical Report 95--03, University of Massachusetts, 1995. Google ScholarDigital Library
- S. Zilberstein and S. J. Russell. Optimal composition of real-time systems. Artificial Intelligence, 79(2), December 1995.Google Scholar
- Shlomo Zilberstein. Operational rationality through compilation of anytime algorithms. Ph.D. Dissertation, Department of Computer Science, University of California at Berkeley, Berkeley, CA, 1993. Google ScholarDigital Library
Index Terms
- Design-to-time scheduling and anytime algorithms
Recommendations
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible ...
Efficient algorithms for average completion time scheduling
IPCO'10: Proceedings of the 14th international conference on Integer Programming and Combinatorial OptimizationWe analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm (SRPT) is 5/4-competitive w.r.t. the average ...
Comments