Patent US4905232A successfully refreshed from Google Patents.
US4905232A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Peripheral repeater box
Assignee: Hewlett Packard Development Co LP
•
Filing: 1987-08-13
•
Granted: 1990-02-27
•
Expires: 2007-08-13
Abstract
Abstract In a system which includes a data transmitting device, a repeater, and a data receiving device, the repeater accumulating input data in packets from the transmitting device and retransmitting it to the receiving device, a memory structure for the data which includes a data buffer a receive queue having a plurality entries, each entry capable of storing the starting address of a packet in the data buffer in order of receipt, and a transmit queue for storing the starting addresses of packets for transmitting to said receiving device is provided in the repeater. In operation, only addresses are transferred from receive queue to transmit queue with the data remaining in the buffer. Preferably the buffer and queues are circular.
Inventors
- 👤 Bruce E. Newman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 18:14
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/06; G06F5/065
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
119 words
In a system which includes a data transmitting device; a repeater; and a data receiving device, the repeater accumulating input data in packets from said transmitting device and retransmitting said packets to said receiving device, a memory structure for storing said data in said repeater comprising: (a) a data buffer; (b) a receive queue having a plurality entries, each entry capable of storing a starting address for the packets in said data buffer received from said transmitting device; (c) a transmit queue for storing the starting addresses of packets for transmitting to said receiving device; and (d) means to transfer said addresses from said receive queue to said transmit queue, each of said buffer and said queues being circular.
Claim 2
Dependent Claim
119 words
In a system which includes a data transmitting device; a repeater; and a data receiving device, the repeater accumulating input data in packets from said transmitting device and retransmitting said packets to said receiving device, a memory structure for storing said data in said repeater comprising: (a) a data buffer; (b) a receive queue having a plurality entries, each entry capable of storing a starting address for the packets in said data buffer received from said transmitting device; (c) a transmit queue for storing the starting addresses of packets for transmitting to said receiving device; and (d) means to transfer said addresses from said receive queue to said transmit queue, each of said buffer and said queues being circular.
Claim 3
Dependent Claim
135 words
A system according to claim 1 wherein each queue entry has an address with an upper queue part and a lower queue part and the number of entries in said queue parts change from a maximum value to zero when an increment is added to the last of said plurality of entries of said queue to generate a carry and wherein said system includes pointers for pointing to addresses in said queues and further including means for generating said pointers comprising a first register for storing an upper address and a second register for storing a lower address, the carry from said second register is not coupled to said first register whereby when said maximum value is exceeded in the second register the address will go back to its beginning value in a circular manner.
Claim 4
Dependent Claim
94 words
A system according to claim 2 comprising a plurality of transmitting devices, a buffer and a receive queue associated with each of said transmitting devices, said means to transfer transferring addresses from each of said receive queues associated with each of said transmitting devices to said transmit queue when data is received and further comprising means for establishing a base receive queue address and means for adding to said base receive queue address a number associated with each transmitting device to define he upper address of the receive queue for the associated transmitting device.
Claim 5
Dependent Claim
40 words
A system according to claim 3 and further including means for sensing receipt of data from any of said transmitting devices, said means including a register for storing the number of the transmitting device from which said data is coming.
Claim 6
Dependent Claim
53 words
A system according to claim 4 wherein said data receiving device includes means to transmit data to said transmitting devices through said repeater and said transmitting devices include means for receiving data and further including a receive queue associated with receiving device and a transmit queue associated with each of said transmitting devices.
Claim 7
Dependent Claim
25 words
A system according to claim 5 wherein said receiving device comprises a host and said transmitting devices comprise peripherals providing data input to said host.
Claim 8
Dependent Claim
19 words
A system according to claim 6 wherein said repeater includes receiver/transmitters for each of said peripherals and said host.
Claim 9
Dependent Claim
26 words
A system according to claim 7 wherein said repeater includes a processor and said means for sensing include means to generate an interrupt to said processor.
Claim 10
Dependent Claim
63 words
A system according to claim 6 wherein said queue addresses include a front pointer address indicating the first entry and a rear pointer indicating the next free space for an entry, and means for incrementing said rear pointer each time a new entry is made and for incrementing said front pointer each time a buffer address is transferred from one queue to another.
Claim 11
Dependent Claim
69 words
A system according to claim 9 and further including a table having a receive entry for each of said buffers and a transmit entry for each of said buffers, the receive entry storing the address of the next free location in said buffer into which received data can be stored and the transmit entry storing the address of the next byte of data from said buffer to be transmitted.
Claim 12
Dependent Claim
114 words
In a system which includes a data transmitting device; a repeater; and a data receiving device, a method of communication between the data transmitting device and the data receiving device comprising: (a) accumulating input data from said transmitting device at said repeater in a data buffer; (b) entering into a receive queue having a plurality entries, a starting address for the packets in said data buffer received from said transmitting device; (c) transferring said addresses from said receive queue to a transmit queue for storing the starting addresses of packets for transmitting to said receiving device; each of said buffer and said queues being circular and (d) retransmitting said packets to said receiving device.
Claim 13
Dependent Claim
114 words
In a system which includes a data transmitting device; a repeater; and a data receiving device, a method of communication between the data transmitting device and the data receiving device comprising: (a) accumulating input data from said transmitting device at said repeater in a data buffer; (b) entering into a receive queue having a plurality entries, a starting address for the packets in said data buffer received from said transmitting device; (c) transferring said addresses from said receive queue to a transmit queue for storing the starting addresses of packets for transmitting to said receiving device; each of said buffer and said queues being circular and (d) retransmitting said packets to said receiving device.
Claim 14
Dependent Claim
130 words
The method according to claim 11 wherein each queue entry has an address with an upper queue part and a lower queue part and the number of entries in said queue parts change from a maximum value to zero when an increment is added to the last of said plurality entries of said queue to generate a carry and wherein pointers for pointing to addresses in said queues are provided and further including generating said pointers by storing said upper address in a first register, storing said lower access in a second register, the carry from said second register is not coupled to said first register whereby when said maximum value is exceeded in the second register the address will be back to its beginning value in a circular manner.
Claim 15
Dependent Claim
80 words
The method according to claim 12 wherein a plurality of transmitting devices are provided and further including associating a buffer and a receive queue with each of said transmitting devices; transferring addresses from each of said receive queues to said transmit queue when data is received; establishing a base receive queue address and adding to said base receive queue address a number associated with each transmitting device to define the upper address of the receive queue for that transmitting device.
Claim 16
Dependent Claim
32 words
The method according to claim 13 further including sensing receipt of data from any of said transmitting devices and storing the number of the transmitting device from which said data is coming.
Claim 17
Dependent Claim
53 words
A method according to claim 14 wherein said data receiving device includes means to transmit data to said transmitting devices through said repeater and said transmitting devices include means for receiving data and further including associating a receive queue with said receiving device and a transmit queue with each of said transmitting devices.
Claim 18
Dependent Claim
25 words
The method according to claim 15 wherein said receiving device comprises a host and said transmitting devices comprises peripherals providing data input to said host.
Claim 19
Dependent Claim
26 words
The method according to claim 16 wherein said repeater includes a processor and further including generating an interrupt to said processor when sensing receipt of data.
Claim 20
Dependent Claim
63 words
The method according to claim 15 wherein said queue addresses include a front pointer address indicating the first entry and a rear pointer address indicating the next free space for an entry, and further including incrementing said rear pointer each time a new entry is made and incrementing said front pointer each time a buffer address is transferred from one queue to another.
Claim 21
Dependent Claim
70 words
The method according to claim 18 and further including storing in a table a receive entry for each of said buffers and a transmit entry for each of said buffers, the receive entry storing the address of the next free location in said buffer into which received data can be stored and the transmit entry storing the address of the next byte of data from said buffer to be transmitted.
Claim 22
Independent Claim
204 words
A method of operating a memory device having a finite total amount of physical memory space in connection with at least one operating device and a central processing unit comprising the steps of: (a) allocating a preselected amount of said finite total amount of physical memory space, with a beginning and an end, for said at least one operating device; (b) selectively transmitting data from said at least one operating device to said central processing unit; (c) operating said central processing unit to transfer said transmitted data from said at least one operating device to within said preselected amount of physical memory space allocated for said at least one operating device until said central processing unit reaches the end of said preselected amount of physical memory space; (d) upon reaching the end of said preselected amount of physical memory space, further operating said central processing unit to continue to transfer said transmitted data, by transferring said transmitted data to the beginning of said preselected amount of physical memory space without interrupting transfer of said transmitted data, whereby causing said preselected amount of physical memory space and to be connected to the beginning thereby causing said preselected amount of physical memory space to be circular.
Claim 23
Independent Claim
204 words
A method of operating a memory device having a finite total amount of physical memory space in connection with at least one operating device and a central processing unit comprising the steps of: (a) allocating a preselected amount of said finite total amount of physical memory space, with a beginning and an end, for said at least one operating device; (b) selectively transmitting data from said at least one operating device to said central processing unit; (c) operating said central processing unit to transfer said transmitted data from said at least one operating device to within said preselected amount of physical memory space allocated for said at least one operating device until said central processing unit reaches the end of said preselected amount of physical memory space; (d) upon reaching the end of said preselected amount of physical memory space, further operating said central processing unit to continue to transfer said transmitted data, by transferring said transmitted data to the beginning of said preselected amount of physical memory space without interrupting transfer of said transmitted data, whereby causing said preselected amount of physical memory space and to be connected to the beginning thereby causing said preselected amount of physical memory space to be circular.
Claim 24
Dependent Claim
111 words
The method according to claim 20, comprising the further steps of: (a) providing at least one output device; (b) operating said central processing unit to transfer said transmitted data from within said preselected amount of physical memory space to said at least one output device until said central processing unit reaches the end of said preselected amount of physical memory space; and (c) upon reaching the end of said preselected amount of physical memory space, further operating said central processing unit to continue to transfer said transmitted data, by transferring said transmitted data from the beginning of said preselected amount of physical memory space without interrupting transfer of said transmitted data.
Claim 25
Independent Claim
23 words
The method according to either of claims 20 or 21 wherein said at least one operating device comprises at least one peripheral device.
Claim 26
Dependent Claim
19 words
The method according to claim 21 wherein said at least one output device comprises a second central processing unit.
Claim 27
Dependent Claim
83 words
The method according to claim 21, comprising the further steps of: (a) providing a universal asynchronous receiver/transmitter; (b) operating said universal asynchronous receiver/transmitter to receive transmitted data from said at least one operating device; (c) upon receiving said transmitted data, operating said universal asynchronous receiver/transmitter to interrupt said central processing unit; (d) upon interruption of said central processing unit, operating said central processing unit for storing the starting address for said transmitted data in a transmit queue for transmitting to said receiving device.
Claim 28
Dependent Claim
53 words
The method according to claim 24, comprising the further steps of: (a) operating said central processing unit to transfer said transmitted data from within said preselected amount of physical memory to said universal asynchronous receiver/transmitter; (b) operating said universal asynchronous receiver/transmitter to transfer said transmitted data to said at least one output device.
Claim 29
Dependent Claim
20 words
The method according to claim 23 wherein said second central processing unit is operatively associated with a computer graphics system.
References Cited (Backward Citations)
US4135156A
Cited
US4674033A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-02-26 | 1993-08-28 | 1994-02-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-02-26 | 1997-08-28 | 1998-02-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-02-26 | 2001-08-28 | 2002-02-27 | $7700.00 | Window Closed / Lapsed |