✦ LIBER ✦

Efficient algorithms for the reliabilities of replicated n-parallel-task graphs

✍ Scribed by Frank K. Hwang; Paul E. Wright

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 237 KB
Volume: 19
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(96)00026-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi

Efficient Scheduling of Arbitrary Task G

Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm

✍ Yu-Kwong Kwok; Ishfaq Ahmad 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptio

An efficient parallel algorithm for the

An efficient parallel algorithm for the transitive closure of a graph

✍ P. Fraisse 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Efficient algorithms for computing the r

Efficient algorithms for computing the reliability of permutation and interval graphs

✍ Hosam M. Aboeifotoh; Charles J. Colbourn 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 782 KB

An Efficient Parallel Algorithm for Maxi

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

✍ I. Parfenoff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi

Parallel algorithm for the computation o

Parallel algorithm for the computation of characteristic polynomials of chemical graphs

✍ P. Venuvanalingam; P. Thangavel 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p