MIMD

Known as: Multiple Instruction Multiple Data 
In computing, MIMD (multiple instruction, multiple data) is a technique employed to achieve parallelism. Machines using MIMD have a number of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2018
05010015019722018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1994
Highly Cited
1994
Many scientific applications that run on today's multiprocessors, such as weather forecasting and seismic analysis, are… (More)
  • figure 9
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper describes the design of the Fortran90D/HPF compiler, a source-to-source parallel compiler for distributed memory… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
90D\HPF is a data parallel lanquage w~ih speczal directives to enable users to spectfy data a[ign ment and distributions. This… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Fortran D, a version of Fortran extended with data decomposition speciications, is designed to provide a machine-independent data… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Volume rendering is a useful visualization technique for understanding the large amounts of data generated in a variety of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 6
  • table 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The Fortran D compiler uses data decomposition specifications to automatically translate Fortran programs for execution on MIMD… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
No abstract available 
  • figure 1
  • figure 8
  • figure 9
  • figure 11
Is this relevant?
Highly Cited
1984
Highly Cited
1984
This paper presents two cache schemes for a shared-memory shared bus multiprocessor. Both schemes feature decentralized… (More)
  • table 1
  • figure 3-1
  • figure 6-1
  • figure 6-2
  • figure 7-1
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?