排序方式: 共有67条查询结果,搜索用时 0 毫秒
1.
2.
3.
传统车内通信系统的数据传输带宽、实时性和数据接入功能的局限已不能满足新一代车内通信设备的需求.本文提出一种基于光纤分布式数据接口总线方式的车内通信系统的实现方法,并给出了系统实现方案和测试数据.该系统的数据传输带宽、实时性和设备数据接人能力均能满足新一代车内各类通信设备的接入要求,且该方案已经产品化,实践应用证明该方案可行. 相似文献
4.
FDDI通信接口关键电路的设计 总被引:4,自引:0,他引:4
王世奎 《小型微型计算机系统》2000,21(12):1252-1254
高速分布式光纤网络将进入航空通信领域,本文介绍了适合机载实时容错分布式通信系统的FDDI通信接口的功能与组成,重点说明了该接口硬件关键电路的设计思想和方案。 相似文献
5.
窦强 《小型微型计算机系统》1997,18(4):15-19
本文首先简要介绍了开放数据链路接口ODI的结构模型和基本原理,并在此 论述了Novell网中FDDI网络适配器ODI驱动程序的实现技术。 相似文献
6.
从社会需求与技术发展的相关系统出发,阐述了计算机网络技术的发展现状及其对计算机用户组网的选择和影响。 相似文献
7.
针对潜射导弹测控系统空间有限、电磁干扰强等问题,提出了基于FDDI的潜射导弹测控系统设计方案;系统由FDDI网络及PXI现场子系统组成,FDDI网络由光纤电缆、适配器、集中器和连接器组成,PXI现场子系统由PXI测试系统、测控计算机、转接箱和调理电路组成;文章设计的网络测试系统可以有效解决潜射导弹存在的电磁干扰强、空间有限等问题,并可实现并行测试,大大提高测试速度,提高导弹武器的作战反应速度。 相似文献
8.
9.
10.
Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol
Zhang Sijing Burns Alan Mehaoua Ahmed Stewart Lee E. Yang Hongji 《Real-Time Systems》2002,22(3):251-280
One of the key issues related to guaranteeing synchronous message deadlines in a timed token network (such as fiber distributed data interface) where the timed token medium access control protocol is used is the schedulability test of synchronous traffic (i.e., testing whether or not all synchronous messages can be transmitted before their deadlines, under a given setting of network parameters). Much work has been done on how to assign network parameters appropriately in order to guarantee timely transmission of synchronous traffic. As a result quite a few synchronous bandwidth allocation schemes and some good guidelines on selection of the target token rotation time have been proposed. In contrast, limited research has been conducted on how to effectively test whether or not given network parameters can guarantee timely transmission of all synchronous messages (of a considered synchronous message set) before their deadlines. The previous testing methods for synchronous message schedulability only provide a sufficient (but not necessary) test and therefore fail to always keep effective for any synchronous message set considered. In this paper, we propose two testing methods for determining the schedulability of a synchronous message set with message deadlines no longer than periods. The proposed tests perform better than any previous test in the sense that they are both sufficient and necessary. Some numerical examples are given to compare different testing methods, all of which have demonstrated the superiority of the proposed tests to other existing testing methods. 相似文献