一种无死锁的时间管理算法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National High-Tech Research and Development Plan of China under Grant No.2001AA115127 (国家高技术研究发展计划(863)); the National Grand Fundamental Research 973 Program of China under Grant No.G1999032703 (国家重点基础研究发展规划(973))


A Non-Deadlock Time Management Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    高层体系结构HLA(high level architecture)是美国国防部提出的建模和仿真的标准,时间管理服务是其重要的组成部分,而GALT(greatest available logical time)的计算是RTI(runtime infrastructure)时间管理服务实现的核心技术.GALT算法容易导致死锁,继而导致整个仿真无法推进.在Frederick Kuhl算法的基础上探讨了死锁产生时系统所特有的一些规律,得出了一些重要结论:如果系统处于死锁状态,则所有盟员的GALT和输出时间一定分别相等,并且GALT一定等于输出时间;所有Lookahead大于0的盟员一定处于NMR/NMRA推进状态而不会处于其他推进状态(TAR/TARA/FQR).最后提出了基于"身高测量法"的无死锁的GALT算法,"身高测量法"为RTI中时间管理模块的实现提供了可靠保证.

    Abstract:

    HLA (high level architecture) is the standard for modeling and simulation put forward by the American Department of Defense. Time management is an important component of HLA while GALT (greatest available logical time) algorithm is RTI (runtime infrastructure)抯 critical technology in implementing time management. An improper GALT algorithm can easily result in a deadlock so that the whole federation can not advance any more. On the basis of the GALT algorithm introduced by Frederick Kuhl, the principles of deadlock are discussed and some important results are revealed in this paper. If deadlock occurs in a simulation, all federates must have the same GALT and the same output time respectively, and GALT is also equal to output time, and a federate whoselookahead is greater than zero must suspend because of a NMR or NMRA request, other than a TAR, TARA or FQR request. Finally, a GALT algorithm without deadlock is also brought forward in this paper that is calledStature-Measuring, and this algorithm can provide reliable technology support to develop time management services of RTI.

    参考文献
    相似文献
    引证文献
引用本文

刘步权,王怀民,姚益平.一种无死锁的时间管理算法.软件学报,2003,14(9):1515-1522

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2002-07-19
  • 最后修改日期:2003-03-20
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号