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

作者： Wang, Ying Zhang, Lei Han, Yinhe Li, Huawei Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783981080179

The emerging nanophotonic technology can avoid the limitation of I/O pin count, and provide abundant memory bandwidth. However, current DRAM organization has mainly been optimized for a higher storage capacity and package pin utilization. The resulted data fetching mechanism is quite inefficient in performance and energy saving, and cannot effectively utilize the abundant optical bandwidth in off-chip communication. This paper inspects the opportunity brought by optical communication, and revisits the DRAM memory architecture considering the technology trend towards multiprocessors. In our FlexMemory design, super-line prefetching is proposed to boost system performance and promote energy efficiency, which leverages the abundant photonic bandwidth to enlarge the effective data fetch size per memory cycle. To further preserve locality and maintain service parallelism for different workloads, page folding technique is employed to achieve adaptive data mapping in photonics-connected DRAM chips via optical wavelengths allocation. By combining both techniques, surplus off-chip bandwidth can be utilized and effectively managed adapting to the workloads intensity. Experimental results show that our FlexMemory achieves considerable improvements in performance and energy efficiency. © 2011 EDAA.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Locality and parallelism optimization for dynamic programming algorithm in bioinformatics

Locality and parallelism optimization for dynamic programmin...

引用

2006 ACM/IEEE Conference on Supercomputing, SC'06

作者： Tan, Guangming Feng, Shengzhong Sun, Ninghui Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Graduate School Chinese Academy of Sciences

ISBN: (纸本)0769527000

Dynamic programming has been one of the most efficient approaches to sequence analysis and structure prediction in biology. However, their performance is limited due to the drastic increase in both the number of biological data and variety of the computer architectures. With regard to such predicament, this paper creates excellent algorithms aimed at addressing the challenges of improving memory efficiency and network latency tolerance for nonserial polyadic dynamic programming where the dependences are nonuniform. By relaxing the nonuniform dependences, we proposed a new cache oblivious scheme to enhance its performance on memory hierarchy architectures. Moreover we develop and extend a tiling technique to parallelize this nonserial polyadic dynamic programming using an alternate block-cyclic mapping strategy for balancing the computational and memory load, where an analytical parameterized model is formulated to determine the tile volume size that minimizes the total execution time and an algorithmic transformation is used to schedule the tile to overlap communication with computation to further minimize communication overhead on parallel architectures. The numerical experiments were carried out on several high performance computer systems. The new cache-oblivious dynamic programming algorithm achieve 2-10 speedup and the parallel tiling algorithm with communication-computation overlapping shows a desired potential for fine-grained parallel computing on massively parallel computer systems. © 2006 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

High-efficient architecture of Godson-T many-core processor 23

High-efficient architecture of Godson-T many-core processor

引用

23rd IEEE Hot Chips Symposium, HCS 2011

作者： Fan, Dongrui Zhang, Hao Wang, Da Ye, Xiaochun Song, Fenglong Zhang, Junchao Fan, Lingjun Advanced Micro-System Group National Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China

This article consists of a collection of slides from the author's conference presentation on the special features, system design, processing capabilities, and targeted markets for AMS's Godson-T microprocessor...

ISBN: (纸本)9781467388771

关键词：

来源：评论

学校读者我要写书评

暂无评论

Protein structure prediction based on a domain clustering database

Protein structure prediction based on a domain clustering da...

引用

2007 1st International Conference on Bioinformatics and Biomedical Engineering, ICBBE

作者： Ma, Zhaoyun Zhang, Fa Xu, Lin Feng, Shengzhong Liu, Zhiyong Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Institute of Computing Technology Graduate School Chinese Academy of Sciences

ISBN: (纸本)1424411203

Homology modeling, as a successful protein structure prediction method, has two major deficiencies, i.e., the lack of the templates (known structures), and the accuracy of alignment between the query (unknown structure) and its templates. To solve these problems, we have constructed a conservative domain clustering template database, and proposed a profile-based alignment algorithm based on the profile extracted from each domain clustering in the database. The extracted profile can well represent the information of the sequence and structure as well. Compared with other alignment methods, such as T-coffee and Smith-Water man, our results show that with this method it's possible to obtain a higher hit rate for template searching and a more accurate and reliable query-template alignment. Therefore, the quality of protein structure prediction can be improved. © 2007 Crown Copyright.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Evaluating memory compression and deduplication

Evaluating memory compression and deduplication

引用

2013 IEEE 8th International Conference on Networking, architecture and Storage, NAS 2013

作者： Deng, Yuhui Song, Liangshan Huang, Xinyu Computer Science Department Jinan University Guangzhou 510632 China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9780769550343

Many programs require more RAM to hold their data than a typical computer has. Theoretically, both the compression and deduplication can trade the rich computing capacity for more available RAM space. This paper comprehensively evaluates the performance behaviour of memory compression and memory deduplication by using seven real memory traces. The experimental results give two implications: (1) Memory deduplication greatly outperforms memory block compression. (2) Fixed-size partition (FSP) achieves the best performance in contrast to Content-defined Chunking (CDC) and Sliding Block (SB). The optimal chunking size of FSP is equal to the size of a memory page. The analysis results in this paper should be able to provide useful insights for designing or implementing systems that require abundant memory resources to enhance the system performance. © 2013 IEEE.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

Cluster-Based Interference-Free MAC Protocol with Load Aware in Software Defined VANET

引用

China Communications 2020年第12期17卷 217-234页

作者： Yangshui Gao Tao Luo Xinxin He Zhilong Zhang Beijing Laboratory of Advanced Information Networks Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and TelecommunicationsBeijing 100876China School of Mathematics and Computer Dali UniversityDali 671003China

In order to reduce the interference,a novel,cluster-based medium access control(MAC)protocol with load aware for VANETs is proposed in this ***,all vehicles on roads are grouped into stable clusters in the light of their direction,number of neighbors,link reliability,and traffic *** utilizing the advantages of centralized control in software defined VANETs(SDVN),cluster stability can be maintained in ***,a contention-free MAC mechanism composed of inter-cluster multi-channel allocation and intra-cluster dynamic TDMA frame allocation is proposed to prevent co-channel interference and hidden terminal *** results show that the proposed protocol outperforms some existing protocols in cluster stability,delivery ratio,throughput and delay performance.

关键词： SDVN MAC co-channel interference non-safety services cluster

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Latency and Energy Consumption for Mobile Edge Computing Based Proximity Detection in Road Networks

引用

China Communications 2022年第4期19卷 274-290页

作者： Tongyu Zhao Yaqiong Liu Guochu Shou Xinwei Yao School of Information and Communication Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and ConvergenceBeijing 100876China School of Computer Science and Technology Zhejiang University of TechnologyChina

In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.

关键词： proximity detection mobile edge computing road networks constrained multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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...

引用

9th IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2011

作者： Dai, Wenbo An, Hong Li, Qi Li, Gongming Deng, Bobin Wu, Shilei Li, Xiaomei Liu, Yu School 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

ISBN: (纸本)9780769544281

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. © 2011 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

A non-blocking programming framework for pipeline application on multi-core platform

A non-blocking programming framework for pipeline applicatio...

引用

9th IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2011

作者： Li, Xiaoqiang An, Hong Liu, Gu Han, Wenting Xu, Mu Zhou, Wei Li, Qi School 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

ISBN: (纸本)9780769544281

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 nonblock 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, twofish, ferret, dedup. And our framework reduces execution time of TBB by 72% in best case and 20% on average on an 8 core machine. © 2011 IEEE.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Improved structural modeling based on conserved domain clusters and structure-anchored alignments

Proceedings of the ACM Symposium on Applied Computing

引用

Proceedings of the ACM Symposium on Applied Computing 2007年 128-132页

作者： Zhang, Fa Xu, Lin Liu, Zhiyong Yuan, Bo Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Graduate School Chinese Academy of Science Institute of Computing Technology Chinese Academy of Science Department of Computer Science and Engineering Shanghai Jiaotong University

ISBN: (纸本)1595934804;9781595934802

In this paper, we presented a method to improve structural modeling based on conserved domain clusters and structure-anchored alignments. We first constructed a template library of structural clusters for all conserved sequence domains. Then, for each cluster, we built the profile using the structure and sequence information. Finally we use the profile and structural alignments as anchors to increase the alignment accuracy between a query and its templates. Our preliminary results show that this method can be used for the partial prediction for a majority of known protein sequences with better qualities. Copyright 2007 ACM.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：