Value-density algorithms for the deliberation-scheduling problem

Authors:
Yagíl Ronén;Daniel Mossé;Martha E. Pollack
Affiliations:
-;-;-
Venue:
ACM SIGART Bulletin
Year:
1996

Citing 11
Cited 1

Virtual Time CSMA Protocols for Hard Real-Time Communication

IEEE Transactions on Software Engineering
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems

IEEE Transactions on Software Engineering
Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints

Journal of Systems and Software
Do the right thing: studies in limited rationality

Do the right thing: studies in limited rationality
Modern operating systems

Modern operating systems
The uses of plans

Artificial Intelligence
Optimal composition of real-time systems

Artificial Intelligence
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Value vs. deadline scheduling in overload conditions

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Best-effort decision-making for real-time scheduling

Best-effort decision-making for real-time scheduling

An Optimal Value-Based Admission Policy and its ReflectiveUse in Real-Time Systems

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several disciplines such as real-time artificial intelligence, operating systems, operations research, and local area networks have addressed problems of scheduling tasks with timing and precedence constraints. In this paper, we compare the different value-density algorithms, and suggest a novel algorithm that subsumes the previous ones with respect to schedulability. We assess the application of these various algorithms to the deliberation scheduling problem for autonomous agents.