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

Computer trees: a concept for parallel processing

โœ Scribed by B. Buchberger; J. Fegerl; F. Lichtenberger

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
442 KB
Volume
3
Category
Article
ISSN
0141-9331

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel Algorithm for Computing Minim
A Parallel Algorithm for Computing Minimum Spanning Trees
โœ D.B. Johnson; P. Metaxas ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

The GIOTTO System: a Parallel Computer f
The GIOTTO System: a Parallel Computer for Image Processing
โœ Rita Cucchiara; Luigi Di Stefano; Massimo Piccardi; Tullio Salmon Cinotti ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

his paper presents the GIOTTO system, a parallel computer based on a scalable single instruction, multiple data (SIMD) array of processors specially conceived for image Tpr ocessing. The system is characterized by a reduced-size array and a novel organization of the memory subsystem, designed to sup