1994•Concurrency Practice and ExperienceRequires access

Data management for a class of iterative computations on distributed‐memory MIMD systems

M. C. Cornea‐Hasegan, Dan Cristian Marinescu, Zhongyun Zhang

Open publisher page 7 citations

Abstract

Abstract The paper discusses data management techniques for mapping a large data space onto the memory hierarchy of a distributed memory MIMD system. Experimental results for structural biology computations using the Molecular Replacement Method are presented.

About this research paper

What this paper is about

Abstract The paper discusses data management techniques for mapping a large data space onto the memory hierarchy of a distributed memory MIMD system. Experimental results for structural biology computations using the Molecular Replacement Method are presented.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract The paper discusses data management techniques for mapping a large data space onto the memory hierarchy of a distributed memory MIMD system. Experimental results for structural biology computations using the Molecular Replacement Method are presented.

Key concepts: MIMD, Computer science, Distributed memory, Computation, Parallel computing, Class (philosophy), Hierarchy, Memory hierarchy

Related papers

Back to paper searchBrowse research topicsOriginal source
Data management for a class of iterative computations on distributed‐memory MIMD systems — Research Paper | ScholarLens