The Effect of Restrictions on Relative Processor Speeds to Differences in

Paul G. Spirakis

ISBN 10: 1333751060 / ISBN 13: 9781333751067

Verlag: Forgotten Books, 2017

Beschreibung

Print on Demand. This book analyzes the tradeoff between efficiency and complexity in synchronous versus asynchronous systems. Asynchronous systems, where processes operate at different speeds, have long been thought to be less efficient than synchronous systems. However, the author shows that in fact, the efficiency gap between these two approaches is largely dependent on restrictions placed on processor speeds. The author's research demonstrates that by introducing restrictions on relative processor speeds, the time required to solve a given problem in an asynchronous system can be significantly reduced. This finding has implications for the design of distributed systems, as it suggests that asynchronous systems may be more suitable for certain applications than previously thought. The book's insights contribute significantly to our understanding of the relationship between efficiency and complexity in distributed systems. By quantifying the impact of processor speed restrictions, the author provides a valuable framework for evaluating the performance of different system designs. 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.

Bestandsnummer des Verkäufers 9781333751067_0

Bibliografische Details

• Titel: The Effect of Restrictions on Relative Processor Speeds to Differences in
• Verlag: Forgotten Books
• Erscheinungsjahr: 2017
• Sprache: Englisch
• ISBN-10: 1333751060
• ISBN-13: 9781333751067
• Einband: Paperback
• Zustand: New
• Buchtyp: print-on-demand item
• Verkäuferkataloge:
  • Calculus

Über diesen Titel

Inhaltsangabe

Excerpt from The Effect of Restrictions on Relative Processor Speeds to Differences in Efficiency Between Synchronous and Asynchronous Systems

An infinite computation is admissible if every process appears infinitely often in the sequence. A round is any sequence of steps such that every process appears at least once in the sequence.

A minimal round is a round such that no proper prefix is a round (or, in other words, it is any sequence of steps such that every process appears at least once and at least one process appears just once). The run time for a finite sequence of steps is defined to be the number of segments in the partition into minimal rounds (the last segment may be just a part of a round).

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.