Parallel algorithm for conflict graph on OTIS-triangular array

Authors:
Keny T. Lucas;Dheeresh K. Mallick;Prasanta K. Jana
Affiliations:
Department of Information Management, Xavier Institute of Social Service, Ranchi, India;Department of Computer Science and Engineering Birla Institute of Technology, Mesra, Ranchi, India;Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India
Venue:
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Year:
2008

Citing 7
Cited 2

Image Processing on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Parallel and Distributed Systems
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Computers
BPC Permutations on the OTIS-Mesh Optoelectronic Computer

MPPOI '97 Proceedings of the 4th International Conference on Massively Parallel Processing Using Optical Interconnections
Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Polynomial interpolation and polynomial root finding on OTIS-mesh

Parallel Computing
The Fine Structure of Galls in Phylogenetic Networks

INFORMS Journal on Computing

Parallel algorithm for sorting on OTIS-ring multicomputer

Proceedings of the 2nd Bangalore Annual Compute Conference
OTIS-MOT: an efficient interconnection network for parallel processing

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algorithms dealing with the galled tree problem mostly use a conflict graph as the major tool and the construction of the conflict graph has been the central computation in these algorithms. In this paper, we present a parallel algorithm for the construction of a conflict graph. Given a set of n binary sequences, each of size m, our algorithm is mapped on an OTIS-Triangular array and requires 4m + 2n/k -7 electronics moves + 2 OTIS moves, where k = m (m -1)/2. The algorithm is shown to be scalable with respect to n.