Publisher's Synopsis
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.
