← Back to Patent Explorer
US6094715A Expired / Lapsed US ⏱️ 0.0 years remaining

SIMD/MIMD processing synchronization

Assignee: International Business Machines Corp
•
Filing: 1995-06-07
•
Granted: 2000-07-25
•
Expires: 2015-06-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A parallel array processor for massively parallel applications is formed with low power CMOS with DRAM processing while incorporating processing elements on a single chip. Eight processors on a single chip have their own associated processing element, significant memory, and I/O and are interconnected with a hypercube based, but modified, topology. These nodes are then interconnected, either by a hypercube, modified hypercube, or ring, or ring within ring network topology. Conventional microprocessor MMPs consume pins and time going to memory. The new architecture merges processor and memory with multiple PMEs (eight 16 bit processors with 32K and I/O) in DRAM and has no memory access delays and uses all the pins for networking. The chip can be a single node of a fine-grained parallel processor. Each chip will have eight 16 bit processors, each processor providing 5 MIPs performance. I/O has three internal ports and one external port shared by the plural processors on the chip. The scalable chip PME has internal and external connections for broadcast and asynchronous SIMD, MIMD, and SIMIMD (SIMD/MIMD) with dynamic switching of modes. The chip can be used in systems which employ 32, 64, or 128,000 processors. Local and global memory functions can all be provided by the chips themselves, and the system can connect to and support other global memories and DASD. The chip can be used as a microprocessor accelerator, in personal computer applications, as a vision or avionics computer system, or as work-station or supercomputer.

Inventors

  • 👤 Paul Amba Wilkinson
  • 👤 James Warren Dieffenderfer
  • 👤 Peter Michael Kogge
  • 👤 Nicholas Jerome Schoonover

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 12:13
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3885; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; G06F15/17343; G06F15/17356; G06F15/17368; G06F15/17381; G06F15/76; G06F15/80; G06F15/8007; G06F15/8015; G06F15/803; G06F7/00; G06F7/38; G06F7/48; G06F7/483; G06F9/30003; G06F9/30007; G06F9/30036; G06F9/30038; G06F9/30145; G06F9/3016; G06F9/30167; G06F9/3017; G06F9/30181; G06F9/30189; G06F9/3802; G06F9/3824; G06F9/3834; G06F9/3836; G06F9/3838; G06F9/3851; G06F9/3887; G06F9/3888; G06F9/3889; G06F9/3891

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 107 words
An array processing system, comprising: a plurality of processing elements interconnected as an array processor, each having a processor and a memory coupled to said processor, and wherein each of the processing elements selectively and autonomously executes an independent instruction stream on an independent multiple data stream, thereby providing for a MIMD mode; and a control processor that dispatches a single instruction stream to the plurality of processing elements to command the processing elements to execute on multiple independent data streams located one per processing element, wherein the processing elements execute the single instruction stream independently of a fixed time relationship between or among the processing elements.
Claim 2
Dependent Claim 107 words
An array processing system, comprising: a plurality of processing elements interconnected as an array processor, each having a processor and a memory coupled to said processor, and wherein each of the processing elements selectively and autonomously executes an independent instruction stream on an independent multiple data stream, thereby providing for a MIMD mode; and a control processor that dispatches a single instruction stream to the plurality of processing elements to command the processing elements to execute on multiple independent data streams located one per processing element, wherein the processing elements execute the single instruction stream independently of a fixed time relationship between or among the processing elements.
Claim 3
Dependent Claim 39 words
A computer system according to claim 1 wherein a stat funnel is used by the control processor, the stat funnel used to collect status information from active processing elements and route a cumulative status result to the array controller.
Claim 4
Dependent Claim 46 words
A computer system according to claim 1 wherein a status funnel is used to indicate to the control processor that all of said processors have completed their respective processing steps, and that a next operation can proceed in accordance with a command from the control processor.
Claim 5
Dependent Claim 21 words
A computer system according to claim 1 wherein a status funnel is used to indicate the end of an array process.
Claim 6
Dependent Claim 41 words
A computer system according to claim 1 wherein global bit operations produce a logical OR of status for every one of said processing elements participating in a process, and wherein said logical OR of status is provided to said control processor.
Claim 7
Dependent Claim 47 words
A computer system according to claim 1 wherein said means for indicating includes global bit operations which produce a logical OR of status for every one of said processing elements participating in a process, and wherein said logical OR of status is provided to said array controller.

References Cited (Backward Citations)

US3537074A Cited
US3544973A Cited
US4942516A Cited
US3970993A Cited
US4107773A Cited
US4101960A Cited
US4270170A Cited
US4380046A Cited
US4412303A Cited
US4314349A Cited
US4338675A Cited
US4435758A Cited
US4467422A Cited
US4956772A Cited
US5006978A Cited
US4394726A Cited
US4468727A Cited
US4622650A Cited
US4498133A Cited
US4523273A Cited
US4825359A Cited
US4809159A Cited
US4739474A Cited
EP0132926B1 Cited
US5008815A Cited
US5212773A Cited
US4598400A Cited
US5146608A Cited
US4621339A Cited
US4604695A Cited
US4905143A Cited
US4855903A Cited
US4901224A Cited
US5113523A Cited
US4805091A Cited
US4967340A Cited
US5045995A Cited
EP0208497B1 Cited
US5047917A Cited
US4706191A Cited
US4739476A Cited
US4763321A Cited
US5016163A Cited
US4720780A Cited
US4922408A Cited
US5021945A Cited
US4847755A Cited
US4907148A Cited
US4736291A Cited
US4783782A Cited
US4835729A Cited
US4916657A Cited
US4831519A Cited
US4852048A Cited
US4748585A Cited
US4925311A Cited
US5297260A Cited
US4783738A Cited
US4814980A Cited
US4809169A Cited
US4780873A Cited
US4809347A Cited
US4849882A Cited
US5038386A Cited
US4910665A Cited
US4860201A Cited
US5230079A Cited
US4985832A Cited
US5170484A Cited
US4975834A Cited
US4841476A Cited
US5010477A Cited
US4992933A Cited
US5175865A Cited
US5165023A Cited
US4891787A Cited
US4873626A Cited
US4903260A Cited
US4858110A Cited
US4964032A Cited
US4933846A Cited
US4933895A Cited
US5170482A Cited
US5008882A Cited
US4958273A Cited
US4916652A Cited
US4942517A Cited
US4943912A Cited
US4872133A Cited
US4896265A Cited
US4992926A Cited
US5038282A Cited
US5121498A Cited
US5056000A Cited
US5005120A Cited
US4920484A Cited
US5041971A Cited
US5189665A Cited
US5020059A Cited
US5181017A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-07-25 2004-01-24 2004-07-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-07-25 2008-01-24 2008-07-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-07-25 2012-01-24 2012-07-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag