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

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Shixiong Xu Dongni Han Li Chen Key Laboratory of Computer System and Architecture Institute of Computing Technology Graduate University of Chinese Academy of Sciences Beijing China

The wide application of General Purpose Graphic Processing Units (GPGPUs) results in large manual efforts on porting and optimizing algorithms on them. However, most existing automatic ways of generating GPGPU code fail to conduct optimization strategies regarding a specific computation and to reuse constantly evolving manual optimizations. In this paper, we present a computation pattern driven approach for computation-specific GPGPU code generation and optimization, which in turn reuses manual optimizations to a certain extent. We suggest language extensions to OpenMP, high-level data structure attributes, in order to assist the process of computation pattern matching and to help give users intuitive performance tuning parameters in the view of data structure attributes. We illustrate the feasibility of this approach through three important computation dwarfs, which are dense matrix, sparse matrix, and structured mesh computation in scientific computing. We also build a prototype OpenMP-to-CUDA translator that consists of computation pattern recognition and code template instantiation. The experimental results demonstrate the performance benefits of computation pattern driven method. To our best knowledge, it is the first work on reusing manual optimizations for GPGPUs with computation pattern driven approach.

关键词： Data structures Optimization Pattern matching Sparse matrices Manuals Libraries Tuning

来源：评论

学校读者我要写书评

暂无评论

An efficient shared memory based virtual communication system for embedded SMP cluster

An efficient shared memory based virtual communication syste...

引用

IEEE International Conference on Networking, architecture and Storage

作者： Yin, Wenxuan Gao, Xiang Zhu, Xiaojing Guo, Deyuan Graduate University of Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Loongson Technology Corporation Limited Beijing China Institute of Microelectronics Tsinghua University Beijing China

ISBN: (纸本)9780769545097

With the prevalence of multi-core processors, it is a trend that the embedded cluster deploys SMP nodes to gain more computing power. As a crucial issue, the MPI interprocess communication has been suffering the contradiction between high performance and embedded constraints. Moreover, there is a big performance gap between intra- and inter-node communication for different infrastructures. In this paper, we design a virtual communication system called SMVN, which extends the shared memory mechanism typically used in intra-node case into the inter-node case. The SMVN utilizes the HT inter-chip interconnect interface in Godson-3A SMP nodes to build a mesh topology. It is Ethernet compatible by simulating bottom layers of TCP/IP protocol. With the design, the node interconnection can get rid of NICs, cables and switches. Furthermore, we exploit the zero-copy scheme and other optimizations to improve the performance. We port the MPICH2 library by socket channel and formulate its process allocation. The MPI latency and bandwidth tests show that the performance difference between two levels is small. The inter-node bandwidth is 27.3MB/s, which is more than twice the theoretical peak value of 100Mb Ethernet and reaches 84% of the intra-node performance. © 2011 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling approach based on private clouds

引用

Journal of Information and Computational Science 2011年第4期8卷 716-724页

作者： Li, Jiandun Peng, Junjie Lei, Zhou Zhang, Wu School of Computer Engineering and Science Shanghai University Shanghai 200072 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing 100190 China

With further development and wide acceptance of cloud computing, lots of companies and colleges decide to take advantage of it in their own data centers, which is known as private clouds. Since private clouds have some unique characteristics and special requirements, it is still a challenging problem to effectively schedule virtual machine requests onto compute nodes, especially with multiple objectives to meet. In this paper, we explore couples of characteristics related to workflow scheduling in the scenario of private clouds and propose a hybrid energy-efficient scheduling approach. The experiments show that it can save more time for users, conserve more energy and achieve higher level of load balancing. Copyright © 2011 Binary Information Press.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for private clouds

引用

Journal of Convergence Information Technology 2011年第7期6卷 1-9页

作者： Li, Jiandun Peng, Junjie Zhang, Wu School of Computer Engineering and Science Shanghai University Shanghai 200072 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing 100190 China

In contrast with public clouds, private clouds have some unique features, especially when related to workflow scheduling. Of course, the tradeoff problem between power and performance remains to be one of the key concerns. Based on our previous research, in this paper, we propose a hybrid energy-efficient scheduling algorithm using dynamic migration. The experiments show that it can not only reduce the response time, conserve more energy, but also achieve higher level of load balancing.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallelizing a Machine Translation Decoder for Multicore computer

Parallelizing a Machine Translation Decoder for Multicore Co...

引用

2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)

作者： Zhaoqing Zhang Haitao Mi Long Chen Xiaobing Feng Wei Huo Zhiyuan Li Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academ Department of Computer Science Purdue University West Lafayette US IN 47907

Machine translation (MT), with its broad potential use, has gained increased attention from both researchers and software vendors. To generate high quality translations, however, MT decoders can be highly computation intensive. With significant raw computing power, multi-core microprocessors have the potential to speed up MT software on desktop machines. However, retrofitting existing MT decoders is a nontrivial issue. Race conditions and atomicity issues are among those complications making parallelization difficult. In this article, we show that, to parallelize a state-of-the-art MT decoder, it is much easier to overcome such difficulties by using a process-based parallelization method, called functional task parallelism, than using conventional thread-based methods. We achieve a 7.60 times speed up on an 8-core desktop machine while making significantly less changes to the original sequential code than required by using multiple threads.

关键词： Decoding Instruction sets Load modeling Computational modeling Memory management Sorting

来源：评论

学校读者我要写书评

暂无评论

A Priority-Aware NoC to Reduce Squashes in Thread Level Speculation for Chip Multiprocessors

A Priority-Aware NoC to Reduce Squashes in Thread Level Spec...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Wenbo Dai Hong An Qi Li Gongming Li Bobin Deng Shilei Wu Xiaomei Li Yu Liu School of Computer Science and Technology University of Science and Technology Hefei China Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

Thread Level Speculation (TLS) is a technique aims at boosting the performance of sequential programs running on Chip Multiprocessors (CMPs) by automatically parallelizing them. It exempts programmers from the heavy task of parallel programming. But its performance may suffer from frequent squashing caused by inter-thread data dependency violation. In this paper, we propose a Network-on-Chip (NoC) in CMP that employs a priority-aware packet arbitration policy. Packet scheduling guided by such policy reduces the occurrence of TLS squashes. Simulation results with 5 applications show that our policy reduces squashes by 22% in best case and 15% on average. Moreover, our priority aware approach could be generalized to similar scenarios in which different threads running on CMP manifest different priorities.

关键词： Instruction sets Nickel Art Switches Scalability Protocols

来源：评论

学校读者我要写书评

暂无评论

基于数据通路分片和冗余策略的片上容错路由器设计

基于数据通路分片和冗余策略的片上容错路由器设计

引用

第七届中国测试学术会议

作者： Lu Hang 路航 Han Yinhe 韩银和 Wang Ying 王颖 Li Xiaowei 李晓维 State Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 10019 计算机系统结构国家重点实验室北京 100190 中国科学院计算技术研究所北京100190

为了满足系统芯片对通信带宽的要求,片上网络逐渐成为多核处理器互连的主流方案。然而随着集成电路技术进入纳米时代,由于制造缺陷、电粒子轰击等原因,片上网络出现故障的可能性明显增大,严重时会导致整个系统崩溃。以往的容错技术允许... 详细信息

为了满足系统芯片对通信带宽的要求,片上网络逐渐成为多核处理器互连的主流方案。然而随着集成电路技术进入纳米时代,由于制造缺陷、电粒子轰击等原因,片上网络出现故障的可能性明显增大,严重时会导致整个系统崩溃。以往的容错技术允许片上路由器分时复用其它正常工作的数据通路分片,以提高路由器的容错能力,降低传输延迟。然而,随着故障分片数量增多,路由器的可靠性和性能会受到严重影响。本文基于数据通路部件可分片的特点,对分片进行冗余备份,当分片出现故障时用冗余分片替代故障分片以提高路由器的可靠性。实验结果表明,本文提出的容错路由器硬件开销小于双模冗余,SPF达到12以上,当网络存在一定数量的故障时,仍有98％以上的节点可以正常工作。

关键词：集成电路片上网络容错路由器设计流程数据通路冗余备份

来源：评论

学校读者我要写书评

暂无评论

A Non-blocking Programming Framework for Pipeline Application on Multi-core Platform

A Non-blocking Programming Framework for Pipeline Applicatio...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Xiaoqiang Li Hong An Gu Liu Wenting Han Mu Xu Wei Zhou Qi Li School of Computer Science and Technology University of Science and Technology Hefei China Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

Many applications meet certain programming patterns like pipeline, fork-join, do-all etc. While tools such as OS threads and OpenMP allow programmers only to express task or data parallelism, special support for programming patterns is distinctly lacking. Intel threading building blocks (TBB) is developed to address this problem, but its scheduler is general and not optimized for any of its parallel algorithms which include pipeline specially. In this paper, we provide a non-blocking framework for pipeline application on multi-core platform. We target linear pipeline in which each filter has one entrance and one exit. We design a novel work-stealing scheduler optimized specially for pipeline application: first, priority based stealing, priority is calculated for each filter in pipeline so that a worker can find the optimal "victim" easily when it needs to steal, second, multiple tasks can be stolen at a time so that much stealing time is reduced. A non-block queue is used to store intermediate result to reduce lock overhead and increase scalability. We apply our framework to four case studies, including text filter, two fish, ferret, ded up. And our framework reduces execution time of TBB by 72% in best case and 20% on average on an 8 core machine.

关键词： Pipelines Optimization Programming Load management Parallel processing Arrays

来源：评论

学校读者我要写书评

暂无评论

A SAT-Based Pattern Generation Method for Diagnosis Multiple Scan Chain Faults

A SAT-Based Pattern Generation Method for Diagnosis Multiple...

引用

2011 2nd International Conference on Advanced Measurement and Test (AMT 2011)

作者： Fei Wang Da Wang Haigang Yang System on Programmable Chip Research Department Institute of Electronics Chinese Academy of Sciences Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences

Scan chain design is a widely used design-for-testability(DFT) technique to improve test and diagnosis qualityHowever, failures on scan chain itself account for up to 30% of chip failuresTo diagnose root causes of scan chain failures in a short period is vital to failure analysis process and yield improvementsAs the conventional diagnosis process usually runs on the faulty free scan chain, scan chain faults may disable the diagnostic process, leaving large failure area to time-consuming failure analysisIn this paper, a SAT-based technique is proposed to generate patterns to diagnose scan chain faultsThe proposed work can efficiently generate high quality diagnostic patterns to achieve high diagnosis resolutionMoreover, the computation overhead of proving equivalent faults is reducedExperimental results on ISCAS'89 benchmark circuits show that the proposed method can reduce the number of diagnostic patterns while achieving high diagnosis resolution.

关键词： scan chain,testing,diagnosis,boolean satisfiability(SAT),very large scale integration

来源：评论

学校读者我要写书评

暂无评论

CHMasters: A Scalable and Speed-Efficient Metadata Service in Distributed File system

CHMasters: A Scalable and Speed-Efficient Metadata Service i...

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Min Xu Junrui Zhou Wei Zhou Hong An Department of Computer Science and Technology University of Science and Technology of China Hefei China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing China

Distributed file system (DFS) is playing important roles of supporting large distributed data-intensive applications to meet storage needs. Typically, the design of DFS, such as GFS in Google, DMS in Cisco and TFS in Alibaba, is driven by observations of specific application workloads, internal demands and technological environment. In such systems, the metadata service is a critical factor that can affect the file system performance and availability to a great degree. Five requirements have been summarized for the metadata service: location transparent file service, smart director, efficient speed, strong scalability and friendly collaborator. In this paper, we present metadata service module called CH Masters in our DFS. Consistent hashing protocol is used to relieve potential hot spots on name servers. Files' metadata and master nodes are mapped into the same hash space by consistent hash function. And then files' metadata are scattered to master nodes by clockwise "closest" principle. Chunk server acts as a client when report its chunks info. Only a small proportion of files' metadata will be rehashed when master nodes state change. A new scalable file mapping strategy is also proposed to map file sizes from few MB to several GB efficiently. After intensive experiments, it shows CH Masters is satisfying the above five requirements.

关键词： Protocols File systems Google Servers computer architecture Clocks Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：