MIMD

[¦em¦ī¦em¦dē]

(computer science)

A type of multiprocessor architecture in which several instruction cycles may be active at any given time, each independently fetching instructions and operands into multiple processing units and operating on them in a concurrent fashion. Acronym for multiple-instruction-stream, multiple-data-stream.

MIMD

Multiple Instruction/Multiple Data

MIMD

(Multiple Instruction stream Multiple Data stream) The instruction execution architecture of a CPU that can process two or more independent sets of instructions simultaneously on two or more sets of data. CPUs with multiple cores are examples of MIMD architecture, each core performing SIMD processing. Hyperthreading also results in a certain degree of MIMD performance. See SIMD and hyperthreading.

Mentioned in ?

References in periodicals archive ?

As NPACI's leading-edge site, SDSC now has a 272-processor Cray T3E system (MIMD, distributed memory) [9], a 128-processor IBM SP (MIMD, distributed memory) [11], and a 14-processor Cray T90 (vector MIMD, shared memory).

Architecture

MIMD computers employ a multitude of relatively high powered processors that can execute independent instruction streams on local data.

The terabytes are coming ... storing and processing the data deluge

1996] is a MIMD parallel computer with a 3D torus interconnect network.

A Quantitative Comparison of Parallel Computation Models

The RISC BLAS differs from the blocked version of the Level 3 BLAS for MIMD vector multiprocessors in the following ways:

The RISC BLAS: A Blocked Implementation of Level 3 BLAS for RISC Processors

Distributed-memory MIMD architectures can be further differentiated by the total capacity of their interconnection networks, that is, the total volume of data that can be in transit in the network at any one time.

Models and Languages for Parallel Computation

The target machine is assumed to be a MIMD architecture.

Automatic Data Layout for Distributed-Memory Machines

Categories and Subject Descriptors: B.3.2 [Memory Structures]: Design Styles-shared memory; B.4.3 [Input/Output and Data Communications]: Interconnections (subsystems)-asynchronous/synchronous operation; C.1.2 [Processor Architectures]: Multiple Data Stream Architectures (Multiprocessors)-multiple-instruction-stream, multiple-data-stream processors (MIMD); D.1.3 [Programming Techniques]: Concurrent Programming-distributed programming; D.4.1 [Operating Systems]: Process Management-concurrency, synchronization; D.4.7 [Operating Systems]: Organization and Design-distributed systems; F.2.m [Analysis of Algorithms and Problem Complexity]: miscellaneous

Lower Bounds for Distributed Coin-Flipping and Randomized Consensus

Techniques for extracting instruction level parallelism on MIMD architectures.

Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading

Dynamic decentralized cache schemes for MIMD parallel processors.

Verification techniques for cache coherence protocols

--Portability: It must be possible to implement Jade on virtually any MIMD computing environment.

The design, implementation, and evaluation of Jade

[Input/Output and Data Communications]: Interconnections (Subsystems)--asynchronous/synchronous operations; C.1.2 [Processor Architectures]: Multiple Data Stream Architectures (Multiprocessors)--multiple-instruction-stream, multiple-data-stream processors (MIMD); D.1.3 [Programming Techniques]: Concurrent Programming; D.3.3 [Programming Languages]: Language Constructs and Features--abstract data types; D.4.1 [Operating Systems]: Process Management--concurrency, multiprocessing/multiprograraming/multitasking, synchronization; D.4.7 [Operating Systems]: Organization and Design--distributed systems

Fault-Tolerant Wait-Free Shared Objects

Ellpack: A numerical simulation programming environment for parallel MIMD machines.

PELLPACK: a problem-solving environment for PDE-based applications on multicomputer platforms

CITE

Site: Follow: Share:

Open / Close