Artículos relacionados a Approximate Parallel Scheduling, Vol. 2: Part II: Applicatio...
Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time (Classic Reprint) - Tapa blanda
Reseña del editor
Excerpt from Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time
To the best of our knowledge, this paper presents for the first time optimal, logarithmic time, parallel algorithms for problems on graphs.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Reseña del editor
Excerpt from Approximate Parallel Scheduling, Vol. 2: Part II: Applications to Optimal Parallel Graph Algorithms in Logarithmic Time
Part I of this paper presented a novel technique for approximate parallel scheduling and a new logarithmic time optimal parallel algorithm for the list ranking problem. In this part, we give a new logarithmic time parallel (Pram) algorithm for computing the connected components of undirected graphs which uses this scheduling technique. The connectivity algorithm is optimal unless m= o(n log n), in graphs of n vertices and m edges. Using known results, this new algorithms imply logarithmic time optimal parallel algorithms for a number of other graph problems, including: biconnectivity, Euler tours, strong orientation and r-numbering. Another contribution of the present paper is a parallel union/find algorithm.
To the best of our knowledge, this paper presents for the first time optimal, logarithmic time, parallel algorithms for problems on graphs.
1. Introduction
The models of parallel computation used in this paper are all members of the parallel random, access machine (Pram) family. A Pram employs? synchronous processors all having access to a common memory. An exclusive-read exclusive-write (Crew) Pram does not allow simultaneous access by more than one processor to the same memory location for read or write purposes. A concurrent-read exclusive-write (Crew) Pram allows simultaneous access for reads but not writes. A concurrent-read concurrent-write (Crcw) Pram allows concurrent access for both reads and writes. For the Crcw Pram, we assume that if several processors attempt to write simultaneously at the same memory location then one of them succeeds but we do not know in advance which one. See [Vi-83] for a- survey of results concerning Prams.
Let Seq(n) be the fastest known worst-case running time of a sequential algorithm, where nis the length of the input for the problem at hand. Obviously, the best upper bound on the parallel time achievable using pprocessors, without improving the sequential result, is of the form O(Seqn)/p). A parallel algorithm that achieves this running time is said to have optimal speed-up or more simply to be optimal. A primary goal in parallel computation is to design optimal algorithms that also run as fast as possible.
Most of the problems we consider can be solved by parallel algorithms that obey the following framework.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialForgotten Books
- Año de publicación2018
- ISBN 10 1332101542
- ISBN 13 9781332101542
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas52
Comprar nuevo
Ver este artículo
EUR 14,31
GRATIS gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Approximate Parallel Scheduling, Vol. 2: Part II: Applicatio...
Imagen del vendedor
Approximate Parallel Scheduling, Vol. 2: Part II (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Print on Demand. This book presents an innovative parallel scheduling technique and uses it to create a logarithmic time optimal parallel algorithm for the list ranking problem. The author acknowledges that most problems can be solved by parallel algorithms that obey a reducing procedure framework, which typically requires rescheduling processors. However, rescheduling can be an obstacle to logarithmic time algorithms that use an optimal number of processors. This book provides a novel approach to the rescheduling problem that allows for a logarithmic time connectivity algorithm that is optimal unless the graph is extremely sparse. The new algorithm also leads to efficient parallel algorithms for related problems like biconnected components, Euler tours, and st-numbering. The author explores duration-unknown task scheduling problems and provides a parallel union/find algorithm. This book provides significant contributions to the field of parallel computation and offers valuable insights for researchers and practitioners interested in optimal parallel algorithms for graph problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332101542_0
Gastos de envío:
GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Approximate Parallel Scheduling, Vol 2 Part II Applications to Optimal Parallel Graph Algorithms in Logarithmic Time Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332101542
Cantidad disponible: 15 disponibles
Imagen de archivo
Approximate Parallel Scheduling, Vol 2 Part II Applications to Optimal Parallel Graph Algorithms in Logarithmic Time Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332101542
Gastos de envío:
EUR 3,86
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 15 disponibles