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

2016 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR 2016

作者： Yang, Li-Na Li, Tao-Shen Tang, Yuan Yan Xu, Jia Pan, Jian-Jia Luo, Hui-Wu Zheng, Xian-Wei School of Computer Electronics and Information Guangxi University Nanning530004 China Department of Computer and Information Science Faculty of Science and Technology University of Macau China Guangxi Colleges Universities Key Laboratory of Parallel and Distributed Computing Nanning530004 China

ISBN: (纸本)9781509035885

In this research, we apply the Green's theory for converting the partial differential equation to the boundary integral equation for geometric transformation. Green's theory is designed specifically for integral equation. It is efficient in detecting the singularity point to the geometric transformation that has been verified. Experimental results show that the Green's theory has good performance. © 2016 IEEE.

关键词： Partial differential equations

来源：评论

学校读者我要写书评

暂无评论

Bipartite-Oriented distributed Graph Partitioning for Big Learning

引用

Journal of Computer Science & Technology 2015年第1期30卷 20-29页

作者：陈榕施佳鑫陈海波臧斌宇 Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Shanghai 200240 China

Many machine learning and data mining （MLDM] problems like recommendation, topic modeling, and medical diagnosis can be modeled as computing on bipartite graphs. However, inost distributed graph-parallel systems are oblivious to the unique characteristics in such graphs and existing online graph partitioning algorithms usually cause excessive repli- cation of vertices as well as significant pressure on network communication. This article identifies the challenges and oppor- tunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms. BiGraph leverages observations such as the skewed distribution of vertices, discriminated computation load and imbalanced data sizes between the two subsets of vertices to derive a set of optimal graph partition- ing algorithms that result in minimal vertex replication and network communication. BiGraph has been implemented on PowerGraph and is shown to have a performance boost up to 17.75X （from 1.16X） for four typical MLDM algorithnls, due to reducing up to 80% vertex replication, and up to 96% network traffic.

关键词： bipartite graph graph partitioning graph-parallel system

来源：评论

学校读者我要写书评

暂无评论

NR-MPI: A non-stop and fault resilient MPI supporting programmer defined data backup and restore for E-scale super computing systems

Supercomputing Frontiers and Innovations

引用

Supercomputing Frontiers and Innovations 2016年第1期3卷 4-21页

作者： Suo, Guang Lu, Yutong Liao, Xiangke Xie, Min Cao, Hongjia State Key Laboratory of High Performance Computing National University of Defense Technology Changsha Hunan Province China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan Province China

Fault resilience has became a major issue for HPC systems, particularly, in the perspective of future E-scale systems, which will consist of millions of CPU cores and other components. MPI-level fault tolerant constructs, such as ULFM, are being proposed to support software level fault tolerance. However, there are few systematic evaluations by application programmers using benchmarks or pseudo applications. This paper proposes NR-MPI, a Non-stop and Fault Resilient MPI, supporting programmer defined data backup and restore. To help programmers write fault tolerant programs, NR-MPI provides a set of friendly programming interfaces and a state transition diagram for data backup and restore. This paper focuses on design, implementation and evaluation of NR-MPI. Specifically,this paper puts emphases on failure detection in MPI library, friendly programming interface extending for NR-MPI and examples of fault tolerant programs based NRMPI. Furthermore, to support failure recovery of applications, NR-MPI implements data backup interfaces based on double in-memory checkpoint/*** conduct experiments with both NPB benchmarks and Sweep3D on TH supercomputer in NSCC-TJ. Experimental results show that NR-MPI based fault tolerant programs can recover from failures online without restarting, and the overhead is small even for applications with tens of thousands of cores. © The Authors 2016.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

An Approach for Modeling and Ranking Node-Level Stragglers in Cloud Datacenters

An Approach for Modeling and Ranking Node-Level Stragglers i...

引用

IEEE International Conference on Services computing (SCC)

作者： Xue Ouyang Peter Garraghan Changjian Wang Paul Townend Jie Xu Parallel and Distributed Laboratory National University of Defense Technology Changsha China School of Computing University of Leeds Leeds UK

The ability of servers to effectively execute tasks within Cloud datacenters varies due to heterogeneous CPU and memory capacities, resource contention situations, network configurations and operational age. Unexpectedly slow server nodes (node-level stragglers) result in assigned tasks becoming task-level stragglers, which dramatically impede parallel job execution. However, it is currently unknown how slow nodes directly correlate to task straggler manifestation. To address this knowledge gap, we propose a method for node performance modeling and ranking in Cloud datacenters based on analyzing parallel job execution tracelog data. By using a production Cloud system as a case study, we demonstrate how node execution performance is driven by temporal changes in node operation as opposed to node hardware capacity. Different sample sets have been filtered in order to evaluate the generality of our framework, and the analytic results demonstrate that node abilities of executing parallel tasks tend to follow a 3-parameter-loglogistic distribution. Further statistical attribute values such as confidence interval, quantile value, extreme case possibility, etc. can also be used for ranking and identifying potential straggler nodes within the cluster. We exploit a graph-based algorithm for partitioning server nodes into five levels, with 0.83% of node-level stragglers identified. Our work lays the foundation towards enhancing scheduling algorithms by avoiding slow nodes, reducing task straggler occurrence, and improving parallel job performance.

关键词： Servers Production Data models Computational modeling Analytical models Time factors Calculators

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of dangling pointer error for C/C++ programs

引用

Journal of Physics: Conference Series 2017年第1期887卷

作者： Wenzhe Zhang Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Laboratory of High-end Server & Storage Technology College of Computer National University of Defense Technology Changsha PR China

Dangling pointer error is pervasive in C/C++ programs and it is very hard to detect. This paper introduces an efficient detector to detect dangling pointer error in C/C++ programs. By selectively leave some memory accesses unmonitored, our method could reduce the memory monitoring overhead and thus achieves better performance over previous methods. Experiments show that our method could achieve an average speed up of 9% over previous compiler instrumentation based method and more than 50% over previous page protection based method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Combining FFT and Spectral-Pooling for Efficient Convolution Neural Network Model

Combining FFT and Spectral-Pooling for Efficient Convolution...

引用

2016 2nd International Conference on Artificial Intelligence and Industrial Engineering (AIIE2016)

作者： Zelong Wang Qiang Lan Dafei Huang Mei Wen Department of Compute National University of Technology Defense National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology

ISBN: (纸本)9781510835368

Convolution operation is the most important and time consuming step in a convolution neural network *** this work,we analyze the computing complexity of direct convolution and fast-Fourier-transform-based(FFT-based) *** creatively propose CS-unit,which is equivalent to a combination of a convolutional layer and a pooling layer but more *** computing complexity of and some other similar operation is demonstrated,revealing an advantage on computation of ***,practical experiments are also performed and the result shows that CS-unit holds a real superiority on run time.

关键词： computing complexity FFT-based convolution CS-unit

来源：评论

学校读者我要写书评

暂无评论

High Performance Interconnect Network for Tianhe System

引用

Journal of Computer Science & Technology 2015年第2期30卷 259-272页

作者：廖湘科庞征王克非卢宇彤谢旻夏军董德尊所光 College of Computer National University of Defense Technology Changsha 410073 Science and Technology on Parallel and Distributed Processing Laboratory National Changsha 410073 China China University of Defense Technology State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 China

In this paper, we present the Tianhe-2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and software features effectively supporting high performance communications, ranging over remote direct memory access, collective optimization, hardwareenable reliable end-to-end communication, user-level message passing services, etc. Measured hardware performance results are also presented.

关键词： Tianhe-2 supercomputer interconnect network router architecture network interface architecture user-level message passing

来源：评论

学校读者我要写书评

暂无评论

Tendency-based caching in Content-Centric Networking

Tendency-based caching in Content-Centric Networking

引用

International Conference on Ubiquitous and Future Networks, ICUFN

作者： YuSheng Xia YaPing Liu JinShu Su College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467399920

In content-centric networking, the schemes of innetwork caching can affect the performance of the whole network. Existing schemes lack of the global view, which results in inefficient caches. In this paper, we aim to analyze the real-time distribution of contents among caches from multiple perspectives. This paper proposes TCBRP, a scheme that analyzes caching tendency of various contents in reverse path, based on centrality of nodes, popularity of contents and replacement rate of nodes, to cache in-network contents. This scheme also has decent scalability and can be expended conveniently. The experimental results reflect that TCBRP report savings in average hops and balance cache hit rate, compared with BetwRep and LCE.

关键词： Probability Internet Network architecture Mathematical model Statistical analysis Correlation Fading channels

来源：评论

学校读者我要写书评

暂无评论

Mitigating sync amplification for copy-on-write virtual disk 16

Mitigating sync amplification for copy-on-write virtual disk

引用

Proceedings of the 14th Usenix Conference on File and Storage Technologies

作者： Qingshu Chen Liang Liang Yubin Xia Haibo Chen Hyunsoo Kim Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Samsung Electronics Co. Ltd.

ISBN: (纸本)9781931971287

Copy-on-write virtual disks (e.g., qcow2 images) provide many useful features like snapshot, de-duplication, and full-disk encryption. However, our study uncovers that they introduce additional metadata for block organization and notably more disk sync operations (e.g., more than 3X for qcow2 and 4X for VMDK images). To mitigate such sync amplification, we propose three optimizations, namely per virtual disk internal journaling, dual-mode journaling, and adaptive-preallocation, which eliminate the extra sync operations while preserving those features in a consistent way. Our evaluation shows that the three optimizations result in up to 110% performance speedup for varmail and 50% for TPCC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EmSBoT: A lightweight modular software framework for networked robotic systems

EmSBoT: A lightweight modular software framework for network...

引用

International Conference on Advances in Computational Tools for Engineering Applications, ACTEA

作者： Long Peng Fei Guan Luc Perneel Hasan Fayyad-Kazan Martin Timmerman Department of Electronics and Informatics Vrije Universiteit Brussel (VUB) Brussel-Belgium National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467385244

Developing applications for modern complex networked robotic systems is more challenging due to the introduction of possibly sophisticated communication and coordination aspects. In this paper, we propose EmSBoT, a lightweight embedded component-based software framework targeting resource-constrained networked robotic systems. EmSBoT provides a unified Application Program Interface (API) that hides the heterogeneous distributed environment from applications. Its OS abstraction layer endows it with OS independence and portability. A port-based communication mechanism is adopted to exchange message between loosely coupled components, making the system with fault-tolerance capability. By isolating the communication channels as separate agents, the framework provides uniform and transparent message-passing for agents over node boundaries. We describe the architecture, programming model and core features of EmSBoT in this paper, together with the performance evaluation and behavior validation to demonstrate its efficiency and feasibility.

关键词： Ports (Computers) Robot kinematics Real-time systems Programming Operating systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：