𝔖 Bobbio Scriptorium
✦   LIBER   ✦

C3: A Parallel Model for Coarse-Grained Machines

✍ Scribed by Susanne E. Hambrusch; Ashfaq A. Khokhar

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
608 KB
Volume
32
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we propose a model for parallel computation, the C 3 -model. The C 3 -model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication, and the potential congestion arising during communication. A metric for estimating the effect of link and processor congestion on the performance of a communication operation is developed. This metric allows the evaluation of arbitrary communication operations without the user having to specify fine scheduling details. We describe how the C 3 -model can serve as a platform for the development of coarse-grained algorithms sensitive to the parameters of a parallel machine. The initial validation of the C 3 -model is discussed for the Intel Touchstone Delta. We compare predicted and actual performance of different solutions for communication operations and of various divide-and-conquer approaches for contour ranking on images.

πŸ“œ SIMILAR VOLUMES

Random Data Accesses on a Coarse-Grained
Random Data Accesses on a Coarse-Grained Parallel Machine I. One-to-One Mappings
✍ Ravi V. Shankar; Sanjay Ranka πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 271 KB

This paper describes deterministic communication-efficient algorithms for performing dynamic permutations on a coarsegrained parallel machine. Our analysis shows that the general permutation operation can be completed in CΒ΅n/p (+ lower order terms) time and is optimal and scalable provided n >> p 3

Coarse-grained model of nucleic acid bas
Coarse-grained model of nucleic acid bases
✍ Maciej Maciejczyk; Aleksandar Spasic; Adam Liwo; Harold A. Scheraga πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 642 KB

## Abstract Atomistic simulations of nucleic acids are prohibitively expensive and, consequently, reduced models of these compounds are of great interest in the field. In this work, we propose a physics‐based coarse‐grained model of nucleic‐acid bases in which each base is represented by several (3

Contour ranking on coarse grained machin
Contour ranking on coarse grained machines: a case study for low-level vision computations
✍ Hameed, F.; Hambrusch, S. E.; Khokhar, A. A.; Patel, J. N. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 289 KB

In the paper we present parallel solutions for performing image contour ranking on coarsegrained machines. In contour ranking, a linear representation of the edge contours is generated from the edge contours of a raw image. We describe solutions that employ different divide-andconquer approaches and

A Predictive Coarse-Grained Model for Se
A Predictive Coarse-Grained Model for Semiflexible Polymers in Specific Solvents
✍ Sheng C. Shie; Cheng K. Lee; Chi C. Hua; Show A. Chen πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 651 KB

## Abstract A predictive CG model based on a conventional freely rotating chain was developed to describe semiflexible polymers on a relatively large length/time scale. Parameterization of the model requires only two material properties such as, the Kuhn length and coil density. The diameter of sph