§
Luxuse
Patent Intelligence
Sign In
← Back to Patent Explorer
EP0639016A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Multi-nodal data processing system

Assignee: Fujitsu Services Ltd
•
Filing: 1994-07-27
•
Granted: —
•
Expires: 2014-07-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A multi-nodal data processing system in which each node has a local memory for storing message send vectors, one for each other node in the system. When a node has a message to send, it places the message in the message send vector corresponding to the destination node of that message. When a node is ready to receive messages, it reads messages from the message send vectors corresponding to this node in the other nodes. Each message send vector has a head pointer and a tail pointer for defining the head and tail of a queue of messages. Each tail pointer is held locally, in the same node as the message send vector to which it relates, while the head pointer is held in the destination node of that message send vector.

Inventors

  • 👤 Jack Benkual
  • 👤 Allen Harold Brumm
  • 👤 Ian Gregory Colloff

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-27 21:16
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/40

Claims Analysis

Total Claims: 4
Claim 1
Independent Claim 85 words
A data processing system comprising a plurality of data processing nodes, wherein each node comprises: (a) local memory means for storing a plurality of message send vectors, one for each other node in the system, (b) message send means for placing messages in said message send vectors, each message being placed in the message send vector corresponding to the destination node of that message, and (c) message receive means for reading messages from the message send vectors corresponding to this node in the other nodes.
Claim 2
Dependent Claim 69 words
A system according to claim 1 wherein each of said message send vectors has a head pointer and a tail pointer for defining the head and tail of a queue of messages, and wherein each said tail pointer is held locally, in the same node as the message send vector to which it relates, and the head pointer is held in the destination node of that message send vector.
Claim 3
Dependent Claim 54 words
A system according to claim 2 wherein said message receive means in each node comprises means for comparing the head and tail pointers of a message send vector and for reading a message from the location of that vector pointed to by the head pointer only if the head and tail pointers are unequal.
Claim 4
Independent Claim 95 words
A method of operating a data processing system comprising a plurality of data processing nodes, the method comprising the steps: (a) in a local memory in each node, storing a plurality of message send vectors, one for each other node in the system, (b) when a node has a message to send, placing said message in said corresponding to the destination node of that message, and (c) when a node is ready to receive a message, causing the node to read messages from the message send vectors corresponding to this node in the other nodes.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag