Concurrent Redundancy Problem and Control Methods
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Data race is a difficult problem for the development and testing of the concurrent program. Research has found that data race may cause duplicate computing which may decrease a system’s performance. First, the concurrent computation redundancy problem (CCRP) is defined. The related performance index and judging methods are given, and the general concurrent redundancy control mechanism is designed. When CCRP is studied,the parallel program generally be analyzed based on a producer-consumer model. In the case of the producerconsumer model with data source, CCRP is analyzed in detail. The single condition and cross condition redundancycontrol algorithms have different application scopes and can be used as fixed patterns to solve CCRP. Relativeproperty proofs and simulations are given based on Petri net. The concurrent program experiments show that theconcurrent redundancy control is necessary and efficient. Two control algorithms are compared in the experiments.The research has reference value for data race detection and concurrent programming.

    Reference
    Related
    Cited by
Get Citation

何倩,孟祥武,陈俊亮,沈筱彦.并发计算重复问题与控制方法.软件学报,2011,22(10):2263-2278

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 23,2009
  • Revised:March 05,2010
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063