Analysis of hard real-time communications
暂无分享,去创建一个
[1] Alan Burns,et al. ALLOCATING AND SCHEDULING HARD REAL-TIME TASKS ON A PARALLEL PROCESSING PLATFORM , 1994 .
[2] Ken Tindell,et al. ALLOCATING AND SCHEDULING HARD REAL-TIME TASKS ON A POINT-TO-POINT DISTRIBUTED SYSTEM , 2007 .
[3] Alan Burns,et al. Scheduling slack time in fixed priority pre-emptive systems , 1993, 1993 Proceedings Real-Time Systems Symposium.
[4] Alan Burns,et al. An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.
[5] John A. Clark,et al. Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.
[6] Peter Puschner,et al. On the Feasibility of Response Time Predictions --- An Experimental Evaluation , 1991 .
[7] Neil Audsley,et al. OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES , 2007 .
[8] John P. Lehoczky,et al. The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.
[9] Richard A. Volz,et al. Maintaining global time in futurebus+ , 1991, Real-Time Systems.
[10] P. Pleinevaux. An improved hard real-time scheduling for the IEEE 802.5 , 2004, Real-Time Systems.
[11] Alan Burns,et al. The End Of The Line For Static Cyclic Scheduling? , 1993, Fifth Euromicro Workshop on Real-Time Systems.
[12] Alan Burns,et al. SCHEDULING HARD REAL-TIME MULTI-MEDIA DISK TRAFFIC , 1993 .
[13] Sudarshan K. Dhall,et al. On a Real-Time Scheduling Problem , 1978, Oper. Res..
[14] Joseph Y.-T. Leung,et al. On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.
[15] Alan Burns,et al. Hard Real-Time Scheduling: The Deadline-Monotonic Approach , 1991 .
[16] Alan Burns,et al. Guaranteeing Hard Real Time End-to-End Communications Deadlines , 1991 .
[17] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[18] Alan Burns,et al. The Olympus Attitude and Orbital Control System: A Case Study in Hard Real-Time System Design and Implementation , 1993, Ada-Europe.
[19] John P. Lehoczky,et al. Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[20] Taieb Znati,et al. A Prioritized Multiaccess Protocol for Distributed Real-Time Applications , 1987, ICDCS.
[21] Wei Zhao,et al. Architectural impact of FDDI network on scheduling hard real-time traffic , 1991 .
[22] Richard Gerber,et al. Semantics-based compiler transformations for enhanced schedulability , 1993, 1993 Proceedings Real-Time Systems Symposium.
[23] Krithi Ramamritham,et al. Virtual Time CSMA Protocols for Hard Real-Time Communication , 1987, IEEE Transactions on Software Engineering.
[24] Kerim Demirbas. Distributed sensor data fusion with binary decision trees , 1989 .
[25] Jay K. Strosnider,et al. Advanced real-time scheduling using the IEEE 802.5 token ring , 1988, Proceedings. Real-Time Systems Symposium.
[26] Alan Burns,et al. Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..
[27] Lui Sha,et al. Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.
[28] W. Tindell. AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .
[29] R. Rajkumar. Real-time synchronization protocols for shared memory multiprocessors , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.
[30] Mathai Joseph,et al. Finding Response Times in a Real-Time System , 1986, Comput. J..
[31] Hermann Kopetz,et al. The real-time operating system of MARS , 1989, OPSR.