共查询到20条相似文献,搜索用时 125 毫秒
1.
介绍了VxWorks实时操作系统实时性和多任务环境的特性.在分析了天线控制系统基本原理的基础上,提出天线控制系统的各个任务模块的划分原则,介绍了各个任务的优先级别和触发方式.提出了各个任务间的通信手段与同步方法.此外,还给出了在PC104嵌入式计算机上,应用VxWorks实时操作系统成功开发天线控制系统软件的实例. 相似文献
2.
介绍了嵌入式操作系统VxWorks的界面开发组件、MndML(wind Media Library)在工程中的应用,阐述了界面开发中任务的多线程运行、图片的加载、按钮控件的实现、任务问通信机制以及数据的以UDP方式接收并显示等概念及功能实现,并且给出了应用中主要的实现代码。 相似文献
3.
4.
介绍了飞机配电系统电气负载管理中心(ELMC)的配电模式,通过研究VxWorks嵌入式操作系统在ELMC数据通信及控制系统中的应用,以及从保证ELMC数据通信及控制系统实时性、可靠性、准确性的角度出发,提出了基于PowerPC微处理器和VxWorks嵌入式实时操作系统的ELMC数据通信及控制系统的设计方案;在此基础上,对系统总体任务的运行调度情况进行了分析,并利用Tornado环境下WindView对任务运行进行了相关验证,满足设计要求,证明了该设计的可靠性和正确性. 相似文献
5.
6.
7.
语音网关是实现PSTN(公用电话交换网)与IP网之间通信的关键设备,该文提出了一个基于VxWorks平台的嵌入式语音网关解决方案。在介绍实时操作系统VxWorks及嵌入式微处理器MPC860T的基础上,给出了语音网关的软硬件实现方法。该语音网关能够有效降低语音延迟,提高语音传输质量。 相似文献
8.
为了保证诸任务对临界critical资源resource的互斥访问,VxWorks提供了任务同步机制。二进制信号量是VxWorks系统中实现任务同步的一种重要手段,它保证了任务在并发时结果的一致性。简要介绍二进制信号量,阐述用二进制信号量解决任务互斥和同步的方法,并给出二进制信号量应用在某数据采集系统中的程序框架。某数据采集系统中有效地利用了VxWorks的信号量机制,实现了8个接收通道的数据采集、数据存储以及数据查询等任务对缓冲区的共享。 相似文献
9.
讨论了在嵌入式实时操作系统VxWorks下实现网络通信的方法。介绍VxWorks下的Socket函数集和使用客户一服务器模式进行Socket通信方法,最后给出了基于BSD Socket的网络通信程序的具体实现方法。 相似文献
10.
11.
VxWorks是WindRiver公司开发的嵌入式实时操作系统,广泛地应用于航空航天、工业控制、通信等领域;在简单地介绍了VxWorks操作系统之后,分析了VxWorks下CPCI设备驱动程序的实现方法;以CPCI9112数据采集卡的驱动程序开发为例,介绍了CompactPCI总线以及PCI接口芯片S5935,重点说明了在VxWorks下以定时器和中断方式实现模数转换驱动程序的方法和编程要点,并给出了部分关键代码;在飞行控制半实物仿真系统中的运行结果表明驱动程序运行稳定、可靠. 相似文献
12.
CIDF的组件通信分析和算法描述 总被引:4,自引:0,他引:4
介绍了CIDF(通用入侵检测框架)基本结构。针对IDS组件在本地和远端两种情况下的组件通信机制进行了深入的分析。并在分析的基础上,提出了基于CIDF框架的组件通信过程的可行性算法描述。 相似文献
13.
VxWorks环境下BAN交换机驱动程序的设计与实现 总被引:3,自引:0,他引:3
VxWorks是一种实时的嵌入式操作系统,它的模块化设计使得应用代码与硬件充分隔器,为应用程序的移植提供了方便,本文主要从VxWorks环境下数据链路层和网络层结构的模型入手,根据我们自行研制的小区交换机的实际情况,详细阐述了BAN交换机驱动程序的设计思想以及系统函数和任务函数的实现过程。 相似文献
14.
软件防篡改技术研究 总被引:3,自引:0,他引:3
随着软件产业的不断发展,对软件知识产权的保护已成为一个引人关注的重要问题.目前,对知识产权的攻击方式主要有三种:软件盗版(Software Piracy),逆向工程(Reserve Engineering)、代码篡改(Code Tamper),对应的防御措施主要有软件水印技术(Software Watermarking)、代码模糊(Code Obfuscation)、软件防篡改(Software Tamper-proofing).此外,还有多样性(Diversity)、时间限制模式(Time-limited Scheme)等方法.详细介绍了软件防篡改技术,对它的分类、现状、现存机制以及下一步的发展方向做了较深入的分析. 相似文献
15.
并行多任务分配是多agent系统中极具挑战性的课题, 主要面向资源分配、灾害应急管理等应用需求, 研究如何把一组待求解任务分配给相应的agent联盟去执行. 本文提出了一种基于自组织、自学习agent的分布式并行多任务分配算法, 该算法引入P学习设计了单agent寻找任务的学习模型, 并给出了agent之间通信和协商策略. 对比实验说明该算法不仅能快速寻找到每个任务的求解联盟, 而且能明确给出联盟中各agent成员的实际资源承担量, 从而可以为实际的控制和决策任务提供有价值的参考依据. 相似文献
16.
Yasuyoshi Yokokohji Yoshihiro Kawai Mizuho Shibata Yasumichi Aiyama Shinya Kotosaka Wataru Uemura 《Advanced Robotics》2019,33(17):876-899
ABSTRACTThe World Robot Summit (WRS) is a robotic ‘challenge and exposition’ organized by the Japanese government to accelerate social implementation, research and development of robots working in realistic daily life, society, and industrial fields. In this paper, we introduce a robot competition of the Industrial Robotics Category of the WRS, called ‘Assembly Challenge’, which is organized by the WRS Industrial Robotics Competition Committee in order to promote the development of the next-generation production systems that can respond to new production demands in agile and lean manners. Prior to the main competition in 2020, a pre-competition was held in 2018 with 16 participating teams from around the world. In this paper, we introduce the contents and results of this pre-competition, analyze the results, and give a perspective for the 2020 main competition. 相似文献
17.
Xiaoyong Tang Kenli Li Renfa Li Bharadwaj Veeravalli 《Journal of Parallel and Distributed Computing》2010
Heterogeneous computing systems are promising computing platforms, since single parallel architecture based systems may not be sufficient to exploit the available parallelism with the running applications. In some cases, heterogeneous distributed computing (HDC) systems can achieve higher performance with lower cost than single-machine supersystems. However, in HDC systems, processors and networks are not failure free and any kind of failure may be critical to the running applications. One way of dealing with such failures is to employ a reliable scheduling algorithm. Unfortunately, most existing scheduling algorithms for precedence constrained tasks in HDC systems do not adequately consider reliability requirements of inter-dependent tasks. In this paper, we design a reliability-driven scheduling architecture that can effectively measure system reliability, based on an optimal reliability communication path search algorithm, and then we introduce reliability priority rank (RRank) to estimate the task’s priority by considering reliability overheads. Furthermore, based on directed acyclic graph (DAG) we propose a reliability-aware scheduling algorithm for precedence constrained tasks, which can achieve high quality of reliability for applications. The comparison studies, based on both randomly generated graphs and the graphs of some real applications, show that our scheduling algorithm outperforms the existing scheduling algorithms in terms of makespan, scheduling length ratio, and reliability. At the same time, the improvement gained by our algorithm increases as the data communication among tasks increases. 相似文献
18.
Andreas Witzel Krzysztof R. Apt Jonathan A. Zvesper 《Autonomous Agents and Multi-Agent Systems》2012,25(2):395-418
We characterize epistemic consequences of truthful communication among rational agents in a game-theoretic setting. To this
end we introduce normal-form games equipped with an interaction structure, which specifies which groups of players can communicate
their preferences with each other. We then focus on a specific form of interaction, namely a distributed form of iterated
elimination of strictly dominated strategies (IESDS), driven by communication among the agents. We study the outcome of IESDS
after some (possibly all) messages about players’ preferences have been sent. The main result of the paper, Theorem 4, provides
an epistemic justification of this form of IESDS. 相似文献
19.