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

2007 Asian Technology Information Program's (ATIP's) 3rd Workshop on High Performance Computing in China - Solution Approaches to Impediments for High Performance Computing, CHINA HPC'07

作者： Song, Ying Wang, Hui Li, Yaqiong Sun, Yuzhong Zeng, Yu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China National Research Center for Intelligent Computing Systems ICT Beijing 100080 China Graduate University of Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9781595939036

Trend towards providing heterogeneous services concurrently by ISPs and low utilization of servers make it necessary to consolidate various services computing into a single platform. In such a shared environment, meeting application-level QoS goals and avoiding interaction among services become challenges as each application consumes different amount of resource and requires different QoS. Video-on-demand (VoD) has been identified as an important application among multimedia services. In this paper, we study a case of interaction among services concurrently running on a virtualized computing environment. The contributions of this paper are follows. 1) We design a novel capability service computing framework for service computing consolidation (CSCF) to study the interaction among concurrent services in a VM-Based Virtualized Computing Environment;2) A dynamic and lazy memory flowing algorithm (DLMFaVM) among VMs is proposed to partially fulfill this computing model by resource flowing;3) We also develop a virtualized computing platform to study the possibility of service computing consolidation;4) We analyze the interaction among VoD service and other typical enterprise services in our capability service computing environment and draw a conclusion that the VoD streaming service co-existing with other services on a VM-based virtualized computing platform is a trend for ISPs. But it presents some challenges for the designers of service soft and the designers of service computing platform. Copyright 2007 ACM.

关键词： Video on demand

来源：评论

学校读者我要写书评

暂无评论

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 On-Chip Test Clock Control Scheme for Multi-Clock At-Speed Testing

An On-Chip Test Clock Control Scheme for Multi-Clock At-Spee...

引用

The 16th Asian Test Symposium(第十六届亚洲测试学术会议)

作者： Xiao-Xin FAN Yu HU Laung-Temg (L.-T.) WANG Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade SynTest Technologies Inc. 505 S. Pastoria Ave. Suite 101 CA 94086 USA

To test timing-related faults between synchronous clocks, an at-speed test clock and an automatic test pattern generation scheme are needed However, previous work on designing on-chip at-speed test clock controllers for multi-clock has quadratic increasing area overhead along with linearly increasing clocks. This paper presents a clock-chain based test clock control scheme using an internal phase-locked-loop (PLL) as the at-speed test clock generator, which supports at-speed testing for inter- clock domain and intra-clock domain logic. Experimental results demonstrate that the proposed design has low area overhead when increasing the number of clocks.

关键词： Clocks Circuit testing Logic testing Automatic testing Circuit faults system testing Automatic test pattern generation Phase locked loops Automatic generation control Frequency

来源：评论

学校读者我要写书评

暂无评论

NXG05-4: Fast Packet Classification using Group Bit Vector

NXG05-4: Fast Packet Classification using Group Bit Vector

引用

IEEE Globecom 2006

作者： Tong Liu Huawei Li Xiaowei Li Yinhe Han Advanced Test Technology Laboratory Key Laboratory of Computer System anChinesed Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit vector based two-dimensional packet classification algorithm called Group Bit Vector. The key feature of the proposed algorithm is its ability to set the length of the bit vector to perform AND operation (the operation bit vector) regardless of the size of rule databases by effectively aggregating the rules and constructing particular groups of a limited number of members. Moreover, the proposed algorithm avoids the problem of false matches, which may be brought by rules aggregation. Thus, the length of the operation bit vector can be adjusted to be suitable to the width of memories to improve the performance. Experimental results demonstrate the flexibility and effectiveness of the proposed algorithm.

关键词： Classification algorithms Databases Hardware Routing Next generation networking Protocols system testing computer architecture Electronic mail Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Deterministic Diagnostic Pattern Generation (DDPG) for Compound Defects

Deterministic Diagnostic Pattern Generation (DDPG) for Compo...

引用

IEEE International Test Conference

作者： Fei Wang Hu Yu Huawei Li Xiaowei Li Jing Ye Huang Yu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China. huyu@*** Mentor Graphics Corporation 300 Nickerson Rd. Marlborough MA 01752 USA.

Scan chain failure diagnosis has become an important means for silicon debug and yield improvement. Although plenty of prior work discussed how to perform scan chain diagnosis, most of the previously proposed techniques made an assumption that the system logic is fault-free, which could be an impractical assumption leading to incorrect diagnostic results. In this paper, we propose a scan chain deterministic diagnostic pattern generation (DDPG) method that can tolerate the faults in the system logic without degradation of chain diagnostic resolution and precision. The entire flow includes three steps. In the first step, patterns are created to propagate the state of a targeted scan cell to as many reliable observation points as possible. In the second step, the load error probability of each targeted scan cell is calculated based on the hamming distances between the observed responses and the expected good or faulty responses. In the last step, a suspect profile is plotted, which can be used to identify the suspect scan cell(s) based on ranking scores. Experimental results show that the diagnostic resolution and precision are not degraded even with dozens of faults injected into the system logic.

关键词： Fault diagnosis Degradation Hardware Logic testing Laboratories computer architecture computer graphics Silicon Error probability Logic design

来源：评论

学校读者我要写书评

暂无评论

Early Experiences with Write-Write Design of NFS over RDMA

Early Experiences with Write-Write Design of NFS over RDMA

引用

International Conference on Networking, architecture, and Storage (NAS)

作者： Bo Li Panyong Zhang Zhigang Huo Dan Meng National Research Center for Intelligent Computing Systems Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy of Sciences China National Research Center for Intelligent Computing Systems Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy and Sciences China

The network file system (NFS) protocol, as the de facto standard for sharing files in a distributed environment, has deployed Infiniband as the underlying transport of sunRPC, namely NFS over RDMA. In the current Read-Write design of NFS over RDMA, NFS write performance is limited for not fully utilizing the features of Infiniband. In this paper, we take on the challenge of enhancing the write performance of NFS. We propose and evaluate a new design of sunRPC over RDMA, namely Write-Write design. To guarantee the security of our design, we propose an HCA-based memory protection extension of Infiniband. Evaluations show that our Write-Write design increases the kernel-to-kernel RPC bandwidth by 15~27%. In real disk test, our Write-Write design gains 15%~22% in multi-client benchmarks compared with the Read-Write design.

关键词： Security Protection Bandwidth Scalability computer architecture computer networks Distributed computing File systems Benchmark testing Protocols

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Evaluating Memory Compression and Deduplication

Evaluating Memory Compression and Deduplication

引用

International Conference on Networking, architecture, and Storage (NAS)

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

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.

关键词： Random access memory Memory management Dictionaries Encoding computers Compression algorithms Data compression

来源：评论

学校读者我要写书评

暂无评论

CuHMMer: A load-balanced CPU-GPU cooperative bioinformatics application

CuHMMer: A load-balanced CPU-GPU cooperative bioinformatics ...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Ping Yao Hong An Mu Xu Gu Liu Xiaoqiang Li Yaobin Wang Wenting Han 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

GPUs have recently been used to accelerate data-parallel applications for they provide easier programmability and increased generality while maintaining the tremendous memory bandwidth and computational power. Most of those applications use CPU as a controller who decides when GPUs run the computing-intensive tasks. This CPU-control-GPU-compute pattern wastes much of CPU's computational power. In this paper, we present a new CPU-GPU cooperative pattern for bioinformatics applications which can use both of CPU and GPU to compute. This pattern includes two parts: 1) the load-balanced data structure which manages data to keep the computational efficiency of GPU high enough when the length distribution of sequences in a sequence database is very uneven; 2) multi-threaded code partition which schedules computing on CPU and GPU in a cooperative way. Using this pattern, we develop CuHMMer based on HMMER which is one of the most important algorithms in bioinformatics. The experimental result demonstrates that CuHMMer get 13x to 45x speed up over available CPU implementations and could also outperform the traditional CUDA implementations which use CPU-control-GPU-compute pattern.

关键词： Hidden Markov models Graphics processing unit Databases Kernel computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：