Siang Wun Song

TL;DR: An efficient system to perform garbage collection in parallel with list operations is proposed and its correctness is proven and results show that the parallel system is usually significantly more efficient in terms of storage and time than the sequential stack algorithm.

TL;DR: The algorithms for Problems (1)—(7) are the first practically relevant parallel algorithms for these standard graph problems, and the number of communication rounds/ supersteps obtained in this paper is independent of the problem size, and grows only logarithmically with respect to p.

TL;DR: In this paper, the authors present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk-synchronous parallel computer (BSP) models which solve the following well known graph problems: (1) list ranking, (2) Euler tour construction, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation, (6) computing an ear decomposition, (7) 2-edge connectivity and biconnectivity (testing and component computation

TL;DR: A chip for performing the 2-D (two-dimensional) convolution in signal and image processing that consists of essentially only one type of simple cells, which are mesh-interconnected in a regular and modular way, and achieves high performance through extensive concurrent and pipelined use of these cells.

TL;DR: A parallel wavefront algorithm for computing an alignment between two strings A and C, with |A| = m and |C| = n, is presented, with very promising experimental results obtained on a 64-node Beowulf machine.