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

Design, Automation and Test in Europe Conference and Exhibition

作者： Ying Zhang Zebo Peng Jianhui Jiang Huawei Li Masamro Fujita School of Software Engineering Tongji University China Embedded Systems Lab Linköping University Sweden State Key Laboratory of Computer Architecture Chinese Academy of Sciences China VLSI Design and Education Center University of Tokyo Japan

ISBN: (纸本)9783981537048

Delay defects under high temperature have been one of the most critical factors to affect the reliability of computer systems, and the current test methods don't address this problem properly. In this paper, a temperature-aware software-based self-testing (SBST) technique is proposed to self-heat the processors within a high temperature range and effectively test delay faults under high temperature. First, it automatically generates high-quality test programs through automatic test instruction generation (ATIG), and avoids over-testing caused by nonfunctional patterns. Second, it exploits two effective powerintensive program transformations to self-heat up the processors internally. Third, it applies a greedy algorithm to search the optimized schedule of the test templates in order to generate the test program while making sure that the temperature of the processor under test is within the specified range. Experimental results show that the generated program is successful to guarantee delay test within the given temperature range, and achieves high test performance with functional patterns.

关键词： Delays Program processors Temperature distribution Power dissipation Circuit faults Schedules

来源：评论

学校读者我要写书评

暂无评论

Memory Efficient Two-Pass 3D FFT Algorithm for Intel~ Xeon Phi^(TM) Coprocessor

引用

Journal of Computer Science & Technology 2014年第6期29卷 989-1002页

作者：刘益群李焱张云泉张先轶 Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Department of Computer Science and Technology Tsinghua University CCF ACM IEEE State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences

Equipped with 512-bit wide SIMD inst d large numbers of computing cores, the emerging x86-based Intel（R） Many Integrated Core （MIC） architecture ot only high floating-point performance, but also substantial off-chip memory bandwidth. The 3D FFT （three-di fast Fourier transform） is a widely-studied algorithm; however, the conventional algorithm needs to traverse the three times. In each pass, it computes multiple 1D FFTs along one of three dimensions, giving rise to plenty of rided memory accesses. In this paper, we propose a two-pass 3D FFT algorithm, which mainly aims to reduce of explicit data transfer between the memory and the on-chip cache. The main idea is to split one dimension into ensions, and then combine the transform along each sub-dimension with one of the rest dimensions respectively erence in amount of TLB misses resulting from decomposition along different dimensions is analyzed in detail. el parallelism is leveraged on the many-core system for a high degree of parallelism and better data reuse of loc On top of this, a number of optimization techniques, such as memory padding, loop transformation and vectoriz employed in our implementation to further enhance the performance. We evaluate the algorithm on the Intel（R） PhiTM coprocessor 7110P, and achieve a maximum performance of 136 Gflops with 240 threads in offload mode, which ts the vendor-specific Intel（R）MKL library by a factor of up to 2.22X.

关键词： 3D-FFT memory efficie many-core Many Integrated Core Intel（R） Xeon PhiTM

来源：评论

学校读者我要写书评

暂无评论

On Some Proximity Problems of Colored Sets

引用

Journal of Computer Science & Technology 2014年第5期29卷 879-886页

作者：范成林罗军王文成钟发荣朱滨海 Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Huawei Noah's Ark Laboratory State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences College of Mathematics Physics and Information Technology Zhejiang Normal University Department of Computer Science Montana State UniversityBozeman MT 59717 U.S.A. MemberACM

The maximum diameter color-spanning set problem（MaxDCS） is defined as follows： given n points with m colors, select m points with m distinct colors such that the diameter of the set of chosen points is maximized. In this paper, we design an optimal O（n log n） time algorithm using rotating calipers for MaxDCS in the plane. Our algorithm can also be used to solve the maximum diameter problem of imprecise points modeled as polygons. We also give an optimal algorithm for the all farthest foreign neighbor problem（AFFN） in the plane, and propose algorithms to answer the farthest foreign neighbor query（FFNQ） of colored sets in two- and three-dimensional space. Furthermore, we study the problem of computing the closest pair of color-spanning set（CPCS） in d-dimensional space, and remove the log m factor in the best known time bound if d is a constant.

关键词： computational geometry colored set algorithm maximum diameter color-spanning set problem

来源：评论

学校读者我要写书评

暂无评论

Parallelized Race Detection Based on GPU architecture

Parallelized Race Detection Based on GPU Architecture

引用

10th Annual Conference of advanced Computer architecture, ACA 2014

作者： Dai, Zhuofang Zhang, Zheng Wang, Haojun Li, Yi Zhang, Weihua Software School Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China Parallel Processing Institute Fudan University Shanghai 201203 China State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou 450001 China

ISBN: (纸本)9783662444900

In order to harness abundant hardware resources, parallel programming has become a necessity in multicore era. However, parallel programs are prone to concurrency bugs, especially data races. Even worse, current software tools always suffer from both large runtime overheads and poor scalability, while most of hardware supports for race detection are not available in parallel programming. Therefore, it has been a challenge that how to introduce a practical and fast race detection tools. Nowadays, GPUs with massive parallel computation resources have become one of the most popular hardware platforms. Hence, the prevalence of GPU architectures has opened an opportunity of accelerating data race detection. In this paper, we first have a deeply analysis on data race detection algorithms like happens-before and observe that these algorithms have very good computation and data parallelism. Based on the observation, we propose Grace, a software approach that leverages massive parallelism computation units of GPU architectures to accelerate data race detection. Grace deploys detection, the most computation intensive workload, on GPU to fully utilize the computation resource in GPU. Moreover, Grace leverages coarse-grained pipeline parallelism and data parallelism through exploiting the computation resource in multi-core CPUs to further improve performance. Experimental results show that Grace is fast and scalable. It achieves over 80x speedup compared to the sequential version even under a 128-thread configuration. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Mining frequent closed sequential patterns with non-user-defined gap constraints*

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8933卷 57-70页

作者： Wang, Wentao Li, Zhongqi Yang, Hao Tang, Changjie Duan, Lei Duan, Lei Duan, Lei Nummenmaa, Jyrki Deng, Song School of Computer Science Sichuan University China West China School of Public Health Sichuan University China State Key Laboratory of Software Engineering Wuhan University China School of Information Sciences University of Tampere Finland Institute of Advanced Technology Nanjing University of Posts and Telecommunications China

Frequent closed sequential pattern mining plays an important role in sequence data mining and has a wide range of applications in real life, such as protein sequence analysis, financial data investigation, and user behavior prediction. In previous studies, a user predefined gap constraint is considered in frequent closed sequential pattern mining as a parameter. However, it is difficult for users, who are lacking sufficient priori knowledge, to set suitable gap constraints. Furthermore, different gap constraints may lead to different results, and some useful patterns may be missed if the gap constraint is chosen inappropriately. To deal with this, we present a novel problem of mining frequent closed sequential patterns with non-user-defined gap constraints. In addition, we propose an efficient algorithm to find the frequent closed sequential patterns with the most suitable gap constraints. Our empirical study on protein data sets demonstrates that our algorithm is effective and efficient. © Springer International Publishing Switzerland 2014.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

A Cost Sensitive Approach for Virtual Network Reconfiguration

A Cost Sensitive Approach for Virtual Network Reconfiguratio...

引用

2014 IEEE Computers,Communications and IT Applications Conference(ComComAp)

作者： Li Xu Guozhen Tan Xia Zhang Department of Computer Science and Technology Dalian University of Technology State Key Laboratory of Software Architecture(Neusoft Corporation)

ISBN: (纸本)9781479948109

Network Virtualization paves the way for sharing the physical infrastructure with many service providers and enables resources in physical substrate network being applied and provisioned as a form of Virtual Network(VN).However,there exist many obstacles in applications of this *** problem of VN embedding is commonly considered the most difficult one of *** existing research only considers the case of how to embed VN *** user demands on Virtual Network are dynamically changing,how to efficiently reconfigure VN to adapt to changing demand is challenging *** this paper,our objective is to find way for optimally reorganize VN that already embedded on VN in a cost sensitive way to meet the changed *** address this problem by proposing a cost sensitive VN reconfiguration approach.A heuristic VN reconfiguration algorithm with virtual node and virtual link migration and swapping strategy is *** validate and evaluate the given algorithms by conducting experiments in high fidelity emulation *** evaluation results show that the proposed approach can effectively reconfigure VN while minimizing cost and fragmentation of *** comparing our algorithms with others,the given reconfiguration algorithm outperforms existing solutions.

关键词： Network Virtualization Virtual Network Virtual network reconfiguration

来源：评论

学校读者我要写书评

暂无评论

PreCrime to the rescue: Defeating mobile malware one-step ahead 14

PreCrime to the rescue: Defeating mobile malware one-step ah...

引用

5th ACM Asia-Pacific Workshop on Systems, APSYS 2014

作者： Tan, Cheng Li, Haibo Xia, Yubin Zang, Binyu Chu, Cheng-Kang Li, Tieyan Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Software School Fudan University China State Key Laboratory of Computer Architecture ICT Chinese Academy of Sciences China Huawei Technologies Pte Ltd. Singapore Singapore

ISBN: (纸本)9781450330244

Prior mobile malware defensive means is usually retroactive, which may either lead to high false negatives or can hardly recover systems states from malware activities. PreCrime is a proactive malware detection scheme that detects and stops malware activities from happening. PreCrime creates mirrors of a mobile device in a resource-rich and trusted cloud, which speculatively executes multiple likely user operations concurrently to detect potential tampering and information leakage. Our preliminary evaluation shows that PreCrime introduces small performance overhead on smartphones and feasible delay during speculative execution on the cloud. © 2014 ACM.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Dynamic evolution of collective emotions in social networks: a case study of Sina weibo

引用

Science China(Information Sciences) 2013年第7期56卷 150-167页

作者： XIONG XiaoBing ZHOU Gang HUANG YongZhong CHEN HaiYong XU Ke State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Software Development Environment Beihang University

Emotion is a fundamental object of human existence and determined by a complex set of factors. With the rapid development of online social networks (OSNs), more and more people would like to express their emotion in OSNs, which provides wonderful opportunities to gain insight into how and why individual emotion is evolved in social network. In this paper, we focus on emotion dynamics in OSNs, and try to recognize the evolving process of collective emotions. As a basis of this research, we first construct a corpus and build an emotion classifier based on Bayes theory, and some effective strategies (entropy and salience) are introduced to improve the performance of our classifier, with which we can classify any Chinese tweet into a particular emotion with an accuracy as high as 82%. By analyzing the collective emotions in our sample networks in detail, we get some interesting findings, including a phenomenon of emotion synchronization between friends in OSNs, which offers good evidence for that human emotion can be spread from one person to another. Furthermore, we find that the number of friends has strong correlation with individual emotion. Based on those useful findings, we present a dynamic evolution model of collective emotions, in which both self-evolving process and mutual-evolving process are considered. To this end, extensive simulations on both real and artificial networks have been done to estimate the parameters of our emotion dynamic model, and we find that mutual-evolution plays a more important role than self-evolution in the distribution of collective emotions. As an application of our emotion dynamic model, we design an efficient strategy to control the collective emotions of the whole network by selecting seed users according to k-core rather than degree.

关键词： online social network emotion classifier emotion spread emotion dynamic model emotion controlling

来源：评论

学校读者我要写书评

暂无评论

Optimized Data Allocation Method for Distributed Database Systems

Optimized Data Allocation Method for Distributed Database Sy...

引用

2014年国际计算机科学与软件工程学术会议

作者： Hong-Yong YU De-Shuai WANG Wei ZHANG State Key Laboratory of Software Architecture Neusoft Corporation Neusoft ParkNo.2 Xinxiu StreetHunnan New DistrictShenyang 110179China

Distributed database systems are of more importance since Internet-based applications are developing *** Cloud applications and mobile applications require database with better performance and *** to allocate partitioned data to database servers is important to the efficiency of the whole *** paper proposes a heuristic data allocation method to achieve minimizing overall data operation *** results show that the proposed data allocation method can reduce the data operation cost,thus improves the execution efficiency of the application.

关键词： Distributed database Data allocation Heuristic algorithm Optimizing algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of a high-performance full-system instrumentation

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 129-134页

作者： Min, Qing-Hao Zhang, Zheng Wang, Hao-Jun Zhang, Wei-Hua Software School Fudan University Shanghai201203 China Shanghai Key Laboratory of Data Science Fudan University Shanghai201203 China Parallel Processing Institute Fudan University Shanghai201203 China State Key Laboratory of Mathematic Engineering and Advanced Computing PLA Information Engineering University Zhengzhou450001 China

Instrumentation is an important mechanism to collect run-time information of applications for further analysis like bottleneck analysis, hotspot analysis and even bug detection and revision. Currently there are lots of analyzers using instrumentation to collect their source data. However, most of these tools lack of full-system support and thus become inadequate for analyzing multi-core programs as they cannot provide full-system information like scheduling, system calls and inter-process communication, etc. Meanwhile, full-system instrumentation needs to collect OS and hardware information, resulting to performance degradation. In this paper, a high-performance full-system instrumentation method was designed for collecting full-system information as well as application information. The proposed method was implemented inside the QEMU full-system emulator, and 40 MIPS performance on average was achieved after optimization, which was appropriated for normal program analysis. ©, 2014, Northeastern University. All right reserved.

关键词： Full-system High-performance Instrumentation Multi-core

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：