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

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Hu, Minghao Wang, Changjian You, Pengfei Huang, Zhen Peng, Yuxing National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410072 China

ISBN: (纸本)9783319271217

To provide timely results for ‘Big Data Analytics’, it is crucial to satisfy deadline requirements for MapReduce jobs in production environments. In this paper, we propose a deadline-oriented task scheduling approach, named Dart, to meet the given deadline and maximize the input size if only part of the dataset can be processed before the time limit. Dart uses an iterative estimation method which is based on both historical data and job running status to precisely estimate the realtime job completion time. By comparing the estimated time with the deadline constraint, a YARN-based task scheduler dynamically decides whether continuing or terminating the map *** have validated our approach using workloads from OpenCloud and Facebook on a cluster of 60 virtual machines. The results show that Dart can not only effectively meet the deadline but also process near-maximal data volumes even when the deadline is set to be extremely small and limited resources are allocated. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

DFIS: A scalable distributed fingerprint identification system 15th

DFIS: A scalable distributed fingerprint identification syst...

引用

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Zhao, Yunxiang Zhang, Wanxin Li, Dongsheng Huang, Zhen National Laboratory for Parallel and Distributed Processing College of Computer National University of Defence Technology ChangshaHunan410073 China

ISBN: (纸本)9783319271361

Fingerprint has been widely used in a variety of biometric identification systems. However, with the rapid development of fingerprint identification systems, the amount of fingerprints information stored in systems has been rising sharply, making it challenging to process and store fingerprints efficiently and robustly with traditional standalone systems and relational databases. In this paper, we propose a scalable distributed fingerprint identification system, named DFIS. It combines the feature extraction procedure with HIPI library and optimizes the load balance strategy of MongoDB to construct a much more robust and stable system. Related experiments and simulations have been carried out and results show that DFIS can reduce the time expense by 70% during the features extraction procedural. For load balance of MongoDB, DFIS can decrease the difference of access load to less than 5% and meanwhile decrease 50% data migration to gain more reasonable distribution of operation load and data load among shards compared with the default load balance strategy in MongoDB. © Springer International Publishing Switzerland 2015.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Partial clones for stragglers in MapReduce

Partial clones for stragglers in MapReduce

引用

International Conference of Young Computer Scientists, Engineers and Educators, ICYCSEE 2015

作者： Li, Jia Wang, Changjian Li, Dongsheng Huang, Zhen National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783662462478

Stragglers can temporize jobs and reduce cluster efficiency seriously. Many researches have been contributed to the solution, such as Blacklist[8], speculative execution[1, 6], Dolly[8]. In this paper, we put forward a new approach for mitigating stragglers in MapReduce, name Hummer. It starts task clones only for high-risk delaying tasks. Related experiments have been carried and results show that it can decrease the job delaying risk with fewer resources consumption. For small jobs, Hummer also improves job completion time by 48% and 10% compared to LATE and Dolly. © Springer-Verlag Berlin Heidelberg 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Enhancing Temporal Alignment with Autoencoder Regularization

Enhancing Temporal Alignment with Autoencoder Regularization

引用

International Joint Conference on Neural Networks

作者： Liquan Nie Yuanyuan Wang Xiang Zhang Xuhui Huang Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Department of Basic Courses Army Officer Academy Department of Computer Science and Technology College of Computer National University of Defense Technology

ISBN: (纸本)9781509006212

Temporal alignment aligns two temporal sequences and is quite challenging due to drastic differences among temporal sequences and source data from different views. Canonical time warping (CTW) has shown great potential in temporal alignment tasks because it can reduce data redundancy by transforming high-dimensional data to a lower-dimensional subspace via canonical correlation analysis (CCA). However, CTW cannot uncover the underlying nonlinear structure embedded in the dataset. In this paper, we propose an autoencoder regularized canonical time warping method (AECTW) to overcome this drawback. Specifically, AECTW enhances lower-dimensional representation of each sequence by incorporating an autoencoder regularization, meanwhile reveals the nonlinear structure of features by explicit nonlinear transformation. By these strategies, AECTW significantly boosts CTW in temporal alignment tasks. Experiments on both synthetic data and two practical human action datasets demonstrate that AECTW outperforms the representative DTW-based methods.

关键词： NONLINEAR STRUCTURES data redundancy Dataset synthetic data Alignment Warping Structural properties Canonical Religious Missions Data sources

来源：评论

学校读者我要写书评

暂无评论

Software ranking and analysis based on mining market requirements and characteristics 15

Software ranking and analysis based on mining market require...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Liu, Bingxun Yin, Gang Wang, Tao Zhang, Fang Wang, Huaimin National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

As the rapid growth of open source software, how to choose software from many alternatives becomes a great challenge. Traditional ranking approaches mainly focus on the characteristics of the software themselves, such as qualities, security, reliable and so on. In this paper we investigate the market demands for software engineers, and propose a novel approach for ranking software by analyzing the market requirements for special software. At the same time we conclude the characteristics of software advertisements and analyze the reasons that why these situations emerge and tendency of software market requirements. As industries always need to balance several different factors for selecting software, the market demands can be a good indicator for ranking software and software evaluating. This paper provides quite a different perspective and some interesting inferences on software market requirements, and it can be a valuable supplement for traditional ranking methods, as well as software evaluating. © 2015 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Labelwalking nonnegative matrix factorization 40

Labelwalking nonnegative matrix factorization

引用

40th IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2015

作者： Lan, Long Guan, Naiyang Zhang, Xiang Huang, Xuhui Luo, Zhigang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781467369978

Semi-supervised learning (SSL) utilizes plenty of unlabeled examples to boost the performance of learning from limited labeled examples. Due to its great discriminant power, SSL has been widely applied to various real-world tasks such as information retrieval, pattern recognition, and speech separa- tion. Label propagation (LP) is a popular SSL method which propagates labels through the dataset along high density areas defined by unlabeled examples, LP assumes nearby examples should share the same label, thus, it unavoidably pushes the labels to the wrong examples, especially when different la- beled examples are not strictly separated. Seed K-means uses labeled examples to initialize class centers, and avoid getting stuck in poor local optima comparing to traditional K-means, however the hard constraint of each example's membership makes Seed K-means failed in many real world applications. This paper proposes a novel label walking nonnegative matrix factorization method (LWNMF) to handle labeled examples in SSL based on the framework of NMF. LWNMF decomposes the whole dataset into the product of a basis matrix and a coefficient matrix, and to travel labels to unlabeled examples, LWNMF regards the class indicators of labeled examples as their coefficients and iteratively updates both basis matrix and coefficients of unlabeled examples. Since LWNMF learns comprehensive class centroids, labels iteratively walk to unlabeled examples through these significant centroids. © 2015 IEEE.

关键词： K-means Label propagation Nonnegative matrix factorization Semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

Locality Protected Dynamic Cache Allocation Scheme on GPUs

Locality Protected Dynamic Cache Allocation Scheme on GPUs

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Yang Zhang Zuocheng Xing Li Zhou Chunsheng Zhu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Electronic Science and Engineering National University of Defense Technology Changsha China Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

ISBN: (纸本)9781509032068

As we are approaching the exascale era in supercomputing, designing a balanced computer system with powerful computing ability and low energy consumption becomes increasingly important. GPU is a widely used accelerator in most recently applied supercomputers. It adopts massive multithreads to hide long latency and has high energy efficiency. In contrast to its strong computing power, GPUs have few on-chip resources with several MB of fast on-chip memory storage per SM (Streaming Multiprocessors). GPU caches exhibit poor efficiency due to the mismatch of the throughput-oriented execution model and its cache hierarchy design. Since the severe deficiency in on-chip memory, the benefit of high computing capacity of GPUs is pulled down by the poor cache performance dramatically, which limits system performance and energy-efficiency. In this paper, we put forward a locality protected scheme to make full use of the data locality based on the fixed capacity. We present a Locality Protected method based on instruction PC (LPP) to promote GPU performance. Firstly, we use a PC-based collector to collect the reuse information of each cache line. After getting the dynamic reuse information of the cache line, we take an intelligent cache allocation unit (ICAU) which coordinates the reuse information with LRU (Least Recently Used) replacement policy to find out the cache line with the least locality for eviction. The results show that LPP provides an up to 17.8% speedup and an average of 5.5% improvement over the baseline method.

关键词： Graphics processing units System-on-chip Computer architecture Instruction sets Resource management Optimization Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Identifying repeated interleavings to improve the efficiency of concurrency bug detection 15th

Identifying repeated interleavings to improve the efficiency...

引用

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Wu, Zhendong Lu, Kai Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783319271392

Detecting concurrency bugs is becoming increasingly important. Many pattern-based concurrency bug detectors focus on the specific types of interleavings that are correlated to concurrency bugs. To detect multiple types of concurrency bugs, general detectors focus on multiple types of interleaving patterns, including data race pattern, atomicity violation pattern, and atomic-set violation pattern. Unfortunately, they suffer from redundant analysis due to repeated interleavings, which may affect the efficiency of concurrency bug detection. Hence, we propose an approach to identify the repeated interleavings. To the best of our knowledge, this is the first approach that can prune repeated interleavings to improve the efficiency of concurrency bug detection. We apply our approach to existing general detectors (PECAN and Maple) to avoid analyzing repeated interleavings. We evaluated the general detectors with and without our approach, respectively. The experimental results show that the bug detection results are not affected. With our approach, the bug detection time of PECAN and Maple are reduced by 40.0% and 44.4%, respectively. Additionally, our approach does not affect the overhead of bug detection, and consumes only a little memory. © Springer International Publishing Switzerland 2015.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

引用

Journal of Computer Science & Technology 2015年第1期30卷 42-56页

作者：卢凯周旭王小平 Tom Bergan 陈沉 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China Department of Computer Science and Engineering University of Washington Seattle WA 98195-2350 U.S.A.

Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap- proaches have been proposed, such as deterministic multithreading （DMT） and deterministic replay. However, these sys- tems either are inefficient or target a single purpose, which is not flexible. In this paper, we propose an efficient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps： relaxed determinism and strong determinism. Relaxed determinism solves data races eificiently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system （fast）, weak deterministic system （fast and conditionally deterministic）, DMT system, and deternfinistic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system.

关键词： determinism multithreading framework flexible

来源：评论

学校读者我要写书评

暂无评论

Cooperative repair based on tree structure for multiple failures in distributed storage systems with regenerating codes 15

Cooperative repair based on tree structure for multiple fail...

引用

12th ACM International Conference on Computing Frontiers, CF 2015

作者： Pei, Xiaoqiang Wang, Yijie Ma, Xingkong Fu, Yongquan Xu, Fangliang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781450333580

Regenerating codes have been proposed to achieve an optimal trade-off curve between the amount of storage space and the network traffic for repair. However, existing repair schemes based on regenerating codes are inadequate to meet the requirements of small network traffic cost and high efficiency when repairing multiple failures. In this paper, we propose a cooperative repair scheme based on tree structure for multiple failures with regenerating codes, called CTREE. For generality, we propose a two-layer repair framework to support both repairs for single and multiple failures. For high repair efficiency, a parallel tree-structured data transmission technique is proposed to organize the data transmissions between the providers and newcomers. For small network network traffic cost, a core-based data exchange technique is proposed to organize the data exchanges between the coordinator and the other newcomers. To evaluate the performance of CTREE, we conduct experiments on both 30 physical and 200 virtual servers. Numerical analysis and extensive experiments confirm that CTREE can support both single and multiple failure repairs, significantly reduces the network traffic cost and improves the repair efficiency compared with the state-of-the-art approaches under various parameter settings. © Copyright 2015 ACM.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：