Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Scalable Community Detection Using Distributed Louvain Algorithm, Naw Safrin Sattar May 2019

Scalable Community Detection Using Distributed Louvain Algorithm, Naw Safrin Sattar

University of New Orleans Theses and Dissertations

Community detection (or clustering) in large-scale graph is an important problem in graph mining. Communities reveal interesting characteristics of a network. Louvain is an efficient sequential algorithm but fails to scale emerging large-scale data. Developing distributed-memory parallel algorithms is challenging because of inter-process communication and load-balancing issues. In this work, we design a shared memory-based algorithm using OpenMP, which shows a 4-fold speedup but is limited to available physical cores. Our second algorithm is an MPI-based parallel algorithm that scales to a moderate number of processors. We also implement a hybrid algorithm combining both. Finally, we incorporate dynamic load-balancing in …


Swept Volume Generation For Virtual Operation Of Micro And Nano-Devices, Xu Wei, Zhao Xin, Guangyi Sun Jan 2019

Swept Volume Generation For Virtual Operation Of Micro And Nano-Devices, Xu Wei, Zhao Xin, Guangyi Sun

Journal of System Simulation

Abstract: With the increasing popularity of computer technology, it becomes important to obtain the swept volume of target objects or spatial point sets, effectively. In order to solve the problem, a voxel-based method is proposed to generate swept volume. OpenMP and C++AMP parallel computing technologies are used for fast voxel-based operation. By using C++ AMP technology, the computing speed is improved greatly. Traditionally, swept volume has been used in the field of path planning and industrial assembly. In this paper, swept volume technology is applied to the simulation of virtual operation of micro and nano-devices for the first time. The …