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

On parallelisation of image dehazing with OpenMP

INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS 2019年第4期11卷 427-439页

作者： Weng, Tien-Hsiung Chen, Yi-Siang Lu, Huimin Marino, Mario Donato Li, Kuan-Ching Providence Univ Dept Comp Sci & Informat Engn Taichung 43301 Taiwan Kyushu Inst Technol Dept Mech & Control Engn Kitakyushu Fukuoka Japan Leeds Beckett Univ Sch Comp Creat Technol & Engn City Campus Leeds LS1 3HE W Yorkshire England Guangzhou Univ Guangzhou Guangdong Peoples R China

In this paper, we present our learning experience on the design and implementation of image dehazing parallel code with OpenMP developed from existing fast sequential version. The aim of this work is to present an analysis of a case study showing the development of parallel haze removal with practical and efficient use of shared memory multi-core servers. Implementation technique and result discussions in terms of program improvements that may be needed to support parallel application developers with similar high performance goals are presented. Preliminary studies, results and experiments on haze removal application program are executed on multi-core shared memory platforms, and results show that the performance of the proposed parallel code is promising.

关键词： OpenMP image haze removal multicores parallel programming

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated generic analytic simulation and image reconstruction platform for multi-pinhole SPECT systems 15

GPU-accelerated generic analytic simulation and image recons...

引用

15th International Meeting on Fully Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine

作者： Zeraatkar, Navid Auer, Benjamin Kalluri, Kesava Furenlid, Lars R. Kuo, Philip H. King, Michael A. Univ Massachusetts Dept Radiol Med Sch Worcester MA 01655 USA Univ Arizona Dept Med Imaging Tucson AZ 85719 USA

ISBN: (数字)9781510628380

ISBN: (纸本)9781510628380

We introduce a generic analytic simulation and image reconstruction software platform for multi-pinhole (MPH) SPECT systems. The platform is capable of modeling common or sophisticated MPH designs as well as complex data acquisition schemes. Graphics processing unit (GPU) acceleration was utilized to make a high-performance computing software. Herein, we describe the software platform and provide verification studies of the simulation and image reconstruction software.

关键词： analytic simulation image reconstruction pinhole multi-pinhole SPECT GPU parallel programming

来源：评论

学校读者我要写书评

暂无评论

Efficient parallelization of MLFMA for 3D Electromagnetic Scattering Problems on Sunway Many-core Processor SW26010

Efficient Parallelization of MLFMA for 3D Electromagnetic Sc...

引用

Progress in Electromagnetics Research Symposium - Fall (PIERS - FALL)

作者： W. J. He M. L. Yang W. Wang X. Q. Sheng Center for Electromagnetic Simulation Beijing Institute of Technology Beijing China Computer Network Information Center Chinese Academy of Sciences Beijing China

ISBN: (数字)9781728153049

ISBN: (纸本)9781728153056

A many-core implementation of the multilevel fast multipole algorithm (MLFMA) based on the Athread parallel programming model for computing electromagnetic scattering by a 3-D object on the homegrown many-core SW26010 CPU of China is presented. In the proposed many-core implementation of MLFMA, the data access efficiency is improved by using data structures based on the Structure-of-Array (SoA). The adaptive workload distribution strategies are adopted on different MLFMA tree levels to ensure full utilization of computing capability and the scratchpad memory (SPM). A double-buffering scheme is specially designed to make communication overlapped computation. The resulting Athread-based many-core implementation of the MLFMA is capable for solving real-life problems with over four hundred thousand unknowns with a remarkable speed-up. Numerical results show that with the proposed parallel scheme, a total speed-up larger than 7 times can be achieved, compared with the CPU master-core.

关键词： Electromagnetics Electromagnetic scattering MLFMA Arrays Photonics parallel programming

来源：评论

学校读者我要写书评

暂无评论

Research of Efficiency of Multi-core Computers with Shared Memory

Research of Efficiency of Multi-core Computers with Shared M...

引用

IEEE International Conference on Future Internet of Things and Cloud Workshops (FiCloudW)

作者： Dmytro Nedzelskyi Maryna Derkach Yehor Tatarchenko Svitlana Safonova Larisa Shumova Volodymyr Kardashuk Computer Science and Engineering Department V. Dahl East Ukrainian National University Severodonetsk Ukraine

ISBN: (数字)9781728144115

ISBN: (纸本)9781728144122

Efficient utilization of multi-core computers with shared memory depends on many factors. In this article efficiency of multi-core computers with shared memory is investigated. All computer cores execute either parallel streams of a single program, developed in accordance with the OpenMP API, or independent programs. There are no interactions between streams and independent programs. Both parallel and non-parallel (single stream) applications share memory where conflicts may occur. Models for determining the acceleration coefficients of a multi-core computer, analytical expressions which reflect the dependence of the acceleration coefficients on the number of cores, the properties performed the programs, cores and shared memory parameters and formulas for determine recommended numbers of cores for parallel applications in accordance with the OpenMP API are suggested. The main reason for the decrease in performance of multi-core computers with shared memory when parallelizing applications in accordance with the OpenMP API is the overload of shared memory.

关键词： application program interfaces message passing multiprocessing systems parallel programming public domain software shared memory systems shared memory Application programming interfaces open source software shared memory systems Multiprocessing systems speedup factor parallel programming message passing Computers core

来源：评论

学校读者我要写书评

暂无评论

Using parallel computing for seismo-volcanic event location based on seismic amplitudes 38

Using parallel computing for seismo-volcanic event location ...

引用

38th IEEE Central America and Panama Convention (CONCAPAN)

作者： Cornejo-Surez, Guillermo Van der Laat, Leonardo Meneses, Esteban Pacheco, Javier Mora, Mauricio Costa Rica High Technol Ctr Costa Rica Inst Technol San Carlos Costa Rica Univ Costa Rica Red Sismolg Nacl San Pedro Costa Rica Univ Nacl Costa Rica OVSICORI Heredia Costa Rica

ISBN: (纸本)9781538661222

Volcanoes are very complex geophysical systems where fluids of different nature interact with porous rock at different physical conditions and within a complex matrix of conduits. Two types of seismicity are generated by this complex interactions. The first type is characterized by fracture of the elastic media, in which we have the volcano-tectonic events (VT) that produce two distinctive phases: a compressional phase (P wave) and a shear wave (S wave) that travels with different velocities within solid media. The second type is characterized by low frequencies, in which we have a wide variety of long period events (LP) and volcanic tremors. These signals are produced by fluid motion within restricted paths and have normally emergent onsets and no distinctive P or S wave phases. Classical earthquake source location procedures take advantage of the distinctive phases and their different propagation velocity. However, for LP events and tremors, those procedures can not be used. Therefore, complex algorithms have to be applied, demanding much more computer resources and time than the classical location methods. In this work, we present the analysis and design of a LP and tremor location application based on amplitude decay. We demonstrate that the algorithm is highly parallelizable allowing to develop a parallel implementation using the Python programming language and the de-facto standard for parallel computing, the MPI standard. We show experimentally that it exhibits almost linear scalability with respect to the number of events and the number of cores.

关键词： Volcanic seismology tremor location parallel programming MPI Python

来源：评论

学校读者我要写书评

暂无评论

Comparison of parallel and Successive Interference Cancellation for Non-Orthogonal Multiple Access 2

Comparison of Parallel and Successive Interference Cancellat...

引用

2nd International Conference on Computing and Network Communications (CoCoNet)

作者： Manglayev, Talgat Kizilirmak, Refik Caglar Kho, Yau Hee Nazabayev Univ Dept Elect & Comp Engn Z05H0P9 Astana Kazakhstan Victoria Univ Wellington Sch Engn & Comp Sci Wellington 6140 New Zealand

ISBN: (纸本)9781538659281

Non-orthogonal multiple access (NOMA) is a promising method for the fifth generation (5G) cellular networks as it provides improved spectral efficiency by multiplexing users in power domain. One key challenge for the receivers in NOMA networks is to distinguish the individual signals that use the same band at the same time. Currently, the two widely discussed decoding schemes are successive interference cancellation (SIC) and parallel interference cancellation (PIC). Both schemes suppress the multi-user interference by subtracting the decoded signals from the received signal based on different algorithms, i.e., SIC decodes iteratively and PIC decodes collectively. This paper compares the computation time of SIC and PIC schemes at the base station and demonstrates multi-thread implementation of PIC.

关键词： 5G NOMA SIC PIC parallel programming GPU CUDA

来源：评论

学校读者我要写书评

暂无评论

OMR: Out-of-Core MapReduce for Large Data Sets 2018

OMR: Out-of-Core MapReduce for Large Data Sets

引用

ACM SIGPLAN International Symposium on Memory Management (ISMM)

作者： Kaur, Gurneet Vora, Keval Koduru, Sai Charan Gupta, Rajiv Univ Calif Riverside Riverside CA 92521 USA Simon Fraser Univ Burnaby BC Canada

ISBN: (纸本)9781450358019

While single machine MapReduce systems can squeeze out maximum performance from available multi-cores, they are often limited by the size of main memory and can thus only process small datasets. Our experience shows that the state-of-the-art single-machine in-memory MapReduce system Metis frequently experiences out-of-memory crashes. Even though today's computers are equipped with efficient secondary storage devices, the frameworks do not utilize these devices mainly because disk access latencies are much higher than those for main memory. Therefore, the single-machine setup of the Hadoop system performs much slower when it is presented with the datasets which are larger than the main memory. Moreover, such frameworks also require tuning a lot of parameters which puts an added burden on the programmer. In this paper we present OMR, an Out-of-core MapReduce system that not only successfully handles datasets that are far larger than the size of main memory, it also guarantees linear scaling with the growing data sizes. OMR actively minimizes the amount of data to be read/written to/from disk via on-the-fly aggregation and it uses block sequential disk read/write operations whenever disk accesses become necessary to avoid running out of memory. We theoretically prove OMR's linear scalability and empirically demonstrate it by processing datasets that are up to 5x larger than main memory. Our experiments show that in comparison to the standalone single-machine setup of the Hadoop system, OMR delivers far higher performance. Also in contrast to Metis, OMR avoids out-of-memory crashes for large datasets as well as delivers higher performance when datasets are small enough to fit in main memory.

关键词： Out-of-Core MapReduce Single Machine Fixed/Variable Sized Records Lockless Memory Constrained Processing parallel programming Data Processing

来源：评论

学校读者我要写书评

暂无评论

Novel Method to Minimize the Air-Gap MMF Spatial Harmonic Content in Three-Phase Windings 23

Novel Method to Minimize the Air-Gap MMF Spatial Harmonic Co...

引用

13th International Conference on Electrical Machines (ICEM)

作者： Silva, Andre M. Ferreira, Fernando J. T. E. Falcao, Gabriel Rodrigues, Manuel Univ Coimbra Inst Syst & Robot Dept Elect & Comp Engn Polo 2 P-3030290 Coimbra Portugal Univ Coimbra Inst Telecomunicacoes Dept Elect & Comp Engn Polo 2 P-3030290 Coimbra Portugal

ISBN: (纸本)9781538624777

Most of industrial induction motors currently used employ simple winding patterns, which commonly are designed to fulfil the fundamental magnetizing flux and torque requirements, disregarding the spatial harmonic content of the air-gap magnetomotive force (MMF). However, it is well known that the lower-order MMF spatial harmonics have a negative impact on the motor efficiency, vibration, noise, and torque production. The use of different turns per coil in the winding design is a possible solution to mitigate the problem. In this paper, a novel winding optimizing algorithm is fully described. The air-gap is modelled as a linear function of the current-sheet created by the conductors in the slots. Several winding patterns with different poles for stators with different slots are optimized, and the turns per coil pattern is presented in tables for single and double layer windings with optimal coil pitch shortening. These tables can be used, as reference, in winding design projects. An application example of winding optimization is also presented.

关键词： Stator Winding design winding optimization magnetomotive force spatial harmonic content parasitic torque parallel programming

来源：评论

学校读者我要写书评

暂无评论

Optimization of Task Distribution on Multicore Systems 7

Optimization of Task Distribution on Multicore Systems

引用

7th Mediterranean Conference on Embedded Computing (MECO)

作者： Iyutin, Alexey N. Troshina, Anna G. Soloviev, Alexander E. Tula State Univ Dept Comp Technol Tula Russia Tula State Univ Dept Elect Engn & Elect Equipment Tula Russia

ISBN: (纸本)9781538656839

To use modern multiprocessor and distributed computer architectures effectively it is necessary to parallelize the program code in such a way as to achieve a minimum execution time of the program on a given architecture. In this case if the executing devices have different performance characteristics in a distributed system, during parallelization it should be taken into account this difference and the optimization of the execution time of the entire algorithm should be carried out. The method for solving such an optimization problem is proposed in the article.

关键词： parallel programming semantic Petri-Markov nets semantic relations simulation parallelization optimization problem

来源：评论

学校读者我要写书评

暂无评论

Danse-doigts, a fine motor game

arXiv

引用

arXiv 2019年

作者： Susini, Jean-Ferdy Pons, Olivier Guedin, Nolwenn Thevenot, Catherine CNAM CÉDRIC 292 rue Saint-Martin Paris cédex 0375141 France FPSE UNIGE 40 bd du Pont d'Arve Genève 41205 Switzerland IP UNIL LausanneGéopolis - 1015 Switzerland

This paper describes the design, implementation and testing of "Danse-doigts", an edutainment therapeutic application for hemiplegic children. The objective of this program is twofold. Firstly, to allow them to train their fine motor skills on tablet. Secondly, to study the effect of this training on their numerical performance (counting, calculation...). The target population and the objective of evaluating numerical skills influenced the design. The software was developed using standard web technologies but is based on a new parallel programming library written in JavaScript. Applications and libraries are free of charge and easy to install on most tablets. Copyright © 2019, The Authors. All rights reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：