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

作者： Yuan, Yuan Huang, Zhen Liu, Shengyun Peng, Yuxing National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9783642277078

Efficient designs for intra-session network coding based practical applications largely rely on a better understanding on its queueing behaviors. However, few work devote on this topics. In this paper, we build a multi-channel batch service queueing system (MN/Dm/1) with control feedbacks to describe the decoding process of intra-session network coding with random linear codes and try to answer several fundamental questions, including for example, how to analyze braking redundancy? Under what condition is the system stable? How's quantitative relationship between the inter-decoding delay and the generation granularity? © 2012 Springer-Verlag GmbH Berlin Heidelberg.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Accurate and simplified prediction of L2 cache vulnerability for cost-efficient soft error protection

Accurate and simplified prediction of L2 cache vulnerability...

引用

作者： Cheng, Yu Ma, Anguo Zhang, Minxuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

Soft errors caused by energetic particle strikes in on-chip cache memories have become a critical challenge for microprocessor design. Architectural vulnerability factor (AVF), which is defined as the probability that a transient fault in the structure would result in a visible error in the final output of a program, has been widely employed for accurate soft error rate estimation. Recent studies have found that designing soft error protection techniques with the awareness of AVF is greatly helpful to achieve a tradeoff between performance and reliability for several structures (i.e., issue queue, reorder buffer). Considering large on-chip L2 cache, redundancy-based protection techniques (such as ECC) have been widely employed for L2 cache data integrity with high costs. Protecting caches without accurate knowledge of the vulnerability characteristics may lead to the over-protection, thus incurring high overheads. Therefore, designing AVF-aware protection techniques would be attractive for designers to achieve a cost-efficient protection for caches, especially at early design stage. In this paper, we propose an improved AVF estimation framework for conducing comprehensive characterization of dynamic behavior and predictability of L2 cache vulnerability. We propose to employ Bayesian Additive Regression Trees (BART) method to accurately model the variation of L2 cache AVF and to quantitatively explain the important effects of several key performance metrics on L2 cache AVF. Then we employ bump hunting technique to extract some simple selecting rules based on several key performance metrics for a simplified and fast estimation of L2 cache AVF. Using the simplified L2 cache AVF estimator, we develop an AVF-aware ECC technique as an example to demonstrate the cost-efficient advantages of the AVF prediction based dynamic fault tolerant techniques. Experimental results show that compared with traditional full ECC technique, AVF-aware ECC technique reduces the L2 cache acc

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Modular heap abstractionion-based code clone detection for heap-manipulating programs

Modular heap abstractionion-based code clone detection for h...

引用

12th International Conference on Quality Software, QSIC 2012

作者： Dong, Longming Wang, Ji Chen, Liqian National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769548333

Code clone is a prevalent activity during the development of softwares. However, it may be harmful to the maintenance and evolution of softwares. Current techniques for detecting code clones are most syntax-based, and cannot detect all code clones. In this paper, we present a novel semantic-based clone detection technique by obtaining the similarity about the precondition and postcondition of each procedure, which are computed by a context and field sensitive fixpoint iteration algorithm based on modular heap abstraction in heapmanipulating programs. Experimental evaluation about a set of C benchmark programs shows that the proposed approach can be scalable to detect various clones that existing syntax-based clone detectors have missed. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A peer-to-peer media streaming system based on the iVCE platform

A peer-to-peer media streaming system based on the iVCE plat...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Wu, Jiqing Peng, Yuxing Shen, Rui National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769539003

With the advancement of peer-to-peer technology, media streaming applications become more and more popular in the Internet. However, the traditional development methods for this kind of applications need developers not only to consider the application logic but also to manage the dynamics of Internet resources, thus increasing the difficulty of development and limiting the deployment of personal video distribution applications. In this paper, we design and implement a peer-to-peer streaming system in a much easier way. In this way we can concentrate on the application itself without distraction from the dynamics of Internet resources. Such simplification owes to the Internet-based Virtual Computing Environment (iVCE), which provides programming abstractions and runtime utilities that can encapsulate the complexity of managing transient resources into the platform, thus facilitating the construction of Internet applications. When we build our streaming application based on the iVCE, we only need to define the interaction protocols among distributed nodes with the Owlet programming language. Also, we implement a JavaBean, which can be used by the Owlet program, to assist the transfering and rendering of the content. Our implementation shows that peer-to-peer applications such as media streaming, can be elegantly built using the iVCE platform, and it can serve as a reference implementation for developing similar applications. © 2009 IEEE.

关键词： Media streaming

来源：评论

学校读者我要写书评

暂无评论

Dynamic program Behavior Identification for high performance CMPs with private LLCs

Dynamic program Behavior Identification for high performance...

引用

作者： Jia, Xiaomin Lu, Pingjing Sun, Caixia Zhang, Minxuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

Chip Multi-Processors (CMPs) emerge as a mainstream architectural design alternative for high performance parallel and distributed computing. Last Level Cache (LLC) management is critical to CMPs because off-chip accesses often require a long latency. Due to its short access latency, well performance isolation and easy scalability, private cache is an attractive design alternative for LLC of CMPs. This paper proposes program Behavior Identification-based Cache Sharing (BICS) for LLC management. BICS is based on a private cache organization for the shorter access latency. Meanwhile, BICS tries to simulate a shared cache organization by allowing evicted blocks of one private LLC to be saved at peer LLCs. This technique is called spilling. BICS identifies cache behavior types of applications at runtime. When a cache block is evicted from a private LLC, cache behavior characteristics of the local application are evaluated so as to determine whether the block is to be spilled. Spilled blocks are allowed to replace some valid blocks of the peer LLCs as long as the interference is within a reasonable level. Experimental results using a full system CMP simulator show that BICS improves the overall throughput by as much as 14.5%, 12.6%, 11.0% and 11.7% (on average 8.8%, 4.8%, 4.0% and 6.8%) over private cache, shared cache, Utility-based Cache Partitioning (UCP) scheme and the baseline spilling-based organization Cooperative Caching (CC) respectively on a 4-core CMP for SPEC CPU2006 benchmarks. Copyright© 2010.

关键词： Integrated circuit design

来源：评论

学校读者我要写书评

暂无评论

Modeling complex relationship paths for knowledge graph completion

Modeling complex relationship paths for knowledge graph comp...

引用

作者： Zeng, Ping Tan, Qingping Meng, Xiankai Zhang, Haoyu Xu, Jianjun College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing Changsha China

Determining the validity of knowledge triples and filling in the missing entities or relationships in the knowledge graph are the crucial tasks for large-scale knowledge graph completion. So far, the main solutions use machine learning methods to learn the low-dimensional distributed representations of entities and relationships to complete the knowledge graph. Among them, translationmodels obtain excellent performance. However, the proposed translation models do not adequately consider the indirect relationships among entities, affecting the precision of the representation. Based on the long short-term memory neural network and existing translation models, we propose a multiple-module hybrid neural network model called TransP. By modeling the entity paths and their relationship paths, TransP can effectively excavate the indirect relationships among the entities, and thus, improve the quality of knowledge graph completion tasks. Experimental results show that TransP outperforms state-of-the-art models in the entity prediction task, and achieves the comparable performance with previous models in the relationship prediction task. © 2018 The Institute of Electronics, Information and Communication Engineers.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

An efficient high-precision data detection for massive MU-MIMO systems

An efficient high-precision data detection for massive MU-MI...

引用

2019 International Conference on Electronic Engineering and Informatics, EEI 2019

作者： Qiu, Shikai Wang, Yu Chen, Lirui Xing, Zuocheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781728140766

Data detection is among the most crucial process task for massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems. In this letter, we propose a novel efficient high precision soft-output data detection algorithm, which iteratively generates a signal vector and reduces its complexity meanwhile. This algorithm guarantees its significant error-rate performance and reduced complexity by combing an optimization method, ADMM, and modified neighborhood search algorithm. Simulation results demonstrate that the proposed detection achieves superior performance over the existing methods at low computational complexity. © 2019 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Rev Rec: A two-layer reviewer recommendation algorithm in pull-based development model

引用

Journal of Central South University 2018年第5期25卷 1129-1143页

作者：杨程张迅晖曾令斌范强王涛余跃尹刚王怀民 National Laboratory for Parallel and Distributed Processing College of ComputerNational University of Defense Technology

Code review is an important process to reduce code defects and improve software quality. In social coding communities like GitHub, as everyone can submit Pull-Requests, code review plays a more important role than ever before, and the process is quite time-consuming. Therefore, finding and recommending proper reviewers for the emerging Pull-Requests becomes a vital task. However, most of the current studies mainly focus on recommending reviewers by checking whether they will participate or not without differentiating the participation types. In this paper, we develop a two-layer reviewer recommendation model to recommend reviewers for Pull-Requests （PRs） in GitHub projects from the technical and managerial perspectives. For the first layer, we recommend suitable developers to review the target PRs based on a hybrid recommendation method. For the second layer, after getting the recommendation results from the first layer, we specify whether the target developer will technically or managerially participate in the reviewing process. We conducted experiments on two popular projects in GitHub, and tested the approach using PRs created between February 2016 and February 2017. The results show that the first layer of our recommendation model performs better than the previous work, and the second layer can effectively differentiate the types of participation.

关键词： Pull-Request code reviewer recommendation GitHub open source community

来源：评论

学校读者我要写书评

暂无评论

Nexus: Speculative execution for event-driven networking programs

Nexus: Speculative execution for event-driven networking pro...

引用

16th IEEE International Conference on parallel and distributed Systems, ICPADS 2010

作者： Li, Huiba Lu, Xicheng Peng, Yuxing National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769543079

The efficiency of communication is a key factor to the performance of networking applications, and concurrent communication is an important approach to the efficiency of communication. However, many concurrency opportunities are very difficult to exploit because they depend on some undeterministic conditions. If these conditions are highly predictable, speculative execution can be a very effective approach to cope with the uncertainties. Existing researches on speculation seldom target at networking systems, and none of them can handle the event-driven model that is very popular in such systems. In this paper, we propose Nexus, a novel speculation scheme that supports event-driven networking applications. Nexus analyzes the dependence relationship of events, and performs speculation according to the duality of events and threads. Evaluation on a prototype implementation of nexus shows that this approach can significantly reduces the time needed to complete an event-driven program. © 2010 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A logistic regression model for Semantic Web service matchmaking

引用

Science China(Information Sciences) 2012年第7期55卷 1715-1720页

作者： WEI DengPing 1 ,WANG Ting 1 & WANG Ji 2 1 School of Computer,national University of Defense Technology,Changsha 410073,China 2 national laboratory for parallel and distributed processing,Changsha 410073,China 1. School of Computer National University of Defense Technology Changsha 410073 China2. National Laboratory for Parallel and Distributed Processing Changsha 410073 China

Semantic Web service matchmaking,as one of the most challenging problems in Semantic Web services (SWS),aims to filter and rank a set of services with respect to a service query by using a certain matching *** this paper,we propose a logistic regression based method to aggregate several matching strategies instead of a fixed integration (e.g.,the weighted sum) for SWS *** logistic regression model is trained on training data derived from binary relevance assessments of existing test collections,and then used to predict the probability of relevance between a new pair of query and service according to their matching values obtained from various matching *** are then ranked according to the probabilities of relevance with respect to each *** method is evaluated on two main test collections,SAWSDL-TC2 and Jena Geography Dataset(JGD).Experimental results show that the logistic regression model can effectively predict the relevance between a query and a service,and hence can improve the effectiveness of service matchmaking.

关键词： Semantic Web service matchmaking logistic regression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：