𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations

✍ Scribed by Baer, J.-L.E.; Estrin, G.

Book ID
114587481
Publisher
IEEE
Year
1969
Tongue
English
Weight
684 KB
Volume
C-18
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A graph-theoretic result for a model of
A graph-theoretic result for a model of neural computation
✍ Alexandros V. Gerbessiotis πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 462 KB

We deal in this work with the following graph construction problem that arises in a model of neural computation introduced by L.G. Valiant. For an undirected graph G = (I'. E). let set N\*(X, Y ), where X, Y 2 V, denote the set of vertices other than those of X. Y which are adjacent to at least one

A Comparison of Parallel Programming Mod
A Comparison of Parallel Programming Models for Multiblock Flow Computations
✍ M.L. Sawley; J.K. TegnΓ©r πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 825 KB

A study is presented of the implementation of four different parallel programming models in a code that solves the fluid flow equations on block structured meshes. Performance results obtained on a number of distributed-memory parallel computer systems are given, in particular, for a 1024 processor