期刊:
International Review on Computers and Software,2011年6(6):1117-1121 ISSN:1828-6003
通讯作者:
Liu, S.
作者机构:
[Liu, Shukun; Chen, Jifeng] Department of Computer Science and Technology, Hunan International Economics University, Changsha 410205, China;[Yang, Xiaohua] Department of Computer Science and Technology, University of South China, Hengyang 421001, China
通讯机构:
Department of Computer Science and Technology, Hunan International Economics University, China
作者机构:
[Liu Shukun] Hunan Int Econ Univ, Dept Comp, Changsha, Hunan, Peoples R China.;[Yang Xiaohua] Univ South China, Dept Comp Sci & Technol, Hengyang, Hunan, Peoples R China.
通讯机构:
[Liu Shukun] H;Hunan Int Econ Univ, Dept Comp, Changsha, Hunan, Peoples R China.
会议名称:
International Conference on Advanced Measurement and Test (AMT 2010)
会议时间:
MAY 15-16, 2010
会议地点:
Sanya, PEOPLES R CHINA
会议主办单位:
[Liu Shukun] Hunan Int Econ Univ, Dept Comp, Changsha, Hunan, Peoples R China.^[Yang Xiaohua] Univ South China, Dept Comp Sci & Technol, Hengyang, Hunan, Peoples R China.
会议论文集名称:
Advanced Materials Research
关键词:
Class dependence graph;Hierarchy slicing;Program analysis;Program slicing
摘要:
Program analysis plays an important role in software development and maintenance. With this method, characteristics of every variable in program can be analyzed. During the period of program analyzing, computing the program slicing by the method of constructing system dependence graph is an efficient way but the work of constructing the system dependence graph is very complicated which often leads to many wrong results. So the algorithm of hierarchy slice is used in this paper. Using the precise results, the whole program can be analyzed and the dependence relation in the program can be discovered quickly.
作者:
Zhiming Liu 0003;Yaping Wan;Jichang Sha;Xiaohua Yang
期刊:
International Journal of Information Processing and Management,2010年1(2):58-67 ISSN:2093-4009
通讯作者:
Wan, Y.
作者机构:
College of Information System and Management, National University of Defense Technology, Changsha 410073, China;Computer Department, HuaZhong University of Science and Technology, Wuhan, 430074, China;School of Computer Science and Technology, Nanhua University, Hengyang 421001, China
通讯机构:
School of Computer Science and Technology, Nanhua University, China
摘要:
Peer-to-Peer(P2P) systems have been one of the hottest research issues for its attractive advantages, such as self-organizing, scalability and fault tolerance. However, super node failure is a serious problem because of the high dynamic and untrusted peers. A super node election mechanism is implemented, which included four basic components: The registration center module, group membership maintenance module, fault detector and super node election algorithm. The system constantly detects failure, at the same time, gathers the statistics of the online rate and fault detection message response time of each node. It only takes less computing and storage resource to master the node "active" state and distribution, without increasing too much additional works. The results show that average service recovery time and average error rates of a super node election service presented by this paper are less than Toung's S1, while the availability of service is close or slightly lower than the S3. It achieves the desired effect of the experiment that while maintaining the availability under certain conditions, it can reduce error rate and service recovery time, thereby increasing the reliability of P2P system. In addition, this realization of the super node service mechanism can be deployed flexibly according to user needs and can provide convenience for the future implementation of solutions.