Patent US5138610A successfully refreshed from Google Patents.
US5138610A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of controlling in a quasi-parallel mode a plurality of peripheral units from a single control unit and system for implementing this mode
Assignee: US Philips Corp
•
Filing: 1991-03-11
•
Granted: 1992-08-11
•
Expires: 2011-03-11
Abstract
Abstract A method of controlling a plurality of peripheral units from a single control unit, a program being stored in a memory of the control unit and the peripheral units being in a position to communicate with one another and with the control unit over a common bus in successive frames of a time-division multiplex system, each frame in the time-division multiplex system being subdivided into a number of time slots at least equal to the number of peripheral units, the same time slot in each frame being assigned to a peripheral unit, specifically each peripheral unit transferring information about its status, which information is initiated by the peripheral unit itself, to the memory in the control unit during or at least immediately prior to the time slot assigned to the peripheral unit in the next frame.
Inventors
- 👤 Reinardus H. M. Kohlmann
- 👤 Johannes A. A. Vossen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 13:50
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/20; G06F13/28; H; H04; H04M; H04M11/00; H04M11/06; H04M11/068; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
247 words
A method for controlling a plurality of respective peripheral units from a single control unit having a memory for storing a program, the method comprising the steps of: a) communicating between the peripheral units and between the peripheral units and the control unit over a common bus in successive time-division multiplex frames, which time-division multiplex frames are each divided into a number of time slots, which number of time slots is at least as large as a number of the respective peripheral units, each respective one of the peripheral units being assigned a respective one of the time slots within each time-division multiplex frame according to a time slot assignment which does not change from frame to frame; b) scanning and/or executing the program lines of the program in the peripheral units according to the time slot assignment, each respective peripheral unit scanning and/or executing an equal number of the program lines during its respective one of the time slots; and c) transmitting respective information about a change in status of a respective peripheral unit, from the respective peripheral unit to the memory, i) during a present respective one of the time slots assigned to the respective peripheral unit in a present multiplex frame, when the change in status occurs during that respective one of the time slots, or ii) immediately prior to the respective one of the time slots assigned to the respective peripheral unit in a next time-division multiplex frame after the change in status.
Claim 2
Independent Claim
247 words
A method for controlling a plurality of respective peripheral units from a single control unit having a memory for storing a program, the method comprising the steps of: a) communicating between the peripheral units and between the peripheral units and the control unit over a common bus in successive time-division multiplex frames, which time-division multiplex frames are each divided into a number of time slots, which number of time slots is at least as large as a number of the respective peripheral units, each respective one of the peripheral units being assigned a respective one of the time slots within each time-division multiplex frame according to a time slot assignment which does not change from frame to frame; b) scanning and/or executing the program lines of the program in the peripheral units according to the time slot assignment, each respective peripheral unit scanning and/or executing an equal number of the program lines during its respective one of the time slots; and c) transmitting respective information about a change in status of a respective peripheral unit, from the respective peripheral unit to the memory, i) during a present respective one of the time slots assigned to the respective peripheral unit in a present multiplex frame, when the change in status occurs during that respective one of the time slots, or ii) immediately prior to the respective one of the time slots assigned to the respective peripheral unit in a next time-division multiplex frame after the change in status.
Claim 3
Dependent Claim
231 words
A data processing system comprising: a) a bus; b) a control unit including a memory for storing a program; c) a plurality of respective peripheral units for scanning and/or executing program lines of the program, the respective peripheral units communicating with each other and with the control unit using a plurality of time-division multiplex frames, each of the time division multiplex frames being divided into a number of time slots, the number of time slots being at least as large as a number of the respective peripheral units, each of the respective peripheral units being assigned a respective one of the time slots within each time-division multiplex frame according to a time slot assignment which does not change from frame to frame, each respective peripheral unit scanning and/or executing an equal number of the program lines during its respective one of the time slots; and d) means for transferring information about a status change, in any respective peripheral unit, from the respective peripheral unit to the memory i) during a present respective one of the time slots assigned to the respective peripheral unit in a present multiplex frame, when the change of status occurs during that respective one of the time slots, or ii) immediately prior to the respective one of the time slots assigned to the respective peripheral unit in a next time-division multiplex frame after the change in status.
Claim 4
Dependent Claim
231 words
A data processing system comprising: a) a bus; b) a control unit including a memory for storing a program; c) a plurality of respective peripheral units for scanning and/or executing program lines of the program, the respective peripheral units communicating with each other and with the control unit using a plurality of time-division multiplex frames, each of the time division multiplex frames being divided into a number of time slots, the number of time slots being at least as large as a number of the respective peripheral units, each of the respective peripheral units being assigned a respective one of the time slots within each time-division multiplex frame according to a time slot assignment which does not change from frame to frame, each respective peripheral unit scanning and/or executing an equal number of the program lines during its respective one of the time slots; and d) means for transferring information about a status change, in any respective peripheral unit, from the respective peripheral unit to the memory i) during a present respective one of the time slots assigned to the respective peripheral unit in a present multiplex frame, when the change of status occurs during that respective one of the time slots, or ii) immediately prior to the respective one of the time slots assigned to the respective peripheral unit in a next time-division multiplex frame after the change in status.
Claim 5
Dependent Claim
23 words
A system as claimed in claim 2, characterized in that the number of time slots is equal to the number of peripheral units.
Claim 6
Dependent Claim
115 words
A system as claimed in claim 3, A) further comprising a counter, within the control unit, for providing a count; and B) wherein: I) the memory in the control unit is a programmable logic array (PLA); and II) the information about the change in status of a peripheral unit includes a number of program lines to be skipped in the PLA as a result of program execution by the respective peripheral unit and which together with the count forms an address of the PLA, whereby the peripheral units carry out the program without the central unit executing any jump statements and without risking that any peripheral unit starts executing the program lines with insufficient information.
Claim 7
Dependent Claim
18 words
A system as claimed in claim 2, characterized in that the equal number of program lines is 32.
Claim 8
Dependent Claim
114 words
A system as claimed in claim 5, A) further comprising a counter, within the control unit, for providing a count; and B) wherein: I) the memory in the control unit is a programmable logic array (PLA); and II) the information about the change status of a peripheral unit includes a number of program lines to be skipped in the PLA as a result of program execution by the respective peripheral unit and which together with the count forms an address of the PLA, whereby the peripheral units carry out the program without the central unit executing any jump statements and without risking that any peripheral unit starts executing the program lines with insufficient information.
Claim 9
Dependent Claim
115 words
A system as claimed in claim 2, A) further comprising a counter, within the control unit, for providing a count; and B) wherein I) the memory in the control unit is a programmable logic array (PLA); and II) the information about the change in status of a peripheral unit includes a number of program lines to be skipped in the PLA as a result of program execution by the respective peripheral unit and which together with the count forms an address of the PLA, whereby the peripheral units carry out the program without the central unit executing any jump statements and without risking that any peripheral unit starts executing the program lines with insufficient information.
Claim 10
Dependent Claim
40 words
The system of claim 2 wherein, when a number of program lines to be executed in a peripheral unit is less than the equal number, the peripheral unit makes up the rest of the equal number by scanning non-functional lines.
References Cited (Backward Citations)
US3377621A
Cited
US4032721A
Cited
US3931613A
Cited
US4109311A
Cited
US4402046A
Cited
US4396980A
Cited
JPS60195659A
Cited
GB2162722A
Cited
US4672606A
Cited
US4672608A
Cited
US4688212A
Cited
EP0228629A2
Cited
US4821263A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-08-11 | 1996-02-10 | 1996-08-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-08-11 | 2000-02-10 | 2000-08-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-08-11 | 2004-02-10 | 2004-08-11 | $7700.00 | Window Closed / Lapsed |