US4410939A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for program interrupt processing with quasi-stack of register-sets
Assignee: Panasonic Holdings Corp
•
Filing: 1980-07-16
•
Granted: 1983-10-18
•
Expires: 2000-07-16
Abstract
Abstract A plurality of registers included in a central processing unit are electrically divided into a plurality of register-sets which are arranged in a given order to be used as a stack where one of the register-sets at the top of stack is normally used for executing the program of a main routine. In one embodiment, the data of the register-sets are pushed down for executing interrupt service routines and then popped up for resuming the suspended program. When all of the register-sets are loaded, the data may be saved in a saving region of a main memory, and the saved data may be directly transferred to the top register-set when needed. In another embodiment, actual push down and popping up of data are not performed but one of the register-sets is selectively enabled so that the register-sets function as a stack.
Inventors
- 👤 Katsura Kawakami
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 14:00
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/461; G06F9/462
Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
274 words
A method of processing program interrupts in a computer system having a central processing unit with a plurality of registers, and a main memory with a plurality of addresses, said registers being electrically divided into a plurality of register-sets so as to form a quasi stack of register-sets in which any one of said register sets may be used as the top register-set in said quasi stack, said register-sets in said quasi stack being arranged in a predetermined order to form a loop of register-sets, said main memory storing a program of a main routine and a plurality of programs of interrupt service routines having different priority levels, a first register-set in said quasi stack being normally enabled for the execution of said program of said main routine, said method comprising the steps of: (a) enabling said first register-set for executing the program of said main routine; (b) enabling another one of said register-sets as said top register-set in said predetermined order each time a first interrupt request or an interrupt request having a priority level higher than that of the interrupt service routine on execution is acknowledged for executing a corresponding interrupt service routine by the enabled register-set one after another; (c) enabling another one of said register-sets as said top register-set in an order reverse to said predetermined order each time said corresponding interrupt service routine has been completed for completing suspended interrupt service routine or routines of lower priority levels, if any, one after another; and (d) resuming the execution of the program of said main routine by enabling said first register set after all of the interrupt requests are processed.
Claim 2
Independent Claim
274 words
A method of processing program interrupts in a computer system having a central processing unit with a plurality of registers, and a main memory with a plurality of addresses, said registers being electrically divided into a plurality of register-sets so as to form a quasi stack of register-sets in which any one of said register sets may be used as the top register-set in said quasi stack, said register-sets in said quasi stack being arranged in a predetermined order to form a loop of register-sets, said main memory storing a program of a main routine and a plurality of programs of interrupt service routines having different priority levels, a first register-set in said quasi stack being normally enabled for the execution of said program of said main routine, said method comprising the steps of: (a) enabling said first register-set for executing the program of said main routine; (b) enabling another one of said register-sets as said top register-set in said predetermined order each time a first interrupt request or an interrupt request having a priority level higher than that of the interrupt service routine on execution is acknowledged for executing a corresponding interrupt service routine by the enabled register-set one after another; (c) enabling another one of said register-sets as said top register-set in an order reverse to said predetermined order each time said corresponding interrupt service routine has been completed for completing suspended interrupt service routine or routines of lower priority levels, if any, one after another; and (d) resuming the execution of the program of said main routine by enabling said first register set after all of the interrupt requests are processed.
Claim 3
Dependent Claim
158 words
A method of processing program interrupts in a computer system as claimed in claim 1, wherein said main memory has a saving region for saving data stored in at least one of said register-sets, said method further comprising the steps of: (a) saving, in said saving region of said memory, in said predetermined order, the contents of one of said register sets, in which the oldest data among said register-sets are stored, if all of said register-sets have been loaded, each time an interrupt request having a priority level higher than that of the interrupt service routine on execution is acknowledged for executing a corresponding interrupt service routine by the enabled register-set one after another; and (b) retrieving the saved data by transferring the same from said saving region of said main memory to one of said register-sets, which is enabled, for further completing the suspended interrupt service routine or routines of lower priority levels one after another.
References Cited (Backward Citations)
US3348211A
Cited
US3659272A
Cited
US3725868A
Cited
US3974480A
Cited
US4217638A
Cited
US4171537A
Cited
US4228500A
Cited
US4348721A
Cited
US4338662A
Cited
US4237535A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-10-17 | 1987-04-18 | 1987-10-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-10-17 | 1991-04-18 | 1991-10-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-10-17 | 1995-04-18 | 1995-10-18 | $7700.00 | Window Closed / Lapsed |