## Scalable Coarse Grained Parallel Interval Graph Algorithms (2000)

Venue: | In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas (2000 |

Citations: | 1 - 1 self |

### BibTeX

@INPROCEEDINGS{He00scalablecoarse,

author = {Xin He and Chun-hsi Huang},

title = {Scalable Coarse Grained Parallel Interval Graph Algorithms},

booktitle = {In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas (2000},

year = {2000},

pages = {1369--1375}

}

### OpenURL

### Abstract

We present scalable coarse grained parallel algorithms for solving interval graph problems on a BSP-like model--Coarse Grained Multicomputers (CGM). The problems we consider include: finding maximum independent set, maximum weighted clique, minimum coloring and cut vertices and bridges. With scalability at ; 8ffl ? 0 (here n denotes the total input size and p the number of processors), our algorithms for maximum independent set and minimum coloring use optimal computation time and O(log p) communication rounds, which is independent of the input size and grows slowly only with the number of processors. Equally scalable are our algorithms for finding maximum weighted clique, cut vertices and bridges, which use O(1) communication rounds and optimal local computation time, achieving both communication and computation optimality.

### Citations

1195 |
Algorithmic Graph Theory And Perfect Graphs
- Golumbic
- 1980
(Show Context)
Citation Context ...n be put into one-to-one correspondence with a set of intervals = of a linearly ordered set such that two vertices are connected by an edge of G if and only if their corresponding intervals intersect =-=[8]-=-. (= is called an interval model of G.) Due to richness in real world applications from various fields, such as biology, psychology, archaeology, protein sequencing, VLSI design and many scheduling pr... |

1193 |
A bridging model for parallel computation
- Valiant
- 1990
(Show Context)
Citation Context ...ory performance prediction while implemented on commercially available parallel machines. It has been pointed out that communication is the major bottleneck for the performance of parallel algorithms =-=[18]-=-. Valiant proposed a bridging model, BSP (Bulk Synchronous Parallel), based on a generic parallel machine model [18], which is defined as the combination of three attributes: (1) p processors, each co... |

102 |
Parallel Computation: Models and Methods
- Akl
- 1997
(Show Context)
Citation Context ...ng the weak-CREW [9] property of CGM model.) Next we describe two examples using prefix sum operations, which will appear as subprocedures in some algorithms in the incoming sections. 4 Array Packing =-=[1]-=-: Given an array A= fa 1 ; a 2 ; \Delta \Delta \Delta ; a n g, some of whose elements are labeled. We need to pack all labeled elements at the front of the array. The corresponding CGM algorithm is a ... |

88 |
Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers
- Dehne, Fabri, et al.
- 1993
(Show Context)
Citation Context ... n p ). Assuming different network broadcast and combining capabilities [9], variations of BSP have also been proposed. One variation is CGM (Coarse Grained Multicomputer) which has been discussed in =-=[2, 4, 5, 6, 7]-=-. A CGM algorithm consists of an alternating sequence of computation rounds and communication rounds [4], separated by barrier synchronizations. The router is capable of duplicating data items in mess... |

80 | Scalable parallel computational geometry for coarse grained multicomputers
- Dehne, Fabri, et al.
- 1993
(Show Context)
Citation Context ... n p ). Assuming different network broadcast and combining capabilities [9], variations of BSP have also been proposed. One variation is CGM (Coarse Grained Multicomputer) which has been discussed in =-=[2, 4, 5, 6, 7]-=-. A CGM algorithm consists of an alternating sequence of computation rounds and communication rounds [4], separated by barrier synchronizations. The router is capable of duplicating data items in mess... |

71 | Efficient algorithms for interval graphs and circular-arc graphs. Networks 12 - Gupta, Lee, et al. - 1982 |

65 | Communication-efficient parallel sorting
- Goodrich
- 1996
(Show Context)
Citation Context ...tation. In each superstep, every processor can perform operations on its local data, as well as send/receive messages of size O( n p ). Assuming different network broadcast and combining capabilities =-=[9]-=-, variations of BSP have also been proposed. One variation is CGM (Coarse Grained Multicomputer) which has been discussed in [2, 4, 5, 6, 7]. A CGM algorithm consists of an alternating sequence of com... |

64 | Ecient parallel graph algorithms for coarse grained multicomputers and BSP
- Caceres, Dehne, et al.
- 1997
(Show Context)
Citation Context ... n p ). Assuming different network broadcast and combining capabilities [9], variations of BSP have also been proposed. One variation is CGM (Coarse Grained Multicomputer) which has been discussed in =-=[2, 4, 5, 6, 7]-=-. A CGM algorithm consists of an alternating sequence of computation rounds and communication rounds [4], separated by barrier synchronizations. The router is capable of duplicating data items in mess... |

28 |
An optimal greedy heuristic to color interval graphs
- Olariu
- 1991
(Show Context)
Citation Context ... in real world applications from various fields, such as biology, psychology, archaeology, protein sequencing, VLSI design and many scheduling problems, interval graphs have been intensely researched =-=[3, 10, 11, 12, 13, 14, 15, 16, 19, 20]-=-. Many NP-complete problems on general graphs, such as finding maximum clique, maximum independent set and minimum coloring, etc., have efficient sequential algorithms and efficient parallel algorithm... |

24 |
Finding hamiltonian circuits in interval graphs
- Keil
- 1985
(Show Context)
Citation Context ... in real world applications from various fields, such as biology, psychology, archaeology, protein sequencing, VLSI design and many scheduling problems, interval graphs have been intensely researched =-=[3, 10, 11, 12, 13, 14, 15, 16, 19, 20]-=-. Many NP-complete problems on general graphs, such as finding maximum clique, maximum independent set and minimum coloring, etc., have efficient sequential algorithms and efficient parallel algorithm... |

17 | Practical parallel algorithms for minimum spanning trees
- Dehne, Götz
- 1998
(Show Context)
Citation Context |

11 |
Some parallel algorithms on interval graphs
- Bertossi, Bonuccelli
- 1987
(Show Context)
Citation Context ... in real world applications from various fields, such as biology, psychology, archaeology, protein sequencing, VLSI design and many scheduling problems, interval graphs have been intensely researched =-=[3, 10, 11, 12, 13, 14, 15, 16, 19, 20]-=-. Many NP-complete problems on general graphs, such as finding maximum clique, maximum independent set and minimum coloring, etc., have efficient sequential algorithms and efficient parallel algorithm... |

6 |
Optima] computation of prefix sums on a binary tree of processors
- Meljer, Akl
- 1987
(Show Context)
Citation Context |

4 |
Optimal Parallel Algorithms for Finding Cut Vertices and
- Sprague, Kulkarni
- 1992
(Show Context)
Citation Context |

3 |
Pandu Rangan, New sequential and parallel algorithms for interval graph recognition
- Ramalingam, C
- 1990
(Show Context)
Citation Context |

3 |
Tarjan and Uzi Vishkin. An efficient parallel biconnectivity algorithm
- Robert
- 1985
(Show Context)
Citation Context ...ations, we would need to relocate the records in such a way that those of the same depths are stored in consecutive processors. To accomplish this, we apply the well known method by Tarjan and Vishkin=-=[17]-=- to compute Euler Tours of trees in our forest F and further compute depths for all records. Another sorting by depth of each record finishes our record relocation. Caceres [4] presented CGM algorithm... |

3 |
An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its sorted Model
- Yu, Yang
- 1992
(Show Context)
Citation Context |

2 |
Parallel Geometric Algorithms in CoarseGrained Network Models
- ATALLAH, CHEN
- 1998
(Show Context)
Citation Context |

2 |
A Simple Optimal Algorithm for the Minimum Coloring
- Yu, Yang
- 1993
(Show Context)
Citation Context |

1 |
Parallel Algorithms for Connectivity problems on Interval Graphs
- Saxena, Rao
- 1995
(Show Context)
Citation Context |