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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3358卷 433-445页

作者： Yan, Jiong Wang, Ji Chen, Huo-Wang National Laboratory for Parallel and Distributed Processing Changsha China

It is necessary to assess the reliability of distributed safety-critical systems to a high degree of confidence before they are deployed in the field. However, distributed safety-critical software systems often include some rarely executed critical functions that are often inadequately tested in statistical testing based reliability estimation. This paper presents a method that can accelerate statistical testing of distributed safety-critical software. The method starts with the derivation of scenario usage diagram model (SUD) from UML diagrams annotated with usage related attributes and reliability attributes. Then the statistical testing accelerating method based on importance sampling is presented. When both the critical scenarios and the entire software are adequately tested, the method can still compute the unbiased software reliability from the test results with much less test cases. Thus, the statistical testing cost of distributed safety-critical software can be reduced effectively. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

Overlay technologies for internet-based virtual computing environment

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第9期31卷 1516-1524页

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

Internet resources have the natural characteristics of growth, autonomy and diversity, which have brought great challenges to the efficient aggregation of these resources. Utilizing overlay to organize resources and support efficient resource discovery is an important approach to aggregate resources on-demand in Internet-based Virtual Computing Environment (iVCE). This paper gives an overview of research advances on overlay technologies in iVCE. To adapt to the growth and autonomy of Internet resources, an overlay topology construction mechanism based on Kautz graph is first introduced, and it is extended to a universal method for constructing overlay topologies based on arbitrary regular graphs. To adapt to the diversity of Internet resources, a grouped overlay topology construction mechanism is then proposed. Based on the overlay constructed above, an efficient range query scheme is presented, and the optimization methods of overlay topology as well as other complex query techniques are discussed.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

CRAWL: A Trace Routing Algorithm Based on Hybrid Two-Layer Topology 33rd

CRAWL: A Trace Routing Algorithm Based on Hybrid Two-Layer T...

引用

33rd International Conference on Advanced Information Networking and Applications, AINA 2019

作者： Zheng, Li-ming Long, Wen-feng Liu, Yu-Jia Sun, Wei-dong Department of Message Communication Armed Police Officer Academy Chengdu China National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9783030150341

Data distribution is a key technology for resources convergence and sharing in distributed environment. To better meet the requirement for real time data distribution in the dynamic network, a trace routing algorithm named CRAWL based on the hybrid two-layered topology is put forward. The algorithm contains an overlay topology named CBDLO, upper of which consists of multiple distributed balanced binary trees corresponding to different properties and the lower of which is an unstructured topology. CRAWL forwards the data on the lower unstructured topology in the form of random walk, so that the data can be sent to the corresponding upper topology entry. It also includes a matching algorithm named CDM for the parallel matching data properties on the upper distributed and balanced binary tree and transmitting the matched data to the nodes that are interested in the data. The experimental results show that the algorithm can effectively support large-scale data distribution in a dynamical network, reduce distribution overhead and matching delays. © 2019, Springer Nature Switzerland AG.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Mbapp: Efficient Memory-Balanced Pipeline parallelism for Large Model Fine-Tuning on Commodity GPU Servers 24

Mbapp: Efficient Memory-Balanced Pipeline Parallelism for La...

引用

5th International Conference on Computer Information and Big Data Applications, CIBDA 2024

作者： Liu, Yujie Lai, Zhiquan Li, Dongsheng National Key Laboratory of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410000 China

ISBN: (纸本)9798400718106

Large-scale models have demonstrated outstanding performance across various downstream tasks. Pipeline parallelism is essential for fine-tuning large models on commodity GPU servers, as it plays a crucial role in making their exceptional performance more accessible and widespread. Existing approaches have encountered challenges in attaining effective memory-balanced pipeline parallelism. This paper presents a novel memory load-balanced pipeline parallel solution that aims to distribute memory usage evenly across stages on commodity GPU servers by leveraging NVLink bridges. The solution presents a novel approach for transferring data from GPUs to CPUs through the PCI-e link between adjacent GPUs interconnected by the NVLink bridge. Moreover, our methodology orchestrates data transfer operations to reduce offloading latency during the fine-tuning of large models. The evaluation demonstrates that our approach enhances switching efficiency by 1.46x to 1.76x and improves throughput by 2.04x to 3.59x compared to the PyTorch offloading technique. © 2024 ACM.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Stateful dynamic partial-order reduction

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2006年 4260 LNCS卷 149-167页

作者： Yi, Xiaodong Wang, Ji Yang, Xuejun National Laboratory for Parallel and Distributed Processing Changsha China

ISBN: (纸本)3540474609

State space explosion is the main obstacle for model checking concurrent programs. Among the solutions, partial-order reduction (POR), especially dynamic partial-order reduction (DPOR) [1], is one of the promising approaches. However, DPOR only supports stateless explorations for acyclic state spaces. In this paper, we present the stateful DPOR approach for may-cyclic state spaces, which naturally combines DPOR with stateful model checking to achieve more efficient reduction. Its basic idea is to summarize the interleaving information for all transition sequences starting from each visited state, and infer the necessary partial-order information based on the summarization when a visited state is encountered again. Experiment results on two programs coming from [1] show that both of the costs of space and time could be remarkably reduced by stateful DPOR with rather reasonable extra memory overhead. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A novel rough set approach for classification

A novel rough set approach for classification

引用

2006 IEEE International Conference on Granular Computing

作者： Zhang, Li-Juan Li, Zhou-Jun National Laboratory for Parallel and Distributed Processing Changsha 410073 China School of Computer Science and Engineering Beihang University Beijing 100083 China

ISBN: (纸本)1424401348

Rough set theory has been widely and successfully used in data mining, especially in classification field. But most existing rough set based classification approaches require computing optimal attribute reduction, which is usually intractable and many problems related to it have been shown to be NT-hard. Although approximate algorithms exist, they also tend to be computationally expensive. This paper presents a novel rough set method for classification, which does not require computing attribute reduction. It stepwise investigates condition attributes and outputs the classification rules induced by them, which is just like the strategy of "on the fly". The theoretical analysis and the empirical study show that the proposed method is effective and efficient. © 2006 IEEE.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Reducing repair traffic in P2P backup systems: Exact regenerating codes on hierarchical codes

Reducing repair traffic in P2P backup systems: Exact regener...

引用

作者： Huang, Zhen Biersack, Ernst Peng, Yuxing Department of Computer National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan 410073 China Eurecom Sophia Antipolis France

Peer to peer backup systems store data on "unreliable" peers that can leave the system at any moment. In this case, the only way to assure durability of the data is to add redundancy using either replication or erasure codes. Erasure codes are able to provide the same reliability as replication requiring much less storage space. Erasure coding breaks the data into blocks that are encoded and then stored on different nodes. However, when storage nodes permanently abandon the system, new redundant blocks must be created, which is referred to as repair. For "classical" erasure codes, generating a new block requires the transmission of k blocks over the network, resulting in a high repair traffic. Recently, two new classes of erasure codes, Regenerating Codes and Hierarchical Codes, have been proposed that significantly reduce the repair traffic. Regenerating Codes reduce the amount of data uploaded by each peer involved in the repair, while Hierarchical Codes reduce the number of nodes participating in the repair. In this article we propose to combine these two codes to devise a new class of erasure codes called ER-Hierarchical Codes that combine the advantages of both. © 2011 ACM.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

Media Access Control Protocol Based on Hybrid Antennas in Ad Hoc Networks

Media Access Control Protocol Based on Hybrid Antennas in Ad...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Yanrong Ding Xiaodong Wang Hu Shen Pengyu Guo National Key Laboratory for Parallel and Distributed Processing Changsha China

Nested Circular Directional MAC, a modified medium access control protocol of DMAC protocol, is proposed in this paper to support both directional antennas and omni-directional antennas simultaneously in one Ad Hoc network. Omni-directional antennas follow the RTS/CTS mechanism which is multi-hop and directional antennas follow the DRTS/DCTS mechanism, ensuring the asymmetric communication effectively. In order to resolve new deafness problem and hidden terminal problem, the directional antennas also use circular DRTS and nested antenna circumrotation. Simulation results show that NCDMAC supports hybrid antennas effectively and is better than MMAC and Circular-MAC in terms of increasing throughput, but it also increases the communication delay.

关键词： Delay Deafness Directive antennas Throughput Directional antennas Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

Efficient social network approximate analysis on blogosphere based on network structure characteristics

Efficient social network approximate analysis on blogosphere...

引用

3rd Workshop on Social Network Mining and Analysis, SNA-KDD '09

作者： Tang, Jintao Wang, Ting Wang, Ji Wei, Dengping School of Computer National University of Defense Technology ChangSha Hunan 410073 China National Laboratory for Parallel and Distributed Processing ChangSha Hunan 410073 China

ISBN: (纸本)9781605586762

As a typical social media in Web 2.0, blogs have attracted a surge of researches. Unlike the traditional studies, the social networks mined from Internet are very large, which makes a lot of social network analyzing algorithms to be intractable. According to this phenomenon, this paper addresses the novel problem of efficient social networks analyzing on blogs. This paper turns to account the structural characteristics of real large-scale complex networks, and proposes a novel shortest path approximate algorithm to calculate the distance and shortest path between nodes efficiently. The approximate algorithm then is incorporated with social network analysis algorithms and measurements for large-scale social networks analysis. We illustrate the advantages of the approximate analysis through the centrality measurements and community mining algorithms. The experiments demonstrate the effectiveness of the proposed algorithms on blogs, which indicates the necessity of taking account of the structural characteristics of complex networks when optimizing the analysis algorithms on large-scale social networks. Copyright 2009 ACM.

关键词： Blogs

来源：评论

学校读者我要写书评

暂无评论

Mixed Weighted Classification Loss Function and TFcaNet Attention Mechanism for Remote Sensing Images Object Detection 6

Mixed Weighted Classification Loss Function and TFcaNet Atte...

引用

2021 6th International Conference on Information Science, Computer Technology and Transportation, ISCTT 2021

作者： Wang, Junhua Jiang, Jingfei Xu, Jinwei Gu, Qinyi National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Department of Image Technology No.95806 Troop Beijing China

ISBN: (纸本)9783800757282

With the development of intelligent technology, the intelligent processing of remote sensing images has become a research hotspot and the object detection for remote sensing images is becoming more and more extensive. The characteristics of sample imbalance in categories, numerous small objects, and blurry object edges that remote sensing images contains bring huge challenges to object detection. Aiming at the characteristics of sample imbalance in categories of remote sensing images, we designed a mixed weighted classification loss function. At the same time, the TFcaNet attention mechanism is proposed to improve the capabilities of small objects detection and localization of the deep learning model. We create a model named YOLOv5-FRD based on YOLOv5. Through training and testing, the mAP on DOTA dataset reached 73.53%. Compared with the current mainstream one-stage models, YOLOv5-FRD achieves the second place in mAP and the highest AP in the most categories. © VDE VERLAG GMBH · Berlin · Offenbach.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：