Overview

Excerpt from On Choice of a Model of Parallel Computation The present paper falls mainly within the following abstract scheme. Suppose that a model M of synchronous 97parallel computation that allows some operations in any cycle, but forbids others, is given. Assune, that it is possible to simulate every cycle of any algorithm in M, within certain resource requirements, into'some weaker model of computation D, that represents a technologically available machine. We are interested in the question: Is it possible to allow in cycles of M some of the forbidden operations and still get a simulation of each cycle into D, vithin about the same resource requirements? The advantages of succeeding to give an affirmative answer to the above question are the following. Imagine that a programmer wrote programs for model M to be later translated by the (aforementioned) simlation into D. Now, the person has more powerful primitives in his programming language (the language describing model M). Therefore, we enable simpler and more efficient (in terms of composition of primitives) algorithms to be designed and programs to be written. 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.

Full Product Details

9781334016783

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available