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

11th IFIP WG 10.3 International Conference on Network and parallel Computing, NPC 2014

作者： Yan, Guofeng Peng, Yuxing School of Computer and Communication Hunan Institute of Engineering China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Science and Technology Changsha 410073 China

ISBN: (纸本)9783662449165

In this paper, we present a novel stochastic analyzing model for e2e virtualized cloud services using hierarchical Quasi-Birth Death structures (QBDs). We divide the overall virtualized cloud services into three sub-hierarchies, and then, analyze each individual sub-hierarchy using QBDs. Our approach reduces the complexity of performance analysis. Our results are useful to prevent the cloud center from entering unsafe operation, and also reveal practical insights into load balancing and capacity planning for virtualized computing environments. © 2014 IFIP International Federation for Information processing.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

AUModel: A conceptual model for adaptive software 5

AUModel: A conceptual model for adaptive software

引用

2014 5th IEEE International Conference on Software Engineering and Service science, ICSESS 2014

作者： Liu, Hui Ding, Bo Shi, Dianxi Wang, Huaimin National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781479932788

Pervasive software should be able to adapt itself to the changing environments and user requirements. Obviously, it will bring great challenges to the software engineering practice. This paper proposes AUModel, a conceptual model for adaptive software, which takes adaptability as an inherent feature and can act as the foundation of the engineering process. By introducing AUModel, the reuse of software adaptation infrastructure as well as the separation of adaptation concerns are enabled, which can facilitate both the development and maintenance of adaptive software. This paper also presents our initial attempts to realize this model, including a middleware prototype to support this model and an application to validate its effectiveness. © 2014 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Array receiving scheme for ultra-wideband WSN OFDM signals

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 30-38页

作者： Du, Xiao-Li Lü, Shao-He Wang, Xiao-Dong Zhou, Xing-Ming Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

This paper proposes an array receiving scheme for ultra-wideband (UWB) OFDM signals in WSN networks. The major feature of the proposed scheme is recovering the UWB OFDM signal by frequency stitching. Firstly, the UWB OFDM signal is divided into multiple sub-bands. Every two adjacent sub-bands share at least one overlapped subcarrier(s), which is used for time alignment later. A sub-signal of the UWB OFDM signal is received on each sub-band by a narrow-band receiver. The received data sets of narrow-band receivers are time aligned by performing peak value alignment retrieval (PVAR) on the shared subcarriers. Then the UWB OFDM signal is recovered by fusing the received data sets according to the result of PVAR. As the implementation of narrow-band receivers only needs low-speed ADCs, the challenge of high-speed ADC in traditional UWB OFDM receiver is addressed. Extensive simulations are performed to demonstrate the validity of the proposed scheme and further look into three performance metrics: (1) synchronization error-tolerance, (2) extensibility, (3) performance under different SNR values. ©2014 ISCAS.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers

Efficient deterministic multithreading without global barrie...

引用

作者： Lu, Kai Zhou, Xu Bergan, Tom Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China University of Washington Computer Science and Engineering United States

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 16 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers 14

Efficient deterministic multithreading without global barrie...

引用

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

ISBN: (纸本)9781450326568

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 17 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. Copyright © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

MTracer: A Trace-Oriented Monitoring Framework for Medium-Scale Distributed Systems

MTracer: A Trace-Oriented Monitoring Framework for Medium-Sc...

引用

2014 IEEE 8th International Symposium on Service Oriented System Engineering

作者： Jingwen Zhou Zhenbang Chen Haibo Mi Ji Wang Science and Technology on Parallel and Distributed Processing Laboratory Changsha China

Trace-oriented runtime monitoring is a very effective method to improve the reliability of distributed systems. However, for medium-scale distributed systems, existing trace-oriented monitoring frameworks are either not powerful or efficient enough, or too complex and expensive to deploy and maintain. In this paper, we present MTracer, which is a lightweight trace-oriented monitoring system for medium-scale distributed systems. We have proposed and implemented several optimizations to improve the efficiency of the monitor server in MTracer. A web-based frontend is also provided to visualize a monitored system from different perspectives. We have validated MTracer in a real medium-scale environment. The results indicate that MTracer has a very lower overhead, and can handle more than 4000 events per second.

关键词： Monitoring Servers Optimization Databases Runtime Data mining Reliability

来源：评论

学校读者我要写书评

暂无评论

Accelerating Embarrassingly parallel Algorithm on Intel MIC

Accelerating Embarrassingly Parallel Algorithm on Intel MIC

引用

2014 IEEE International Conference on Progress in Informatics and Computing

作者： Qinglin Wang Jie Liu XiantuoTang Feng Wang Guitao Fu Zuocheng Xing Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

The Embarrassingly parallel(EP) algorithm which is typical of many Monte Carloapplications provides an estimate of the upper achievable limits for double precision performance of parallel supercomputers. Recently, Intel released Many Integrated Core(MIC) architecture as a many-core co-processor. MIC often offers more than 50 cores each of which can run four hardware threads as well as 512-bit vector instructions. In this paper,we describe how the EP algorithm is accelerated effectively on the platforms containing MIC using the offload execution model. The result shows that the efficientimplementation of EP algorithm on MIC can take full advantage of MIC's computational resources and achieves a speedup of 3.06 compared with that on Intel Xeon E5-2670 CPU. Based on the EP algorithm on MIC and an effective task distribution model, the implementation of EP algorithm on a CPU-MIC heterogeneous platform achieves the performance of up to2134.86 Mop/s and 4.04 times speedup compared with that on Intel Xeon E5-2670 CPU.

关键词： NPB embarrassingly parallel algorithm heterogeneous platform many integrated core architecture

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Distributed Stage DB:A High Performance Distributed Key-Value Database

Design and Implementation of Distributed Stage DB:A High Per...

引用

2014 International Conference on Industrial Engineering and Information technology

作者： Hui-jun Wu Kai Lu Gen Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

With the development of high performance computing and Web 2.0 applications,unstructured data storage becomes more and more *** RDBMS isn't efficient for big data ***,RDBMS's scalability is ***' expansion often leads to a large scale of data *** paper designs and implements a high performance distributed key-value database,which is Distributed Stage *** servers are organized by a consistent hashing ring and distributed with the support of Zookeeper,a distributed service *** has a high single-node read/write *** route information is calculated by clients,which reduces the expense of expansion.

关键词： Distributed system,database,key-value,Zookeeper

来源：评论

学校读者我要写书评

暂无评论

Realization and optimization DGEMM on ARMv8 64-bit multi-core processor

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 37-43页

作者： Jiang, Hao Wang, Feng Zuo, Ke Li, Kuan Yang, Can-Qun College of Computer Science National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The double-precision matrix-matrix multiplication (DGEMM) on ARMv8 64-bit multi-core processor architecture was realized and optimized, and the optimal model for the purpose of maximizing the compute-to-memory access ratio was built to design DGEMM kernel. The ARM 64-bit memory accessing instruction, Cache pre-fetching instruction and NEON vector FMA instruction were utilized through instruction reordering and loop unrolling to construct the kernel assembly codes. The blocking and packing algorithms and parallel methods from GotoBLAS (OpenBLAS) were chosen, and the results showed that the floating-point peak efficiency can achieve 82% with one thread and 80% with eight threads, respectively. As the fastest DGEMM implementation on ARMv8 64-bit processor, it improves the peak performance by 8.3% and 16.7% compared to ATLAS. ©, 2014, Northeastern University. All right reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Location-Aware Multi-user Resource Allocation in Distributed Clouds

Location-Aware Multi-user Resource Allocation in Distributed...

引用

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Li, Jiaxin Li, Dongsheng Zheng, Jing Quan, Yong National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Information Center of Logistics Department Beijing China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

Resource allocation for multi-user across multiple data centers is an important problem in cloud computing environments. Many geographically-distributed users may request virtualized resources simultaneously. And the distances from users to allocated resources have much impact on the quality of service (QoS) in multiple data centers environment. Most existing methods do not take all these factors into account when allocating resources. They usually result in poor runtime performance of users' virtual computing environment and the remarkable difference of users' QoS. In this paper, we propose RAMD, a resource allocation algorithm based on multi-stage decision in multiple data centers. The RAMD algorithm allocate VMs to users, taking into account the correlation and interaction between multiple users, so as to minimize the sum of all users' service distances (i.e. determined by user location and network distance of virtual machines). Experimental results show that the algorithm can effectively deal with the cloud resource allocation for multi-user across multiple data centers. It can improve the runtime performance of users' virtualized resources and reduce the difference of QoS. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：