Value-based message multiplexing: an analytical model
暂无分享,去创建一个
[1] Marcel F. Neuts,et al. Matrix-Geometric Solutions in Stochastic Models , 1981 .
[2] Krithi Ramamritham,et al. The integration of deadline and criticalness in hard real-time scheduling , 1988, Proceedings. Real-Time Systems Symposium.
[3] Hideyuki Tokuda,et al. Implementation of a Time-Driven Scheduler for ReaI-Time Operating Systems , 1987, RTSS.
[4] C. D. Locke,et al. Best-effort decision-making for real-time scheduling , 1986 .
[5] Keith W. Ross,et al. Optimal scheduling of interactive and noninteractive traffic in telecommunication systems , 1988 .
[6] Thomas C. Oppe,et al. NSPCG (Nonsymmetric Preconditioned Conjugate Gradient) user's guide: Version 1. 0: A package for solving large sparse linear systems by various iterative methods , 1988 .
[7] Keith W. Ross,et al. Optimal multiplexing of heterogeneous traffic with hard constraint , 1986, SIGMETRICS '86/PERFORMANCE '86.
[8] J. Duane Northcutt. Mechanisms for Reliable Distributed Real-Time Operating Systems: The Alpha Kernel , 1987 .
[9] Anthony Ephremides,et al. Optimal scheduling with strict deadlines , 1989 .
[10] Hideyuki Tokuda,et al. A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.
[11] Pascal Joly,et al. Preconditioned biconjugate gradient methods for numerical reservoir simulation , 1990 .
[12] L. P. Clare,et al. Value-based multiplexing of time-critical traffic , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.
[13] Yechiam Yemini,et al. Multiple-access protocols and time-constrained communication , 1984, CSUR.