Efficient Parallel Solution to Calculate All Cycles in Graphs

Authors:
Gonzalo Cerruela García;Enrique López Espinosa;Irene Luque Ruiz;Miguel Ángel Gómez-Nieto
Affiliations:
-;-;-;-
Venue:
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Year:
2002

Citing 3
Cited 0

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Is Parallelism for You?

IEEE Computational Science & Engineering
Validity of the single processor approach to achieving large scale computing capabilities

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an implementation for Shared Memory Multiprocessor of a parallel algorithm to extract all cycles from a graph, using the cyclic conjunction operator. Validation of the parallel code was done using a set of graphs with different computational complexity on a shared memory multiprocessor, four load balance distribution was evaluated in the experiments. Obtained results show that parallel algorithm to be suitable for the extraction of all cycles from a graph.