Abstract
The use of PC clusters interconnected by high performance local networks is one of the major current trends in parallel/distributed computing. We give coarse-grained, BSP-like, parallel algorithms to solve many problems arising in the context of interval graphs, namely connected components, maximum weighted clique, BFS and DFS trees, minimum interval covering, maximum independent set and minimum dominating set. All of the described p-processor parallel algorithms require only constant or O(log p) number of communication rounds and are efficient in practice, as demonstrated by our experimental results obtained on a Fast Ethernet based PC cluster.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A.A. Bertossi and M.A. Bonuccelli. Some Parallel Algorithms on Interval Graphs. Discrete Applied Mathematics, 16:101–111, 1987.
E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. of ICALP’97, pages 131–143. Lecture Notes in Computer Science. Springer-Verlag, 1997.
R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal tree evaluation in logarithmic time. Algorithmica, 3:329–346, 1988.
D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Shacuser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proc. 4th ACM SIGPLAN Symp. on Princ. and Practice of Parallel Programming, pages 1–12, 1993.
F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In Proc. 9th ACM Symp. on Computational Geometry, pages 298–307, 1993.
M. Diallo, A. Ferreira, and A. Rau-Chaplin. Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science — STACS’98, Lecture Notes in Computer Science, Paris, France, February 1998. Springer Verlag.
A. Ferreira, I. Guerin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel computation of interval graphs on PC clusters: Algorithms and experiments. RR LIAFA 97-30, University of Paris 7, http://www.liafa.jussieu.fr/~guerin/biblio.html, 1997.
A. Ferreira, C. Kenyon, A. Rau-Chaplin, and S. Ubéda. d-dimensional range search on multicomputers. Algorithmica, in press. Special Issue on Coarse Grained Algorithms.
A. Ferreira and M. Morvan. Models for parallel algorithm design: An introduction. In A. Migdalas, P. Pardalos, and S. Storoy, editors, Parallel Computing in Optimization, pages 1–26. Kluwer Academic Publisher, Boston (USA), 1997.
A. Ferreira, A. Rau-Chaplin, and S. Ubéda. Scalable 2d convex hull and triangulation for coarse grained multicomputers. In Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, San Antonio, USA, pages 561–569. IEEE Press, October 1995.
A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R Manchek, and V. Sunderman. PVM: Parallel Virtual Machine — A Users’ Guide and Tutorial for Networked Parallel Computing, 1994.
A.V Gerbessiotis and L.G Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, pages 251–267, 1994.
M.T. Goodrich. Communication-efficient parallel sorting. In Proc. of 28th Symp. on Theory of Computing, 1996.
S.K. Kim. Optimal Parallel Algorithms on Sorted Intervals. In Proc. 27th Annual Allerton Conference Communication, Control and Computing, volume 1, pages 766–775, 1990.
A. Moitra and R. Johnson. PT-Optimal Algorithms for Interval Graphs. In Proc. 26th Annual Allerton Conference Communication, Control and Computing, volume 1, pages 274–282, 1988.
S. Olariu. Parallel graph algorithms. In A. Zomaya, editor, Handbook of Parallel and Distributed Computing, pages 355–403. McGraw-Hill, 1996.
S. Olariu, J.L. Schwing, and J. Zhang. Optimal Parallel Algorithms for Problems Modelled by a Family of Intervals. IEEE Transactions on Parallel and Distributed Systems, 3(3):364–374, 1992.
L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33:103–111, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferreira, A., Lassous, I.G., Marcus, K., Rau-Chaplin, A. (1998). Parallel computation on interval graphs using PC clusters: Algorithms and experiments. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057943
Download citation
DOI: https://doi.org/10.1007/BFb0057943
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive