๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the bit complexity of parallel computations

โœ Scribed by Selim G. Akl; Henk Meijer

Book ID
107920156
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
531 KB
Volume
6
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Scalability of Asynchronous Paral
On the Scalability of Asynchronous Parallel Computations
โœ D.C. Marinescu; J.R. Rice ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 753 KB

This paper investigates the time lost in a parallel computation due to sequential and duplicated work, communication, and blocking, and proposes characterizations of parallel algorithms based upon the communication complexity and the blocking model. It discusses the impact of the processor's archite

On the complexity of online computations
On the complexity of online computations of real functions
โœ Klaus Weihrauch ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences