Patent US5003469A successfully refreshed from Google Patents.
US5003469A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for processing data in a decentralized processing system
Assignee: Hitachi Ltd
•
Filing: 1988-02-08
•
Granted: 1991-03-26
•
Expires: 2008-02-08
Abstract
Abstract In a decentralized processing system comprising a multiplicity of processors linked together through a transmission medium, a method of processing data of variable length that can be relocated in the transmission medium wherein each processor stores in a blank area of its own memory the data received from the transmission medium using information that indicates the size of the data and location of the data stored in the processor.
Inventors
- 👤 Akihiko Kamiyama
- 👤 Katsumi Kawano
- 👤 Kinji Mori
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 14:14
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/161
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
153 words
A method of operating a decentralized processing system including a plurality of processors that are linked together through a data line that carries information blocks of varying length, with each information block including a data body and a size code indicating the size of the data body, and with each processor having a memory, said method comprising within each processor the steps of: (a) receiving information blocks carried on the data line; (b) detecting the size code of a received information block to determine the size of the data body of the received information block; (c) locating within the associated memory a blank area of a size sufficient for storing the data body of the received information block based upon the determined size of said data body and the location of data bodies already stored in said emory; and (d) storing the received data body in the located blank area of said memory.
Claim 2
Independent Claim
153 words
A method of operating a decentralized processing system including a plurality of processors that are linked together through a data line that carries information blocks of varying length, with each information block including a data body and a size code indicating the size of the data body, and with each processor having a memory, said method comprising within each processor the steps of: (a) receiving information blocks carried on the data line; (b) detecting the size code of a received information block to determine the size of the data body of the received information block; (c) locating within the associated memory a blank area of a size sufficient for storing the data body of the received information block based upon the determined size of said data body and the location of data bodies already stored in said emory; and (d) storing the received data body in the located blank area of said memory.
Claim 3
Dependent Claim
29 words
A method of operating according to claim 1, further comprising relocating data bodies already stored in said memory to other areas within said memory to provide the blank area.
Claim 4
Dependent Claim
34 words
A method of operating according to claim 1 or 6, wherein the locating of the blank area comprises determining a tail address and a head address for data bodies already stored in said memory.
Claim 5
Dependent Claim
37 words
A method of operating according to claim 1 or 6 wherein said memory includes a memory map with identifying codes indicative of the identities of the already stored data bodies and the size of any blank area.
Claim 6
Dependent Claim
26 words
A method of operating according to claim 4, wherein said identifying code includes a content code indicative of the contents of the already stored data bodies.
Claim 7
Dependent Claim
27 words
A method of operating according to claim 1, wherein the data body of the received information block includes a program to be executed in the associated processor.
Claim 8
Dependent Claim
61 words
A method of operating according to claim 1, wherein: each information block further includes a content code indicating the contents of the data body; said method further comprises at each processor detecting the content codes of information blocks carried on the data line; and step (a) comprises receiving information blocks having content codes indicative of information blocks intended for the processor.
Claim 9
Independent Claim
121 words
A method of loading a program of variable length in a decentralized processing system having a plurality of processors each of which has a memory and a transmission medium connecting said processors for transmitting information including said program and a size code indicating the length of the program, said method comprising at each processor the steps of: (a) receiving information from said transmission medium; (b) detecting the size code in the received information to determine the length of the program; (c) locating in the associated memory a blank area of a size sufficient for storing the program based on memory information about said associated memory and the length of said program; and (d) storing said program in the located blank area.
Claim 10
Independent Claim
121 words
A method of loading a program of variable length in a decentralized processing system having a plurality of processors each of which has a memory and a transmission medium connecting said processors for transmitting information including said program and a size code indicating the length of the program, said method comprising at each processor the steps of: (a) receiving information from said transmission medium; (b) detecting the size code in the received information to determine the length of the program; (c) locating in the associated memory a blank area of a size sufficient for storing the program based on memory information about said associated memory and the length of said program; and (d) storing said program in the located blank area.
Claim 11
Dependent Claim
32 words
A method of loading a program according to claim 8, further including relocating programs already stored in aid associated memory to other areas in said associated memory to provide the blank area.
Claim 12
Dependent Claim
31 words
A method of loading a program according to claim 8 or 9, wherein said received information includes an identifying code identifying at least one program already stored in said associated memory.
Claim 13
Dependent Claim
59 words
A method of loading a program according to claim 8, wherein: said received information includes a content code indicating the content of the program; said method further comprises at each processor detecting the content code of information transmitted on said transmission medium; and step (a) comprises receiving information having a content code indicative of a program for that processor.
Claim 14
Independent Claim
185 words
A method of operating a decentralized processing system including a plurality of processors that are linked together through a data line, with each processor having a memory, said method comprising steps of: transmitting information, including at least one information block having a variable length and having a size code indicating the length of said information block and a content code indicating the contents of the information block, from a processor to said data line; at each processor detecting the content code of each information block on said data line; receiving at each processor transmitted information having a content code indicative of an information block for that processor; detecting the size code of a received information block to determine the length of the received information block; locating within the memory of each processor a blank area of a size sufficient for storing an information block received by that processor, based upon the size of the received information block and a memory map representing the location of information already stored in said memory; and storing the received information block in the located blank area of said memory.
Claim 15
Independent Claim
185 words
A method of operating a decentralized processing system including a plurality of processors that are linked together through a data line, with each processor having a memory, said method comprising steps of: transmitting information, including at least one information block having a variable length and having a size code indicating the length of said information block and a content code indicating the contents of the information block, from a processor to said data line; at each processor detecting the content code of each information block on said data line; receiving at each processor transmitted information having a content code indicative of an information block for that processor; detecting the size code of a received information block to determine the length of the received information block; locating within the memory of each processor a blank area of a size sufficient for storing an information block received by that processor, based upon the size of the received information block and a memory map representing the location of information already stored in said memory; and storing the received information block in the located blank area of said memory.
References Cited (Backward Citations)
US3754218A
Cited
US3678462A
Cited
US3824561A
Cited
US3810109A
Cited
US4075694A
Cited
US4280176A
Cited
US4523276A
Cited
US4499539A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-03-25 | 1994-09-24 | 1995-03-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-03-25 | 1998-09-24 | 1999-03-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-03-25 | 2002-09-24 | 2003-03-26 | $7700.00 | Window Closed / Lapsed |