← Back to Patent Explorer
EP0205946A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Flexible data transmission for message based protocols

Assignee: International Business Machines Corp
•
Filing: 1986-05-23
•
Granted: —
•
Expires: 2006-05-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract 0 An interprocess data transfer facility provides transfer of data between two processes. Work requests are represented by notes that are placed on a queue of a server process for performing the work. The requestor process which created a.work request does not trans-fer the work request from storage it controls until requested by the server. The actual transfer of the work request occurs without interaction of the requestor. The use of notes which represent the work requests permits complex queue- ing of notes and hence handling of the requests in the order desired by the server.

Inventors

  • 👤 William Elder Hammer
  • 👤 Walter Henry Schwane
  • 👤 Frederick Joseph Ziecina

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-23 19:39
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/546; H; H04; H04L; H04L69/00

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 114 words
A method of communicating work requests between a requesting process and a server process, each of which has a queue, in a loosely coupled distributed process system, regardless of the location of the processes, characterized in that it the steps of: placing a note on the queue of the server process uniquely identifying and representative of a work request; accessing the work request and data associated with the work request as a function of the note and the work load of the server; and placing a note on the queue of the requesting process indicating that the work request is completed and data has been transferred to the memory specified by the requesting process.
Claim 2
Independent Claim 114 words
A method of communicating work requests between a requesting process and a server process, each of which has a queue, in a loosely coupled distributed process system, regardless of the location of the processes, characterized in that it the steps of: placing a note on the queue of the server process uniquely identifying and representative of a work request; accessing the work request and data associated with the work request as a function of the note and the work load of the server; and placing a note on the queue of the requesting process indicating that the work request is completed and data has been transferred to the memory specified by the requesting process.
Claim 3
Dependent Claim 16 words
The method of Claim 1 characterized in that the processes are coupled by a transport mechanism.
Claim 4
Dependent Claim 23 words
The method of Claim 1 or 2 characterized in that the processes are executing on different processors and do not share common storage.
Claim 5
Independent Claim 30 words
The method of any of Claims 1-3 characterized in that the processes interface with a communication facility via a common set of verbs, one of which represents a work request.
Claim 6
Independent Claim 16 words
The method of any of Claims 1-4 characterized in that the notes contain a priority indication.
Claim 7
Dependent Claim 26 words
The method of Claim 5 characterized in that the notes are ordered on the queue of the server process as a function of the priority indication.
Claim 8
Dependent Claim 55 words
The method of any of Claim 4-6 characterized in that more than one verb results in a note being placed on the queue of processes and wherein the notes are ordered on the queue of each process as a function of the type of verb which caused the note to be placed on the queue.
Claim 9
Dependent Claim 26 words
The method of Claim 7 characterized in that a receive queue verb is used by a process to receive notes on the queue of the process.
Claim 10
Dependent Claim 24 words
The method of Claim 8 characterized in that the receive queue verb specifies which notes to receive as a function of the request id.
Claim 11
Dependent Claim 35 words
The method of Claim 8 characterized in that the receive queue verb specifies which notes to receive as a function of the type of verb which caused the note to be placed on the queue.
Claim 12
Independent Claim 29 words
The method of any of Claims 2-10 characterized in that the processes reside on two different processors and wherein the transport mechanism comprises a physical connection between said processors.
Claim 13
Independent Claim 37 words
The method of any of Claims 2-11 characterized in that the notes identify the physical connection by use of a connection id and wherein notes are received from the queue as a function of the connection id.

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