Search Results - "Siang Wun Song"
-
1
New BSP/CGM algorithms for spanning trees
Published in The international journal of high performance computing applications (01-05-2019)“…Computing a spanning tree (ST) and a minimum ST (MST) of a graph are fundamental problems in graph theory and arise as a subproblem in many applications. In…”
Get full text
Journal Article -
2
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds
Published in IEEE transactions on parallel and distributed systems (01-04-2013)“…Given a sequence A of real numbers, we wish to find a list of all nonoverlapping contiguous subsequences of A that are maximal. A maximal subsequence M of A…”
Get full text
Journal Article -
3
A Parallel Maximum Subarray Algorithm on GPUs
Published in 2014 International Symposium on Computer Architecture and High Performance Computing Workshop (01-10-2014)“…This paper presents a parallel algorithm for the maximum sub array problem implemented on a machine with GPUs. Given a sequence of numbers, the maximum…”
Get full text
Conference Proceeding -
4
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components
Published in 2010 International Conference on High Performance Computing & Simulation (01-06-2010)“…Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication rounds,…”
Get full text
Conference Proceeding -
5
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
Published in Algorithmica (01-07-2006)Get full text
Journal Article -
6
-
7
A Parallel Algorithm for Minimum Spanning Tree on GPU
Published in 2017 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW) (01-10-2017)“…Computing a minimum spanning tree (MST) of a graph is a fundamental problem in Graph Theory and arises as a subproblem in many applications. In this paper, we…”
Get full text
Conference Proceeding -
8
A New Efficient Parallel Algorithm for Minimum Spanning Tree
Published in 2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD) (01-09-2018)“…In this paper, using the BSP/CGM model, we propose a parallel algorithm and implement it on a GPGPU to obtain a minimum spanning tree of a graph. Previous…”
Get full text
Conference Proceeding -
9
Message from the Program Chairs
Published in 16th Symposium on Computer Architecture and High Performance Computing (2004)“…Presents the welcome message from the conference proceedings…”
Get full text
Conference Proceeding -
10
Message from the Guest Editors
Published in International journal of parallel programming (01-10-2005)Get full text
Journal Article -
11
A Multi-GPU Hitting Set Algorithm for GRNs Inference
Published in 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (01-05-2015)“…Gene regulatory networks inference is one of the crucial problems of the Systems Biology field. It is still an open problem, mainly because of its high…”
Get full text
Conference Proceeding