In the real-time research community, one often distinguishes between hard and soft temporal requirements. If a deadline is violated in a hard real-time computation the logical result is useless. In a soft real-time computation, the logical result could have a meaning even though a deadline is not me
A framework for developing intelligent real-time scheduling systems
โ Scribed by Ronald F. McPherson; K. Preston White; Jr.
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 203 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1090-8471
No coin nor oath required. For personal study only.
โฆ Synopsis
The authors describe the adaptation of a hierarchical management-control framework to the design of intelligent real-time scheduling systems. Originally developed for the analysis of organizations where dynamics are governed solely by the reactions of human decision makers, the control framework provides insights concerning design requirements for decision systems that react in humanlike fashion within narrow domains of expertise. The framework emphasizes the dynamic balance of autonomy and decentralization required to achieve planned goals within a hierarchical organization. Applying this framework, design specifications for knowledge-based scheduling systems are developed, which are responsive to organizational dynamics as required for schedule control and replanning. An illustration is given that addresses kitchen scheduling in full-service restaurants.
๐ SIMILAR VOLUMES
Several schemes for detecting and locating faulty processors through self-diagnosis in multiprocessor systems have been discussed in the past. These schemes attempt to start multiple copies (versions) of the tasks on available idle processors simultaneously and compare the results generated by the c
This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method
Algorithms for arbitrating and scheduling transmissions from different transmitters sharing a common access medium arise often in the design of many shared and distributed systems. In this paper we present a distributed algorithm for arbitrating time-constrained transmissions on slotted shared acces