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

Method of parallel processing for avoiding competition control problems and data up dating problems common in shared memory systems

Assignee: Hitachi Ltd
•
Filing: 1989-08-17
•
Granted: 1991-08-27
•
Expires: 2009-08-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A plurality of elemental processors each include a local memory for storing data and task programs and an execution section for executing the task programs. A communications section transfers data among the processors. In a method of parallel processing with these elemental processors, a task program is executed in one of the processors. A detection operation is conducted to determine whether the data from the task program is to be copied to the local memories of other processors. The detection is based on predetermined information which is stored in the local memory of the processor which performs the task program and indicates which of the other processors will need the data. The detection also determines which of the other processors that will require access to the data are ready to receive the data. Concurrently and in parallel with the execution of the task program, the data is transmitted to each of the elemental processors that are awaiting the data with only a write instruction and without any communications instruction.

Inventors

  • 👤 Akira Muramatsu
  • 👤 Kousuke Sakoda
  • 👤 Ikuo Yoshihara
  • 👤 Kazuo Nakao
  • 👤 Makoto Nohmi
  • 👤 Naoki Hamanaka
  • 👤 Shigeo Nagashima
  • 👤 Teruo Tanaka

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 00:11
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/50; G06F9/5005; G06F9/5011; G06F9/5016; G06F8/00; G06F8/40; G06F8/41; G06F8/45; G06F8/451; G06F2209/00; G06F2209/48; G06F2209/484

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 248 words
A method of parallel processing in a computer having a plurality of communicatively associated and structurally similar elemental processors; each elemental processor having a local memory means for storing data and task programs, an execution means for executing the task programs; and a communication means for communicating data among the elemental processors, the method comprising the steps of: executing one of said task programs in a first one of the elemental processors including accessing a first memory location of a first local memory means to write first data therein; in accordance with information resident in the first local memory means and developed prior to the execution of the one task program indicating which of the processors will need the first data, detecting whether a copy area of the first data is present in local memory means of at least one indicated other elemental processor; concurrently and in parallel with the executing of the one to write the first data into the first memory location, initiating a copy operation in which the first data is transmitted to the at least one indicated other elemental processor without any communication instructions; and, copying the first data into the copy area of the indicated other elemental processor local memory means such that the first data is copied before each indicated other elemental processor will use the first data to avoid access competition control problems and data updating problems that would occur with a shared processor memory, whereby improved processing speed is achieved.
Claim 2
Independent Claim 248 words
A method of parallel processing in a computer having a plurality of communicatively associated and structurally similar elemental processors; each elemental processor having a local memory means for storing data and task programs, an execution means for executing the task programs; and a communication means for communicating data among the elemental processors, the method comprising the steps of: executing one of said task programs in a first one of the elemental processors including accessing a first memory location of a first local memory means to write first data therein; in accordance with information resident in the first local memory means and developed prior to the execution of the one task program indicating which of the processors will need the first data, detecting whether a copy area of the first data is present in local memory means of at least one indicated other elemental processor; concurrently and in parallel with the executing of the one to write the first data into the first memory location, initiating a copy operation in which the first data is transmitted to the at least one indicated other elemental processor without any communication instructions; and, copying the first data into the copy area of the indicated other elemental processor local memory means such that the first data is copied before each indicated other elemental processor will use the first data to avoid access competition control problems and data updating problems that would occur with a shared processor memory, whereby improved processing speed is achieved.
Claim 3
Independent Claim 186 words
A method of parallel processing in a computer having a plurality of communicatively associated and structurally similar elemental processors; each elemental processor having a local memory means for storing data and task programs, an execution means for executing the task programs and means operable in parallel with the execution means for communicating data among the processors, the method comprising the steps of: executing a one of said task programs in a one of the elemental processors; in accordance with information resident in the first local memory means and developed prior to the executing of the one task program indicating which of the processors will need a first data, detecting whether a copy area of the first data is present in a local memory means of the indicated other elemental processors; in response to determining that the first data is not present in each indicated other elemental processor local memory means, transmitting the first data from the one elemental processor to the indicated other elemental processors with only a write instruction without any communication instructions; and, writing data into each indicated other elemental processor local memory means.
Claim 4
Independent Claim 186 words
A method of parallel processing in a computer having a plurality of communicatively associated and structurally similar elemental processors; each elemental processor having a local memory means for storing data and task programs, an execution means for executing the task programs and means operable in parallel with the execution means for communicating data among the processors, the method comprising the steps of: executing a one of said task programs in a one of the elemental processors; in accordance with information resident in the first local memory means and developed prior to the executing of the one task program indicating which of the processors will need a first data, detecting whether a copy area of the first data is present in a local memory means of the indicated other elemental processors; in response to determining that the first data is not present in each indicated other elemental processor local memory means, transmitting the first data from the one elemental processor to the indicated other elemental processors with only a write instruction without any communication instructions; and, writing data into each indicated other elemental processor local memory means.

References Cited (Backward Citations)

US3662401A Cited
US4228496A Cited
US4672535A Cited
US4412303A Cited
EP0127772A2 Cited
JPS603751A Cited
FR2561009A1 Cited
EP0258736A2 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-08-26 1995-02-25 1995-08-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-08-26 1999-02-25 1999-08-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-08-26 2003-02-25 2003-08-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag