Siang Wun Song

Affiliations:
  • University of Sao Paulo, Brazil


According to our database1, Siang Wun Song authored at least 64 papers between 1977 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
New BSP/CGM algorithms for spanning trees.
Int. J. High Perform. Comput. Appl., 2019

A hybrid CPU-GPU-MIC algorithm for minimal hitting set enumeration.
Concurr. Comput. Pract. Exp., 2019

2018
A New Efficient Parallel Algorithm for Minimum Spanning Tree.
Proceedings of the 30th International Symposium on Computer Architecture and High Performance Computing, 2018

2017
Finding exact hitting set solutions for systems biology applications using heterogeneous GPU clusters.
Future Gener. Comput. Syst., 2017

A Parallel Algorithm for Minimum Spanning Tree on GPU.
Proceedings of the 2017 International Symposium on Computer Architecture and High Performance Computing Workshops, 2017

2016
Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA.
J. Braz. Comput. Soc., 2016

2015
Efficient BSP/CGM Algorithms for the Maximum Subsequence Sum and Related Problems<sup>1</sup>.
Proceedings of the International Conference on Computational Science, 2015

A Multi-GPU Hitting Set Algorithm for GRNs Inference.
Proceedings of the 15th IEEE/ACM International Symposium on Cluster, 2015

2014
A Parallel Maximum Subarray Algorithm on GPUs.
Proceedings of the 26th IEEE International Symposium on Computer Architecture and High Performance Computing Workshop, 2014

A CUDA based Solution to the Multidimensional Knapsack Problem Using the Ant Colony Optimization.
Proceedings of the International Conference on Computational Science, 2014

2013
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds.
IEEE Trans. Parallel Distributed Syst., 2013

Parallel transitive closure algorithm.
J. Braz. Comput. Soc., 2013

2012
Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU.
Proceedings of the 41st International Conference on Parallel Processing Workshops, 2012

2011
A multi-GPU algorithm for large-scale neuronal networks.
Concurr. Comput. Pract. Exp., 2011

2010
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search.
RAIRO Theor. Informatics Appl., 2010

Performance results of running parallel applications on the InteGrade.
Concurr. Comput. Pract. Exp., 2010

Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

2007
Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2007

2006
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.
Algorithmica, 2006

A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Reliable Systolic Computing Through Redundancy.
Proceedings of the Advances in Computer Systems Architecture, 11th Asia-Pacific Conference, 2006

2005
An all-substrings common subsequence algorithm.
Electron. Notes Discret. Math., 2005

Generating Parallel Algorithms for Cluster and Grid Computing.
Proceedings of the Computational Science, 2005

2004
Preface.
Discret. Appl. Math., 2004

Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

BSP/CGM Algorithms for Maximum Subsequence and Maximum Subarray.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
A Parallel Solution to Infer Genetic Network Architectures in Gene Expression Analysis.
Int. J. High Perform. Comput. Appl., 2003

Computing Maximum Subsequence in Parallel.
Proceedings of the II Brazilian Workshop on Bioinformatics, 2003

Comparison of Genomes Using High-Performance Parallel Computing.
Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2003), 2003

Efficient Parallel Implementation of Transitive Closure of Digraphs.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Parallel Wavefront Algorithm for Efficient Biological Sequence Comparison.
Proceedings of the Computational Science and Its Applications, 2003

2002
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.
Algorithmica, 2002

A CGM/BSP Parallel Similarity Algorithm.
Proceedings of the I Brazilian Workshop on Bioinformatics, 2002

A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis.
Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2002), 2002

A Parallel Algorithm for Transitive Closure.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

2001
Parallel Pattern Matching with Scaling.
Parallel Process. Lett., 2001

A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Design of Efficient and Scalable Parallel Algorithms.
Scalable Comput. Pract. Exp., 2000

Broadcasting in Bus Interconnection Networks.
J. Interconnect. Networks, 2000

Revisiting Hamiltonian Decomposition of the Hypercube.
Proceedings of the 13th Annual Symposium on Integrated Circuits and Systems Design, 2000

Coarse Grained Parallel Graph Planarity Testing.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999
Parallel Range Minima on Coarse Grained Multicomputers.
Int. J. Found. Comput. Sci., 1999

A Note on Parallel Selection on Coarse-Grained Multicomputers.
Algorithmica, 1999

A Range Minima Parallel Algorithm for Coarse Grained Multicomputers.
Proceedings of the Parallel and Distributed Processing, 1999

1998
Efficient Selection Algorithms on Distributed Memory Computers.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1998

1997
Embedding Hierarchical Hypercube Networks into the Hypercube.
IEEE Trans. Parallel Distributed Syst., 1997

Randomized parallel list ranking for distributed memory multiprocessors.
Int. J. Parallel Program., 1997

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Gossiping in Bus Interconnection Networks.
Parallel Algorithms Appl., 1996

On Embedding Various Networks into the Hypercube Using Matrix Transformations.
Proceedings of IPPS '96, 1996

1995
Matrix Representation of Network Embeddings in a Hypercube.
Proceedings of the Parallel Computing: State-of-the-Art and Perspectives, 1995

Efficient Embeddings into the Hypercube Using Matrix Transformations.
Proceedings of the 9th international conference on Supercomputing, 1995

1994
Bus-Based Parallel Computers: A Viable Way for Massive Parallelism.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

SIMD Algorithms for Matrix Multiplication on the Hypercube.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

Towards a simple construction method for Hamiltonian decomposition of the hypercube.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993
A real-time systolic algorithm for on-the-fly hidden surface removal.
Proceedings of the International Conference on Application-Specific Array Processors, 1993

1992
Revisiting cycle shrinking.
Parallel Comput., 1992

Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach.
Integr., 1992

New Techniques for Cycle Shrinking.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

1989
Comprehensive evaluation of a two-dimensional configurable array.
Proceedings of the Nineteenth International Symposium on Fault-Tolerant Computing, 1989

1981
A Survey and Taxonomy of Database Machines.
IEEE Database Eng. Bull., 1981

1977
An Efficient Parallel Garbage Collection System and Its Correctness Proof
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977


  Loading...