摘要
针对主从通信数据流冗余、实时性差问题,分析传统通信协议特点,提出块、离散、混合三种协议策略。通过建立地址集合通信延迟协议性能描述模型,分别证明动态规划、贪心算法求解块、离散策略最优地址组帧解的完备性,并用二元任务分优先级的通信架构解决了遗传算法在求解混合协议时实时性差的瓶颈。通过实验,分析三种策略随读写内存地址分布的适用情况,表明混合协议策略具普适性。
To solve the problems in master-slave communications such as redundant data streaming and poor timeliness,by analyzing the characteristics of traditional communication protocols,three protocol strategies,respectively,the blocky,the discrete and the mixed,are proposed.Through establishing an address collection communication delay protocol performance description model,not only the completeness of dynamic planning,greedy algorithm resolving block and discrete strategy optimal address group frame solving is separately validated,but also the bottleneck of poor timeliness in solving the mixed protocol for Genetic Algorithm is remedied by means of dual tasks prioritized communication architecture.Through experiments,the suitability of the read-write memory address distribution of the three strategies are analyzed,so that it is illustrated that the mixed protocol strategy is universally applicable.
出处
《计算机应用与软件》
CSCD
北大核心
2012年第1期241-244,共4页
Computer Applications and Software
关键词
主从通信
协议策略
优化算法
遗传算法
Master-slave communication Protocol strategy Optimization algorithm Genetic Algorithm