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

Physically based distributed ray tracing algorithm for high resolution imaging based on PBRT

Journal of computational Information Systems 2013年第16期9卷 6381-6390页

作者： Wu, Changmao Zhang, Yunquan Yang, Congli University of Chinese Academy of Sciences Beijing 100049 China Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

Ray tracing, one of the core algorithms in computer graphics, is a technique for image synthesis: creating a photorealistic picture of a 3-D world. Ray tracing technique for image rendering has produced some of the most realistic images to date. It is also slow because the process of tracing a ray is computationally intensive and because there are hundreds of thousands of rays to be traced. Its expensive computational cost becomes a bottleneck for application, especially in the case of large and complex scenes. In this paper, we offer a novel parallel ray tracing algorithm for multi-core platform and a distributed parallel ray tracing algorithm for computer cluster with the purpose of resolving the bottleneck. Experiments on Dawning 6000 Super Computer show that when using CPU cores from 32 to 320, the corresponding speedup reached to a perfect speedup, which is close to theoretic linear speedup. The proposed algorithm is effective and highly scalable with respect to Stanford University's PBRT. This method can be applied to ray tracing process effectively to accelerate the efficiency of rendering. © 2013 Binary Information Press.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

High performance two-dimensional phase unwrapping on gpus 14

High performance two-dimensional phase unwrapping on gpus

引用

11th ACM International Conference on Computing Frontiers, CF 2014

作者： Wu, Zhenhua Ma, Wenjing Long, Guoping Li, Yucheng Tang, Qiuyan Wang, Zhongjie Lab. of Parallel Software and Computational Science Institute of Software University of Chinese China Science and Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)9781450328708

Phase unwrapping is an important procedure in digital im-age and signal processing, and has been widely used in many elds, such as optical and microwave interferometry, mag-netic resonance imaging, synthetic aperture radar, adaptive optics. Phase unwrapping is a time consuming process with large amount of calculations and complicated data depen-dency. A number of algorithms with different features have been developed to solve this problem. Among all of them, Goldstein's algorithm is one of the most widely used algo-rithms, and has been included in some standard libraries (such as MATlab). In this paper we propose an innovative implementation of Goldstein's algorithm on GPU. Several important approaches and optimizations are proposed for the GPU algorithm. For example, by introducing a local-matching step, we were able to parallelize the branchcut step effciently, getting much better performance than ex-isting work. With a cascaded propagation model, another important operation in the algorithm, floodfill, is able to make good use of the computing power of GPU. We tested our GPU algorithm on NVIDIA C2050 and K20 GPUs, and achieved speedup of up to 781 and 896 over the CPU imple-mentation respectively. To the best of our knowledge, this is the best performance of unwrap ever achieved on GPUs. © 2014 ACM.

关键词： MATlab

来源：评论

学校读者我要写书评

暂无评论

Optimizing SpMV for diagonal sparse matrices on GPU

Optimizing SpMV for diagonal sparse matrices on GPU

引用

40th International Conference on parallel Processing, ICPP 2011

作者： Sun, Xiangzheng Zhang, Yunquan Wang, Ting Zhang, Xianyi Yuan, Liang Rao, Li Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769545103

Sparse Matrix-Vector multiplication (SpMV) is an important computational kernel in scientific applications. Its performance highly depends on the nonzero distribution of sparse matrices. In this paper, we propose a new storage format for diagonal sparse matrices, defined as Compressed Row Segment with Diagonal-pattern (CRSD). In CRSD, we design diagonal patterns to represent the diagonal distribution. As the Graphics Processing Units (GPUs) have tremendous computation power and OpenCL makes them more suitable for the scientific computing, we implement the SpMV for CRSD format on the GPUs using OpenCL. Since the OpenCL kernels are complied at runtime, we design the code generator to produce the codelets for all diagonal patterns after storing matrices into CRSD format. Specifically, the generated codelets already contain the index information of nonzeros, which reduces the memory pressure during the SpMV operation. Furthermore, the code generator also utilizes property of memory architecture and thread schedule on the GPUs to improve the performance. In the evaluation, we select four storage formats from prior state-of-the-art implementations (Bell and Garland, 2009) on GPU. Experimental results demonstrate that the speedups reach up to 1.52 and 1.94 in comparison with the optimal implementation of the four formats for the double and single precision respectively. We also evaluate on a two-socket quad-core Intel Xeon system. The speedups reach up to 11.93 and 12.79 in comparison with CSR format under 8 threads for the double and single precision respectively. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous multi-core parallel SGEMM performance testing and analysis on Cell/B.E processor

Heterogeneous multi-core parallel SGEMM performance testing ...

引用

IEEE International Conference on Networking, Architecture and Storage

作者： Li, Yan Zhang, Yunquan Wang, Ke Guan, Wenhua Lab. of Parallel Software and Computational Science ISCAS Beijing China State Key Lab. of Computer Science CAS Beijing China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769541341

Matrix multiplication is one of the most common and vital numerical operations in the field of scientific computing, which is the kernel routine of Level 3 BLAS. The STI CELL processor is a heterogeneous multiprocessor with a unique design to achieve peak floating point performance. As matrix multiplication operation is essential for a wide range of numerical algorithms and single improvement to the GEMM routine immediately can benefits the entire algorithm. In this paper, we provide a new way to utilize the hardware features of Cell to achieve better performance on the single precision general matrix multiplication (SGEMM), by using both of heterogeneous PPEs and SPEs parallelization, our method gain speedup over the Cell SDK. © 2010 IEEE.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

Study on parallel Computing

引用

Journal of Computer science & Technology 2006年第5期21卷 665-673页

作者：陈国良孙广中张云泉莫则尧 Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 P.R. China Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080 P.R. China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Beijing 100088 P.R. China

In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical base of parallel computing, parallel programming which is the software support of parallel computing. After that, we also introduce some parallel applications and enabling technologies. We argue that parallel computing research should form an integrated methodology of ＂architecture algorithm programming application＂. Only in this way, parallel computing research becomes continuous development and more realistic.

关键词： parallel computing parallel architecture parallel programming parallel algorithm parallel application

来源：评论

学校读者我要写书评

暂无评论

A prompt-based approach to adversarial example generation and robustness enhancement

引用

Frontiers of Computer science 2024年第4期18卷 85-96页

作者： Yuting YANG Pei HUANG Juan CAO Jintao LI Yun LIN Feifei MA Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Computer Science Stanford UniversityCA 94305USA School of Computing National University of SingaporeSingapore 119077Singapore Laboratory of Parallel Software and Computational Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Recent years have seen the wide application of natural language processing(NLP)models in crucial areas such as finance,medical treatment,and news media,raising concerns about the model robustness and *** find that prompt paradigm can probe special robust defects of pre-trained language *** prompt texts are first constructed for inputs and a pre-trained language model can generate adversarial examples for victim models via *** results show that prompt paradigm can efficiently generate more diverse adversarial examples besides synonym ***,we propose a novel robust training approach based on prompt paradigm which incorporates prompt texts as the alternatives to adversarial examples and enhances robustness under a lightweight minimax-style optimization *** on three real-world tasks and two deep neural models show that our approach can significantly improve the robustness of models to resist adversarial attacks.

关键词： robustness adversarial example prompt learning pre-trained language model

来源：评论

学校读者我要写书评

暂无评论

A capability-based matchmaking mechanism supporting resource aggregation within large-scale distributed computing infrastructures 4th

A capability-based matchmaking mechanism supporting resource...

引用

4th International Conference on Cloud Computing, CloudComp 2013

作者： Liang, Feng Liu, Hai Liu, Yunzhen Ma, Shilong Zheng, Siyao Deng, Pan State Key Lab of Software Development Environment Beihang University Beijing100191 China The Laboratory of Embedded Systems Beihang University Beijing100191 China Lab of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9783319055053

Facing the large-scale, heterogeneous dynamic resource and the complex constraints of computation-intensive parallel scientific applications, collaborating large-scale computation resource for these applications within Large-Scale Distributed Computing Infrastructures like grids and clouds are challenging. This paper addresses this issue by proposing a Resource Capability Model and implementing a corresponding language GSO and an information service Application Information Service to ensure not only the resource description, aggregation, matchmaking but also life cycle management of the reservations and tasks. Experiment result shows that our mechanism is scalable in both Grid and Cloud environment. © Institute for Computer sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Sleep scheduling method based on half-sleep state in the distributed sensor network 9

Sleep scheduling method based on half-sleep state in the dis...

引用

9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014

作者： Deng, Pan Chen, Feng Yan, Biying Zhang, Jianwei Zhao, Long Wan, Jiafu Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China College of Electrical Engineering and Automation Jiangxi University of Science and Technology Ganzhou China

ISBN: (纸本)9783319133256

In order to extend the sensor’s lifetime, this paper researched deeply into the sleep scheduling mechanism in the distributed sensor network. Now, the commonly used sleep scheduling methods based on the coverage have the problem of response delay, so we proposed a sleep scheduling method based on the half-sleep state to overcome this shortcoming. Under the control of regional agent node, this method adopts a minimum coverage algorithm based on the approximate solution to select the minimum coverage node set. Experimental results show that the proposed scheduling method can both reduce power consumption of the whole network effectively and extend the lifetime of the sensor noticeably. © Institute for Computer sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

CLSIFT: An optimization study of the scale invariance feature transform on GPUs

CLSIFT: An optimization study of the scale invariance featur...

引用

15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013

作者： Wang, Weiyan Zhang, Yunquan Guoping, Long Yan, Shengen Jia, Haipeng Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China State Key Laboratory of Computing Science Institute of Software Chinese Academy of Sciences China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769550886

Scale Invariance Feature Transform (SIFT) is quite suitable for image matching because of its invariance to image scaling, rotation and slight changes in illumination or viewpoint. However, due to high computation complexity it's technically challenging to deploy SIFT in real time application situations. To address this problem, we propose CLSIFT, an OpenCL based highly speeded up and performance portable SIFT solution. Important optimization techniques employed in CLSIFT such as: (1) For less global memory traffic, independent logical functions are merged into the same kernel to reuse data.(2) loop buffers are introduced in for data and intermediate results reusing.(3)Task queue used to schedule threads in the same branch to remove branch divergences. (4) Data partition is based on the statics patterns for workload balance among workgroups. (5) Overlap of CPU time and better parallel strategies are used too. With all mentioned efforts, CLSIFT processes lena. jpg at 74.2 FPS and 43.4FPS respectively on NVidia and AMD GPUS, much higher than CPU's nearly 10 FPS and the known fastest SIFTGPU's 39.8 FPS and 13FPS. Moreover in a quantitative comparison approach we analyze those successful strategies beating SIFTGPU, a famous existing GPU implementation. Additionally, we observe and conclude that NVidia GPU achieves better occupancy and performance due to some factors. Finally, we summarize some techniques and empirical guiding principles that may be shared by other applications on GPU. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Modeling the locality in graph traversals

Modeling the locality in graph traversals

引用

41st International Conference on parallel Processing, ICPP 2012

作者： Yuan, Liang Ding, Chen Štefankovič, Daniel Zhang, Yunquan Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China Computer Science Department University of Rochester United States

ISBN: (纸本)9780769547961

An increasing number of applications in physical and social sciences require the analysis of large graphs. The efficiency of these programs strongly depends on their memory usage especially the locality of graph data access. Intuitively, the locality in computation should reflect the locality in graph topology. Existing locality models, however, operate either at program level for regular loops and arrays or at trace level for arbitrary access streams. They are not sufficient to characterize the relation between locality and connectivity. This paper presents a new metrics called the vertex distance and uses it to model the locality in breadth-first graph traversal (BFS). It shows three models that use the average node degree and the edge distribution to predict the number of BFS levels and the reuse distance distribution of BFS. Finally, it evaluates the new models using random and non-random graphs. © 2012 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：