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

SIGNGD with Error Feedback Meets Lazily Aggregated Technique:Communication-Efficient Algorithms for distributed Learning

引用

Tsinghua Science and Technology 2022年第1期27卷 174-185页

作者： Xiaoge Deng Tao Sun Feng Liu Dongsheng Li National Laboratory for Parallel and Distributed Processing(PDL) College of ComputerNational University of Defense TechnologyChangsha 410073China

The proliferation of massive datasets has led to significant interests in distributed algorithms for solving large-scale machine learning ***,the communication overhead is a major bottleneck that hampers the scalability of distributed machine learning *** this paper,we design two communication-efficient algorithms for distributed learning *** first one is named EF-SIGNGD,in which we use the 1-bit(sign-based) gradient quantization method to save the communication ***,the error feedback technique,i.e.,incorporating the error made by the compression operator into the next step,is employed for the convergence *** second algorithm is called LE-SIGNGD,in which we introduce a well-designed lazy gradient aggregation rule to EF-SIGNGD that can detect the gradients with small changes and reuse the outdated ***-SIGNGD saves communication costs both in transmitted bits and communication ***,we show that LE-SIGNGD is convergent under some mild *** effectiveness of the two proposed algorithms is demonstrated through experiments on both real and synthetic data.

关键词： distributed learning communication-efficient algorithm convergence analysis

来源：评论

学校读者我要写书评

暂无评论

Axiomatizing extended temporal logic fragments via instantiation

Axiomatizing extended temporal logic fragments via instantia...

引用

4th International Colloquium on Theoretical Aspects of Computing (ICTAC 2007)

作者： Liu, Wanwei Wang, Ji Dong, Wei Chen, Huowang National Laboratory of Parallel and Distributed Processing China

ISBN: (纸本)9783540752905

ETLs are temporal logics employing w-automata as temporal connectives. This paper presents sound and complete axiom systems for ETLl, ETLf, and ETLr, respectively. Axioms and rules reflecting temporal behaviors of looping, finite and repeating automaton connectives are provided. Moreover, by encoding temporal operators into automaton connectives and instantiating the axioms and rules relating to automaton connectives, one may derive axiom systems for given ETL fragments.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Service fault tolerance for highly reliable service-oriented systems: an overview

引用

Science China(Information Sciences) 2015年第5期58卷 7-18页

作者： ZHENG ZiBin LYU Michael Rung Tsong WANG HuaiMin Shenzhen Research Institute The Chinese University of Hong Kong National Laboratory for Parallel & Distributed Processing National University of Defense Technology

Service-oriented systems are widely-employed in e-business, e-government, finance, management systems, and so on. Service fault tolerance is one of the most important techniques for building highly reliable service-oriented systems. In this paper, we provide an overview of various service fault tolerance techniques,including sections on fault tolerance strategy design, fault tolerance strategy selection, and Byzantine fault tolerance. In the first section, we introduce the design of static and dynamic fault tolerance strategies, as well as the major problems when designing fault tolerance strategies. After that, based on various fault tolerance strategies, in the second section, we identify significant components from a complex service-oriented system, and investigate algorithms for optimal fault tolerance strategy selection. Finally, in the third section, we discuss a special type of service fault tolerance techniques, i.e., the Byzantine fault tolerance.

关键词： fault tolerance software reliability Web service SOA

来源：评论

学校读者我要写书评

暂无评论

A fast successive over-relaxation algorithm for force-directed network graph drawing

引用

Science China(Information Sciences) 2012年第3期55卷 677-688页

作者： WANG YongXian & WANG ZhengHua national key laboratory for parallel and distributed processing, national University of Defense Technology, Changsha 410073, China 1. National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation (SOR) strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.

关键词： graph drawing graph layout successive over-relaxation force-directed algorithm

来源：评论

学校读者我要写书评

暂无评论

Surveying concurrency bug detectors based on types of detected bugs

引用

Science China(Information Sciences) 2017年第3期60卷 5-31页

作者： Zhendong WU Kai LU Xiaoping WANG Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology

Concurrency bugs widely exist in concurrent programs and have caused severe failures in the real world. Researchers have made significant progress in detecting concurrency bugs, which improves software reliability. In this paper, we survey the most up-to-date and well-known concurrency bug detectors. We categorize the existing detectors based on the types of concurrency bugs. Consequently, we analyze data race detectors, atomicity violation detectors, order violation detectors, and deadlock detectors, respectively. We also discuss some other techniques which are mostly related to concurrency bug detection, including schedule bounding techniques, interleaving optimizing techniques, path expanding techniques, and deterministic replay techniques. Additionally, we statistically analyze the reviewed detectors and get some interesting findings, for instance, nearly 86% of previous detectors focus on data races and atomicity violations, and dynamic approaches are popular(74%). We also discuss the limitations of previous detectors, finding that 91% of previous detectors suffer from false negatives and 64% of previous detectors suffer from runtime overhead. Based on the reviewed detectors and statistical analysis, we conclude some future research directions, including accuracy, performance,applicability, and integrality.

关键词： concurrency bug detection data race atomicity violation order violation deadlock

来源：评论

学校读者我要写书评

暂无评论

A Programming Language Approach to Internet-Based Virtual Computing Environment

引用

Journal of Computer Science & Technology 2011年第4期26卷 600-615页

作者：王戟沈锐王怀民 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology

There is an increasing need to build scalable distributed systems over the Internet infrastructure. However the development of distributed scalable applications suffers from lack of a wide accepted virtual computing environment. Users have to take great efforts on the management and sharing of the involved resources over Internet, whose characteristics are intrinsic growth, autonomy and diversity. To deal with this challenge, Internet-based Virtual Computing Environment （iVCE） is proposed and developed to serve as a platform for distributed scalable applications over the open infrastructure, whose kernel mechanisms are on-demand aggregation and autonomic collaboration of resources. In this paper, we present a programming language for iVCE named Owlet. Owlet conforms with the conceptual model of iVCE, and exposes the iVCE to application developers. As an interaction language based on peer-to-peer content-based publish/subscribe scheme, Owlet abstracts the Internet as an environment for the roles to interact, and uses roles to build a relatively stable view of resources for the on-demand resource aggregation. It provides language constructs to use 1） distributed event driven rules to describe interaction protocols among different roles, 2） conversations to correlate events and rules into a common context, and 3） resource pooling to do fault tolerance and load balancing among networked nodes. We have implemented an Owlet compiler and its runtime environment according to the architecture of iVCE, and built several Owlet applications, including a peer-to-peer file sharing application. Experimental results show that, with iVCE, the separation of resource aggregation logic and business logic significantly eases the process of building scalable distributed applications.

关键词： distributed architecture distributed programming on demand aggregation virtual computing

来源：评论

学校读者我要写书评

暂无评论

ARV-based array grouping and data distribution in OpenMP/JIAJIA

ARV-based array grouping and data distribution in OpenMP/JIA...

引用

6th International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT 2005)

作者： Zeng, LF Yang, XJ Huangchun National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)0769524052

In order to improve the performance of applications on OpenMP/JIAJIA, we present a new abstraction, Array Relation Vector (ARV), to describe the relation between the data elements of two consistent shared arrays accessed in one computation phase. Based on ARV, we use array grouping to eliminate the pseudo data distributing of small shared data and improve the page locality. Experimental results show that ARV-based array grouping can greatly improve the performance of applications with non-continuous data access and strict access affinity on OpenMP/JIAJIA cluster. For applications with small shared arrays, array grouping can improve the performance obviously when the processor number is small.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Cooperative monitoring BGP among autonomous systems

引用

Security and Communication Networks 2015年第10期8卷 1943-1957页

作者： Hu, Ning Wang, BaoSheng Liu, Xin National Key Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

As the de facto Internet inter-domain routing protocol, BGP protocol has a number of vulnerabilities and weakness. Monitoring BGP is an effective way to improve the security of inter-domain routing. This paper presents a cooperative BGP monitoring method, which is called cooperative information sharing model (CoISM). CoISM is based on self-organization and can be used to solve some problems during BGP monitoring, such as route validation and bogus route notification delivery. CoISM provides autonomous systems with a more comprehensive information view by introducing information diffuse reflection based on initiative inquiry and making use of the relativity of monitoring information. CoISM optimizes the information transmission by leveraging the data locality caused by BGP policy and implements ISP coordination with low communication and deployment cost. More specifically, CoISM provides a self-organizing and incentive mechanism, which drives autonomous systems to coordinate independently and shares information on-demand. CoISM supports incremental deployment and can also be applied to a wide range of inter-domain cooperative management applications such as inter-domain routing failure analysis and intrusion detection. © 2014 John Wiley & Sons, Ltd.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

MCHITS: Monte carlo based method for hyperlink induced topic search on networks

引用

Journal of Networks 2013年第10期8卷 2376-2382页

作者： Jin, Zhaoyan Shi, Dianxi Wu, Quanyuan Fan, Hua National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

Hyperlink Induced Topic Search (HITS) is the most authoritative and most widely used personalized ranking algorithm on networks. The HITS algorithm ranks nodes on networks according to power iteration, and has high complexity of computation. This paper models the HITS algorithm with the Monte Carlo method, and proposes Monte Carlo based algorithms for the HITS computation. Theoretical analysis and experiments show that the Monte Carlo based approximate computing of the HITS ranking reduces computing resources a lot while keeping higher accuracy, and is significantly better than related works. © 2013 ACADEMY PUBLISHER.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Computing Must and May Alias to Detect Null Pointer Dereference

Computing Must and May Alias to Detect Null Pointer Derefere...

引用

3rd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation

作者： Ma, Xiaodong Wang, Ji Dong, Wei National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)9783540884781

This paper presents a novel algorithm to detect null pointer dereference errors. The algorithm utilizes both of the must and may alias information in a compact way to improve the precision of the detection. Using may alias information obtained by a fast flow- and context- insensitive analysis algorithm, we compute the must alias generated by the assignment statements and the must alias information is also used to improve the precision of the may alias. We can strong update more expressions using the must alias information, which will reduce the false positives of the detection for null pointer dereference. We have implemented our algorithm in the SUIF2 compiler infrastructure and the experiments results are as expected.

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：