© 1994 by British Computer Society
An Optimal Algorithm for Reducing Edge-Solvable Mutual Exclusion Graphs
1 Department of Computer Science, University of Houston-Clear Lake, 2700 Bay Area Boulevard, Houston, TX 77058, USA, 2 Department of Computer Science, University of North Texas, Denton, TX 76203, USA
A mutual exclusion graph can be used to model a graphical mutual exclusion problem where a concurrent process is represented by a vertex and a mutual exclusion constraint between two processes is represented by an edge joining the two corresponding vertices. The first step of an algorithm for generating very efficient semaphore-based edge-solvable synchronization solutions for a class of graphical mutual exclusion problems calls for reducing the mutual exclusion graph to an optimal final graph with a single composite vertex representing them. The process of reduction involves the identification of similar vertices (with identical neighbors except, perhaps, the vertices themselves) and the replacement of the similar vertices by a composite vertex. In this paper, a fast worst case O(N2) reduction algorithm, where N is the number of vertices in the graph, that adds vertices incrementally to build the final graph is presented. Using the new algorithm, the entire algorithm for the automatic generation of edge-solvable solutions becomes O(N2) too. Because of the vast improvement over the straightforward O(N4) reduction algorithm, this algorithm should also be of theoretical interest. Since the number of edges is O(N2), and every edge must be visited in any graph reduction algorithm, the algorithm is optimal.
Received April 6, 1993. revised October 26, 1993.
* Department of Computer Science, University of Houston – Clear Lake, 2700 Bay Area Boulevard, Houston, TX 77058, USA
Department of Computer Science, University of North Texas, Denton, TX 76203, USA