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

Meeting deadlines for approximation processing in MapReduce environments

Frontiers of Information Technology & Electronic Engineering 2017年第11期18卷 1754-1772页

作者： Ming-hao HU Chang-jian WANG Yu-xing PENG National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

To provide timely results for big data analytics, it is crucial to satisfy deadline requirements for MapReduce jobs in today＇s production environments. Much effort has been devoted to the problem of meeting deadlines, and typically there exist two kinds of solutions. The first is to allocate appropriate resources to complete the entire job before the specified time limit, where missed deadlines result because of tight deadline constraints or lack of resources; the second is to run a pre-constructed sample based on deadline constraints, which can satisfy the time requirement but fail to maximize the volumes of processed data. In this paper, we propose a deadline-oriented task scheduling approach, named ＇Dart＇, to address the above problem. Given a specified deadline and restricted resources, Dart uses an iterative estimation method, which is based on both historical data and job running status to precisely estimate the real-time job completion time. Based on the estimated time, Dart uses an approach-revise algorithm to make dynamic scheduling decisions for meeting deadlines while maximizing the amount of processed data and mitigating stragglers. Dart also efficiently handles task failures and data skew, protecting its performance from being harmed. We have validated our approach using workloads from OpenCloud and Facebook on a cluster of 64 virtual machines. The results show that Dart can not only effectively meet the deadline but also process near-maximum volumes of data even with tight deadlines and limited resources.

关键词： MapReduce Approximation jobs Deadline Task scheduling Straggler mitigation

来源：评论

学校读者我要写书评

暂无评论

Design of an Indoor Exploration and Multi-Objective Navigation System

Design of an Indoor Exploration and Multi-Objective Navigati...

引用

第37届中国控制会议

作者： Guoxian Zheng Lei Zhang Huaxi (Yulin) Zhang Bo Ding State Key Laboratory of Synthetical Automation for Process Industries Northeastern University MIS and INSSET Universite de Picardie Jules Verne National Laboratory for Parallel and Distributed Processing National University of Defense Technology

In this paper,we propose an indoor robot autonomous navigation *** robot firstly explores in an unknown environment,and then navigates autonomously by using the explored *** robot is equipped a 2 D laser scanner as the main *** laser scanner is used for path planning and frontier-based exploration.A 2 D global occupancy map is built for path planning,frontier-based exploration and multi-objective autonomous *** scans are transmitted into Simultaneous Localization and Mapping（SLAM） process in the exploration *** indoor environment,the exploration efficiency is improved by merging a heuristic *** using multi-threading technology and a 3 D perception approach proposed in this paper,the robot equipped with a low-cost RGBD sensor can detect all kinds of obstacles to achieve highly reliable navigation in complicated 3 D ***,we develop a multi-objective navigation application to make human-robot interaction more convenient and satisfy multi-task *** approaches are demonstrated by experimental results.

关键词： Exploration Heuristic algorithm multi-threading technology 3D Perception Multi-objective navigation

来源：评论

学校读者我要写书评

暂无评论

Towards a multi-array architecture for accelerating large-scale matrix multiplication on FPGAs

arXiv

引用

arXiv 2018年

作者： Shen, Junzhong Qiao, Yuran Huang, You Wen, Mei Zhang, Chunyuan College of Computer National University of Defense Technology Changsha410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

Large-scale floating-point matrix multiplication is a fundamental kernel in many scientific and engineering applications. Most existing work only focus on accelerating matrix multiplication on FPGA by adopting a linear systolic array. This paper towards the extension of this architecture by proposing a scalable and highly configurable multi-array architecture. In addition, we propose a work-stealing scheme to ensure the equality in the workload partition among multiple linear arrays. Furthermore, an analytical model is developed to determine the optimal design parameters. Experiments on a real-life convolutional neural network (CNN) show that we can obtain the optimal extension of the linear array architecture. Copyright © 2018, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

SAWSDL-iMatcher: A Customizable and Effective Semantic Web Service Matchmaker

SSRN

引用

SSRN 2018年

作者： Wei, Dengping Wang, Ting Wang, Ji Bernstein, Abraham National University of Defense Technology Changsha410073 China University of Zürich Binzmühlestrasse 14 ZürichCH-8050 Switzerland National Laboratory for Parallel and Distributed Processing Changsha410073 China Dynamic and Distributed Information Systems Group

As the number of publicly available services grows, discovering proper services becomes an important issue and has attracted amount of attempts. This paper presents a new customizable and effective matchmaker, called SAWSDL-iMatcher. It supports a matchmaking mechanism, named iXQuery, which extends XQuery with various similarity joins for SAWSDL service discovery. Using SAWSDL-iMatcher, users can flexibly customize their preferred matching strategies according to different application requirements. SAWSDL-iMatcher currently supports several matching strategies, including syntactic and semantic matching strategies as well as several statistical-model-based matching strategies which can effectively aggregate similarity values from matching on various types of service description information such as service name, description text, and semantic annotation. Besides, we propose a semantic matching strategy to measure the similarity among SAWSDL semantic annotations. These matching strategies have been evaluated in SAWSDL-iMatcher on SAWSDL-TC2 and Jena Geography Dataset (JGD). The evaluation shows that different matching strategies are suitable for different tasks and contexts, which implies the necessity of a customizable matchmaker. In addition, it also provides evidence for the claim that the effectiveness of SAWSDL service matching can be significantly improved by statistical-model-based matching strategies. Our matchmaker is competitive with other matchmakers on benchmark tests at S3 contest 2009. © 2018, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

VirtMan:design and implementation of a fast booting system for homogeneous virtual machines in iVCE

引用

Frontiers of Information Technology & Electronic Engineering 2016年第2期17卷 110-121页

作者： Zi-yang LI Yi-ming ZHANG Dong-sheng LI Peng-fei ZHANG Xi-cheng LU National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology

Internet-based virtual computing environment （iVCE） has been proposed to combine data centers and other kinds of computing resources on the Internet to provide efficient and economical services. Virtual machines （VMs） have been widely used in iVCE to isolate different users/jobs and ensure trustworthiness, but traditionally VMs require a long period of time for booting, which cannot meet the requirement of iVCE＇s large-scale and highly dynamic applications. To address this problem, in this paper we design and implement VirtMan, a fast booting system for a large number of virtual machines in iVCE. VirtMan uses the Linux Small Computer System Interface （SCSI） target to remotely mount to the source image in a scalable hierarchy, and leverages the homogeneity of a set of VMs to transfer only necessary image data at runtime. We have implemented VirtMan both as a standalone system and for OpenStack. In our 100-server testbed, VirtMan boots up 1000 VMs （with a 15 CB image of Windows Server 2008） on 100 physical servers in less than 120 s, which is three orders of magnitude lower than current public clouds.

关键词： Virtual machine Fast booting Homogeneity Internet-based virtual computing environment （iVCE）

来源：评论

学校读者我要写书评

暂无评论

Determinants of pull-based development in the context of continuous integration

引用

Science China(Information Sciences) 2016年第8期59卷 53-66页

作者： Yue YU Gang YIN Tao WANG Cheng YANG Huaimin WANG College of Computer National University of Defense Technology National Laboratory for Parallel and Distributed Processing

The pull-based development model, widely used in distributed software teams on open source communities, can efficiently gather the wisdom from crowds. Instead of sharing access to a central repository,contributors create a fork, update it locally, and request to have their changes merged back, i.e., submit a pull-request. On the one hand, this model lowers the barrier to entry for potential contributors since anyone can submit pull-requests to any repository, but on the other hand it also increases the burden on integrators, who are responsible for assessing the proposed patches and integrating the suitable changes into the central repository. The role of integrators in pull-based development is crucial. They must not only ensure that pull-requests should meet the project’s quality standards before being accepted, but also finish the evaluations in a timely manner. To keep up with the volume of incoming pull-requests, continuous integration(CI) is widely adopted to automatically build and test every pull-request at the time of submission. CI provides extra evidences relating to the quality of pull-requests, which would help integrators to make final decision(i.e., accept or reject). In this paper, we present a quantitative study that tries to discover which factors affect the process of pull-based development model, including acceptance and latency in the context of CI. Using regression modeling on data extracted from a sample of Git Hub projects deploying the Travis-CI service, we find that the evaluation process is a complex issue, requiring many independent variables to explain adequately. In particular, CI is a dominant factor for the process, which not only has a great influence on the evaluation process per se, but also changes the effects of some traditional predictors.

关键词： pull-request continuous integration Git Hub distributed software development empirical analysis

来源：评论

学校读者我要写书评

暂无评论

Design of an Indoor Exploration and Multi-Objective Navigation System

Design of an Indoor Exploration and Multi-Objective Navigati...

引用

Chinese Control Conference (CCC)

作者： Guoxian Zheng Lei Zhang Huaxi Yulin Zhang Bo Ding State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China MIS Universite de Picardie Jules Verne Amiens France National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

In this paper, we propose an indoor robot autonomous navigation system. The robot firstly explores in an unknown environment, and then navigates autonomously by using the explored map. The robot is equipped a 2D laser scanner as the main sensor. The laser scanner is used for path planning and frontier-based exploration. A 2D global occupancy map is built for path planning, frontier-based exploration and multi-objective autonomous navigation. Laser scans are transmitted into Simultaneous Localization and Mapping (SLAM) process in the exploration phase. In indoor environment, the exploration efficiency is improved by merging a heuristic algorithm. By using multi-threading technology and a 3D perception approach proposed in this paper, the robot equipped with a low-cost RGBD sensor can detect all kinds of obstacles to achieve highly reliable navigation in complicated 3D environment. Meanwhile, we develop a multi-objective navigation application to make human-robot interaction more convenient and satisfy multi-task deployment. Our approaches are demonstrated by experimental results.

关键词： Navigation Three-dimensional displays Robot sensing systems Lasers Path planning Two dimensional displays

来源：评论

学校读者我要写书评

暂无评论

Exploiting contention and congestion aware switch allocation in network-on-chips 17

Exploiting contention and congestion aware switch allocation...

引用

50th ACM Turing Conference - China, ACM TUR-C 2017

作者： Li, Cunlu Dongy, Dezun Liao, Xiangke National Laboratory for Parallel and Distributed Processing Collaborative Innovation Center of High Performance Computing College of Computer National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781450348737

Network-on-chip system plays an important role to improve the performance of chip multiprocessor systems. As the complexity of the network increases, congestion problem has become the major performance bottleneck and seriously influence the performance of NoCs. Prior works have focused on designing effective routing algorithm based on collecting congestion and contention information to load balance the traffic. However, most prior works do not consider balancing the traffic load during switch allocation. Due to the lack of congestion information in switch allocation stage, switch allocator performs allocation only based on packet requests and thus aggravates the congestion in the ports of switch. In this paper, we propose to add the congestion and contention information into the switch allocation process and design an efficient on-chip switching strategy which utilizes the contention and congestion information to load balance the traffic and achieve efficient switch allocation. To further enhance the performance of our design, we carefully design our switch allocation strategy to balance the trade-off between traffic load balance and the matching efficiency in switch allocation. We evaluate our design under synthetic traffic and trace of parsec benchmarks. Our evaluations show this mechanism achieves optimal latency compared to best previous switch allocation strategies. © 2017 ACM.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

A systematic review of structured sparse learning

引用

Frontiers of Information Technology & Electronic Engineering 2017年第4期18卷 445-463页

作者： Lin-bo QIAO Bo-feng ZHANG Jin-shu SU Xi-cheng LU College of Computer National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

High-dimensional data arising from diverse scientific research fields and industrial development have led to increased interest in sparse learning due to model parsimony and computational advantage. With the assumption of sparsity, many computational problems can be handled efficiently in practice. Structured sparse learning encodes the structural information of the variables and has been quite successful in numerous research fields. With various types of structures discovered, sorts of structured regularizations have been proposed. These regularizations have greatly improved the efficacy of sparse learning algorithms through the use of specific structural information. In this article, we present a systematic review of structured sparse learning including ideas, formulations, algorithms, and applications. We present these algorithms in the unified framework of minimizing the sum of loss and penalty functions, summarize publicly accessible software implementations, and compare the computational complexity of typical optimization methods to solve structured sparse learning problems. In experiments, we present applications in unsupervised learning, for structured signal recovery and hierarchical image reconstruction, and in supervised learning in the context of a novel graph-guided logistic regression.

关键词： Sparse learning Structured sparse learning Structured regularization

来源：评论

学校读者我要写书评

暂无评论

Growing construction and adaptive evolution of complex software systems

引用

Science China(Information Sciences) 2016年第5期59卷 5-7页

作者： Huaimin WANG Bo DING National Key Laboratory of Parallel and Distributed Processing College of ComputerNational University of Defense Technology

distributed software systems are becoming more and more complex *** is easy to find a huge amount of computing nodes in a nationwide or global information *** example,We Chat(Wei Xin),a well-known mobile application in China,has reached a record of 650 million monthly active users in the third quarter of *** the same time,researchers are starting to talk about software systems which have billions of lines of codes[1]or can last one hundred years.

关键词： Growing construction and adaptive evolution of complex software systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：