Journal ArticleDOI
Incremental reconfiguration and load adjustment in adaptive real time systems
Tei-Wei Kuo,Aloysius K. Mok +1 more
TLDR
A framework for discussing how to adjust load in order to handle periodic processes whose timing parameters vary with time is provided and an approximation algorithm for the period assignment problem is presented.Abstract:
We provide a framework for discussing how to adjust load in order to handle periodic processes whose timing parameters vary with time. The schedulability of adjustable periodic processes by a preemptive fixed priority scheduler is formulated in terms of a configuration selection problem for which a PTIME solution is shown. When the list of allowable configurations is implicitly given by a set of scalable periodic processes, the corresponding period assignment problem is shown to be NP-Complete. We present an approximation algorithm for the period assignment problem for which we show some encouraging experimental results.read more
Citations
More filters
Proceedings ArticleDOI
A fixed-priority-driven open environment for real-time applications
Tei-Wei Kuo,Ching-Hui Li +1 more
TL;DR: This paper replaces the underlying earliest-deadline-first OS Scheduler of the open system architecture with a rate-monotonic OS scheduler, and proposes to use the idea of sporadic servers to preserve CPU cycles for applications.
Journal ArticleDOI
A Gaussian noise generator for hardware-based simulations
TL;DR: A hardware-based Gaussian noise generator used as a key component in a hardware simulation system, for exploring channel code behavior at very low bit error rates (BERs) in the range of 10/sup -9/ to 10/Sup -10/.
Proceedings ArticleDOI
Rate modulation of soft real-time tasks in autonomous robot control systems
TL;DR: A novel scheduling technique for adaptation of soft real-time load to available computational capacity in the context of autonomous robot control architectures is illustrated, based on rate modulation of a set of periodic tasks in a range of admissible rates.
Proceedings ArticleDOI
Template-based real-time dwell scheduling with energy constraint
TL;DR: The template-based scheduling algorithm is developed to guarantee the performance requirement with low on-line overhead for real-time dwell scheduling in multi-function phase array radars.
Journal ArticleDOI
Engineering dynamic real-time distributed systems: architecture, system description language, and middleware
TL;DR: An architectural framework and algorithms for engineering dynamic real-time distributed systems using commercial off-the-shelf technologies to achieve timeliness and survivability requirements and to validate the viability of the approach is presented.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Book
Scheduling algorithms for multiprogramming in a hard real-time environment
C. L. Liu,James W. Layland +1 more
TL;DR: In this paper, the problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service, and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets.
Related Papers (5)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
C. L. Liu,James W. Layland +1 more
The rate monotonic scheduling algorithm: exact characterization and average case behavior
John P. Lehoczky,Lui Sha,Y. Ding +2 more