检索结果-内蒙古大学图书馆

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Wei Dong Ji Wang Changzhi Zhao Xian Zhang Jie Tian School of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing China

The paper presents the ongoing work of studying FMEA method for embedded safely critical software via formal analysis of various dependence relations among software elements, which can fairly improve the automation and precision of both system level and detailed level FMEA. These dependence relations are depicted by the formal models abstracted from software design and implementation, and the FMEA processes for both structural and object-oriented software are proposed respectively. The initial result of case study shows the effectiveness of the approach.

关键词： Software Unified modeling language Safety Aircraft Object oriented modeling Atmospheric modeling Software reliability

来源：评论

学校读者我要写书评

暂无评论

Compiler-Assisted Application-Level Checkpointing for MPI Programs

Compiler-Assisted Application-Level Checkpointing for MPI Pr...

引用

IEEE International Conference on distributed Computing Systems

作者： Xuejun Yang Panfeng Wang Hongyi Fu Yunfei Du Zhiyuan Wang Jia Jia National Laboratory for Parallel & Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424431748

Application-level checkpointing can decrease the overhead of fault tolerance by minimizing the amount of checkpoint data. However this technique requires the programmer to manually choose the critical data that should be saved. In this paper, we firstly propose a live-variable analysis method for MPI programs. Then, we provide an optimization method of data saving for application-level check-pointing based on the analysis method. Based on the theoretical foundation, we implement a source-to-source pre-compiler (ALEC) to automate application-level checkpointing. Finally, we evaluate the performance of five FOR-TRAN/MPI programs which are transformed and integrated checkpointing features by ALEC on a 512-CPU cluster system. The experimental results show that i)the application-level checkpointing based on live-variable analysis for MPI programs can efficiently reduce the amount of checkpoint data, thereby decrease the overhead of checkpoint and restart;ii)ALEC is capable of automating application-level checkpointing correctly and effectively.

关键词： checkpointing message passing mannose phosphate isomerase remote procedure calls artificial lung expanding compound optimization method Checkpoints Computer personnel Fault tolerance application layer

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of Application-Level Checkpoints

Optimal Placement of Application-Level Checkpoints

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Panfeng Wang Zhiyuan Wang Yunfei Du Xuejun Yang Haifang Zhou National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

One of the basic problems related to the efficient application-level checkpointing is the placement of checkpoints in the source codes. In this paper we discuss two common questions with a source-to-source precompiler ALEC: 1) if there are N checkpoints in the application's source code, how to pick M checkpoints out of them minimizing the total amount of checkpoint data? 2) if there are no checkpoint in the application's source code, how to insert a set of checkpoints minimizing the amount of checkpoint data? We reveal that these two questions can both be abstracted as a mathematic model which is similar to the 0-1 integer programming model, and the model can be solved using implicit enumeration method. The solving methods proposed in the paper have been implemented and integrated into ALEC. Experimental results show that the method is efficient.

关键词： Checkpointing Fault tolerance Fault tolerant systems Program processors Computers Flow graphs Data structures

来源：评论

学校读者我要写书评

暂无评论

Static Analysis for Application-Level Checkpointing of MPI Programs

Static Analysis for Application-Level Checkpointing of MPI P...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Panfeng Wang Yunfei Du Hongyi Fu Xuejun Yang Haifang Zhou National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

Application-level checkpointing is a promising technology in the domain of large-scale scientific computing. The consistency of global checkpoint must be carefully guaranteed in order to correctly restore the computation. Usually, some complex coordinated protocols are employed to ensure the consistency of global checkpoint, which require logging orphan or in-transit messages during checkpointing. These protocols complicate the recovery of the computation and increase the checkpoint overhead due to logging message. In this paper, a new method which ensures the consistency of global checkpoint by static analysis is proposed. The method identifies the safe checkpointing regions in MPI programs, where the global checkpoint is always strongly consistent. All checkpoints are located in those safe checkpoint regions. During checkpointing, the method will not log any messages and introduce no extra overhead. The method was implemented and integrated into ALEC, which is a source-to-source precompiler for automating application-level checkpointing. The experimental results show that our method is effective.

关键词： Checkpointing Algorithms Flow graphs Protocols Fault tolerance Fault tolerant systems parallel machines

来源：评论

学校读者我要写书评

暂无评论

Modelling with relational calculus of object and component systems - RCOS

Modelling with relational calculus of object and component s...

引用

作者： Chen, Zhenbang Hannousse, Abdel Hakim Van Hung, Dang Knoll, Istvan Li, Xiaoshan Liu, Zhiming Liu, Yang Nan, Qu Okika, Joseph C. Ravn, Anders P. Stolz, Volker Yang, Lu Zhan, Naijun International Institute for Software Technology United Nations University China Faculty of Science and Technology University of Macau Department of Computer Science Aalborg University Denmark Lab. of Computer Science Institute of Software CAS China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540852883

This chapter presents a formalization of functional and behavioural requirements, and a refinement of requirements to a design for CoCoME using the Relational Calculus of Object and Component Systems (rCOS). We give a model of requirements based on an abstraction of the use cases described in Chapter 3.2. Then the refinement calculus of rCOS is used to derive design models corresponding to the top level designs of Chapter 3.4. We demonstrate how rCOS supports modelling different views and their relationships of the system and the separation of concerns in the development. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

distributed Line Graphs: A Universal Framework for Building DHTs Based on Arbitrary Constant-Degree Graphs

Distributed Line Graphs: A Universal Framework for Building ...

引用

International Conference on distributed Computing Systems

作者： Yiming Zhang Ling Liu Dongsheng Li Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Georgia Institute of Technology College of Computing Georgia Institute of Technology Atlanta USA

ISBN: (纸本)9781424431748

Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG), a universal framework for building DHTs based on arbitrary constant-degree graphs. We prove that in a DLG-enabled, N-node DHT, the out-degree is d, the in-degree is between 1 and 2d, and the diameter is less than 2(log d N-log d N 0 +D 0 +1), where d, D 0 and N 0 represent the degree, diameter and number of nodes of the initial graph, respectively. The maintenance cost of DLG-enabled DHTs is O(log d N). We show the power of DLG technique by applying it to Kautz graphs to propose a new DHT scheme.

关键词： Routing Maintenance engineering Buildings Distance measurement Topology Industries Construction industry

来源：评论

学校读者我要写书评

暂无评论

Flexible Routing in Grouped DHTs

Flexible Routing in Grouped DHTs

引用

International Conference on Peer-to-Peer Computing

作者： Yiming Zhang Dongsheng Li Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve this, in this paper we present grouped tapestry (GTap), a novel tapestry-based DHT that supports organizing nodes into groups and allows flexible DHT routing. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.

关键词： Routing Fingers Peer to peer computing Maintenance engineering Security Availability Data structures

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach for Point Coverage Problem of Sensor Network

An Efficient Approach for Point Coverage Problem of Sensor N...

引用

International Symposium on Electronic Commerce and Security

作者： GaoJun Fan Feng Liang ShiYao Jin National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China Military Representative Office of Navy Chinese Shipbuilding Company Limited Shanghai China

ISBN: (纸本)9780769532585

One fundamental issue in application of wireless sensor networks is to provide proper coverage of their deployment regions, which answers the questions about the quality of service (surveillance or monitoring) that can be provided by a sensor network. In this paper, we consider the point-coverage problem where a given set of n points requires to be covered in the two-dimension (such as monitoring leakage of hazardous gaseous materials at ventilation points or observing the fixed location important targets). Our objective is to place the minimal number sensors such that coverage points in the field can be covered by at least k sensors. By combining computational geometry and combinatorics techniques, we investigate the issue from a different angle, demonstrate an important relationship between coverage points and sensors, and develop an efficient algorithm for 1-coverage problem. Finally, we indicate our approach can easily solve k-coverage problem based on 1-coverage.

关键词： Wireless sensor networks Sensors Monitoring Ad hoc networks Tin Computational geometry Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Efficient search algorithm for large-scale P2P systems

引用

Ruan Jian Xue Bao/Journal of Software 2008年第6期19卷 1473-1480页

作者： Zhang, Yi-Ming Lu, Xi-Cheng Zheng, Qian-Bing Li, Dong-Sheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

This paper presents a search algorithm called probabilistic search team (PST). In PST, all nodes advertise their resource sharing information, maintain and broadcast the information based on DDBF (distributed discarding bloom filter), which discards some information when transmitted to their neighbors. During the search process, PST extends the concept of walker in RW to search team. PST realizes collaborative and parallel search of multiple search teams by aggregating the resource information obtained in search process. Experimental results show that PST achieves a good tradeoff between performance and overhead.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Review on bioinformatics analysis of genome-scale metabolic network decomposition

引用

Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology 2008年第3期30卷 48-52页

作者： Wang, Zheng-Hua Zhou, Ting-Ting National Laboratory for Parallel and Distributed Processing National Univ. of Defense Technology Changsha 410073 China

As the large-scale data on molecular interaction available increases, the study on biological networks has ignited more and more attention. As the execution level of cellular functions, the structural composition of metabolic networks not only reflects the execution of cellular functions step by step, but also influences the pathway analysis of metabolic engineering. Hence, as a key step, a sound decomposition of global metabolic networks is not only significant for further exploring the structure and function of genome-scale biological networks, but also necessary for favorably developing the pathway analysis of metabolic engineering. Having reviewed the fruitful study of the macro-structure and topological characteristics, and analyzed some available decomposition approaches, this paper concludes that the lack of reasonable and purposeful evaluation criterions is one urgent problem in the present study of metabolic network decomposition. Besides, the future trend is to develop more effective decomposition models with more information and by more advanced approaches, as well as expanding the application range of network decomposition.

关键词： Bioinformatics Evaluation criterion Metabolic network Network decomposition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：