Sinopsis
Excerpt from Fully Parallel Algorithm for Implementing Path Expressions
The paper is organized as follows: Sections two and three present an overview of path expression synchronization, followed by a discussion of the parallel machine model to be used in this paper. In section four, we present the basic algorithm, which is extended in the following section to provide bounded fairness. Section six discusses the portability of the algorithms presented to other shared memory MIMD machines. In the concluding section, we remark on the connection between this work and other related research efforts and discuss implications our results may have for other currently proposed parallel machines. Appendix A presents some simulation results of the size of independent sets created by the two constant time independent set algorithms and compares them to the sizes of maximal independent set and the bounds derived analytically.
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Excerpt from Fully Parallel Algorithm for Implementing Path Expressions
The paper is organized as follows: Sections two and three present an overview of path expression synchronization, followed by a discussion of the parallel machine model to be used in this paper. In section four, we present the basic algorithm, which is extended in the following section to provide bounded fairness. Section six discusses the portability of the algorithms presented to other shared memory MIMD machines. In the concluding section, we remark on the connection between this work and other related research efforts and discuss implications our results may have for other currently proposed parallel machines. Appendix A presents some simulation results of the size of independent sets created by the two constant time independent set algorithms and compares them to the sizes of maximal independent set and the bounds derived analytically.
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 Fully Parallel Algorithm for Implementing Path Expressions
In order to establish the correctness of a particular implementation, we need to consider the following two properties.
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.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Fully Parallel Algorithm for Implementing Path Expressions...
Imagen de archivo
Fully Parallel Algorithm for Implementing Path Expressions (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Print on Demand. This book studies how path expression language, a synchronization protocol used to communicate between multiple computer processes, can be effectively implemented on a shared memory architecture. Prior research on the subject focused on implementing path expression language on processors with rudimentary facilities, with the result that more intricate path expressions suffered from various deficiencies in efficiency and simplicity. This book instead takes a top-down approach, using a thorough analysis of high-level processes to select primitive operations necessary to effectively support the intended applications. The author also proposes support facilities that eliminate a synchronization bottleneck while allowing for straightforward implementation of efficient algorithms. This book is of historical interest as one of the first attempts to implement high-level synchronization protocols on parallel computers. It will be of interest to researchers and practitioners working in the field of parallel computing. 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: 9781333255367_0
Comprar nuevo
EUR 15,51
Gastos de envío gratis
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Fully Parallel Algorithm for Implementing Path Expressions 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-9781333255367
Comprar nuevo
EUR 22,08
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
Fully Parallel Algorithm for Implementing Path Expressions 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-9781333255367
Comprar nuevo
EUR 20,70
Envío por EUR 3,79
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 15 disponibles