Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2006-01-30
2008-10-28
An, Meng-Ai (Department: 2195)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S100000, C718S102000
Reexamination Certificate
active
07444638
ABSTRACT:
A system and methods for scheduling executions of real-time processes, including periodic processes and asynchronous processes to guarantee satisfaction of various timing constraints. The system schedules their executions in two phases: a pre-run-time (off-line) phase performed by a pre-run-time scheduler, and a run-time (on-line) phase performed by a run-time scheduler.
REFERENCES:
patent: 5640563 (1997-06-01), Carmon
patent: 5742847 (1998-04-01), Knoll et al.
patent: 6230303 (2001-05-01), Dave
N.C. Audsley, et al, “The end of the line for static cyclic scheduling?” Proc. Fifth Euromicro Workshop on Real-Time Systems, 36-41, 1993.
N.C. Audsley, et al, “Putting fixed priority scheduling theory into engineering practice for safety critical applications”, 2nd IEEE RTAS'96, Boston, Jun. 1996.
N.C. Audsley et al, “On fixed priority scheduling, offsets and co-prime task periods”, Information processing letters, 67, 1998, p. 65-69.
T. P.Baker, et al, “The cyclic executive model and Ada,” Journal of Real-Time Systems, vol. 1, p. 7-25, Jun. 1989.
A. Burns, et al, “Generating Feasible Cyclic Schedules”, Control Engineering Practice, vol. 3, No. 2, 1995, p. 151-162.
A. Burns, “Preemptive priority-based scheduling: an appropriate engineering approach”, in Advances in Real-Time Systems, Ed. By S. H. Son, Prentice Hall, 1995, p. 225-248.
A. Burns, et al, “Effective analysis for engineering real-time fixed priority schedulers,” IEEE Trans. Software Eng., 21, 475-480, 1995.
R. Devillers, et al, “General response time computation for the deadline driven scheduling of periodic tasks”, Fundamenta Informaticae 34, 1999, p. 1-21.
G. Fohler, “Flexibility in Statically Scheduled Hard Real-Time Systems”, Ph.D. thesis, Institute fur Technische Informatik, TUW, Austria, Apr. 1994, p. 1-101.
G. Fohler, et al, “Heuristic Scheduling for Distributed Hard Real-Time Systems”, Research Report Dec. 1990, Institute fur Technische Informatik, TUW, Austria, 1990, p. 1-19.
G. Fohler, “Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems”, 16th IEEE RTSS'95, Dec. 1995, p. 152-161.
R. Gerber, et al, “Guaranteeing real-time requirements with resource-based calibration of periodic processes”, IEEE Trans. On Software Eng. 21, Jul. 7, 1995, p. 579-592.
J. Goossens, et al, “The non-optimality of the monotonic priority assignments for hard real-time offset free systems”, Real-Time Systems, vol. 13, 1997, p. 107-126.
M. Iwasaki, et al, “Isochronous Scheduling and its Application to Traffic Control”, 19th IEEE Real-Time Systems Symposium, Dec. 1998.
K. Jeffay, et al, “On non-preemptive scheduling of periodic and sporadic tasks”, Proc. 12th IEEE Real-Time Systems Symposium (RTSS'91), 1991, p. 129-139.
H. Kopetz, et al., “Distributed fault tolerant real-time systems: the MARS approach”, IEEE Micro, Feb. 1989, p. 25-40.
E.L. Lawler, et al, “Scheduling periodically occurring tasks on multiple processors”, Information Processing Letters, 12, 1, 1981, p. 9-12.
D. W. Leinbaugh, “Guaranteed response time in a hard real-time environment,” IEEE Trans. Software Eng., vol. SE-6, Jan. 1980, p. 85-91.
J. Y.-T. Leung, et al, “A note on preemptive scheduling of periodic, real-time tasks,” Information Processing Letters, vol. 11, Nov. 1980.
J. Y.-T Leung, et al, “On the complexity of fixed-priority scheduling of periodic, real-time tasks”, Performance Evaluation, 2, 1982, p. 115-118.
M. A. Livani, et al, “EDF consensus on CAN bus access for dynamic real-time applications”, 19th IEEE RTSS'98, Dec. 1998.
C. D. Locke, “Software architecture for hard real-time applications: cyclic executives vs. fixed priority executives,” Real-Time Systems, 4, 37-53, 1992.
G. Manimaran, et al, “A new approach for scheduling of parallelizable tasks in real-time multiprocessor systems”, Real-Time Systems, 15, 1998, p. 39-60.
A. K. Mok, “Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment”, Ph.D Thesis, MIT, Cambridge, Massachusetts, May 1983, p. 1-183.
S. Poledna, et al, “ERCOS: an operating system for automotive applications”, SAE International Congress, Detroit, SAE Press, 1996, p. 1-11.
J.A. Stankovic, et al, “Deadline Scheduling For Real-Time Systems: EDF and Related Algorithms”, Ch. 5, “Planning-Based Scheduling”, Kluwer, 1998, p. 87-120.
A.D. Stoyenko, et al, “Analyzing hard-real-time programs for guaranteed schedulability”, IEEE Trans. On Software Eng., 17, Aug. 8, 1991, p. 737-750.
J. K. Strosnider, et al, “The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments,” IEEE Trans. Computers, 44, 1995, p. 73-91.
A.J. Wellings, et al, “Real-Time Scheduling in a Generic Fault-Tolerant Architecture”, Proc. IEEE Real-Time Systems Symposium (RTSS'98), Dec. 1998.
W. Zhao, et al, “Scheduling tasks with resource requirements in hard real-time systems,” IEEE Trans. on Software Engineering, vol. SE-13, May 1987.
N. C. Audsley, et al, “The end of the line for static cyclic scheduling?” Proc. Fifth Euromicro Workshop on Real-Time Systems, 36-41, 1993.
N.C. Audsley et al, “Putting fixed priority scheduling theory into engineering practice for safety critical applications”, 2ndIEEE RTAS'96, Boston, Jun. 1996, p. 2-10.
N.C. Audsley, et al, “On fixed priority scheduling, offsets and co-prime task periods”, Information processing letters, 67, 1998, p. 65-69.
C.D. Locke, “Software architecture for hard real-time applications: cyclic executives vs. fixed priority executives,” Real-Time Systems, 4, 37-53, 1992.
An Meng-Ai
Tang Kenneth
LandOfFree
Method for scheduling executions of real-time processes to... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for scheduling executions of real-time processes to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for scheduling executions of real-time processes to... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4006982