Patent US4545016A successfully refreshed from Google Patents.
US4545016A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory management system
Assignee: Samsung Electronics Co Ltd
•
Filing: 1983-01-07
•
Granted: 1985-10-01
•
Expires: 2003-01-07
Abstract
Abstract A memory management system for providing memory protection for various programs running in a computer such as a 16-bit multi-tasking computer system. The scheme of the present invention provides address translation so as to provide separation of memory spaces. In this connection, each program in the machine has associated therewith, two numbers including an offset number and a limit number. Each program is written so that its base starting address is at the same predetermined address, preferably zero. The address space for each program is separated in memory by adding the offset number for that program to the base address to provide the physical address number. The program is prevented from accessing any memory area outside of its allotted area by comparing the sum of the offset and processor addresses to the limit number. If the result is less than the limit number, the computed address is valid, and if it is outside the limit number then the computed address is considered invalid and an error routine is initiated.
Inventors
- 👤 Michael F. Berger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 09:40
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/14; G06F12/1416; G06F12/1425; G06F12/1441
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
264 words
In a multi-tasking computer system including a processor having multiple address and data lines, and a memory for partitionally storing multiple programs with each program having a predetermined base address, memory management circuitry comprising: means for storing an off-set indicia with each off-set indicia so stored being associated with a corresponding program stored in memory, said means for storing an off-set indicia comprising first and second off-set register means each defining an end bound of the off-set number range and means for mutually exclusively enabling the first and second off-set register means, means for combining said off-set indicia with said base address to provide an effective address, said means for combining comprising first and second adder means with each adder means having one input means for receiving said base address, another input means coupled from the off-set register means and an output means at which is provided the effective address, means coupling the effective address to the memory to access the running program, means for storing a limit indicia with each limit indicia so stored being associated with a corresponding program stored in memory, said means for storing a limit indicia comprising first and second limit register means each defining an end bound of the limit number range and means for mutually exclusively enabling the first and second limit register means, and comparator means having one input means for receiving the limit register means address, another input means for receiving the effective address and an output means for providing an error signal when the effective address falls outside of the limit register means address.
Claim 2
Dependent Claim
264 words
In a multi-tasking computer system including a processor having multiple address and data lines, and a memory for partitionally storing multiple programs with each program having a predetermined base address, memory management circuitry comprising: means for storing an off-set indicia with each off-set indicia so stored being associated with a corresponding program stored in memory, said means for storing an off-set indicia comprising first and second off-set register means each defining an end bound of the off-set number range and means for mutually exclusively enabling the first and second off-set register means, means for combining said off-set indicia with said base address to provide an effective address, said means for combining comprising first and second adder means with each adder means having one input means for receiving said base address, another input means coupled from the off-set register means and an output means at which is provided the effective address, means coupling the effective address to the memory to access the running program, means for storing a limit indicia with each limit indicia so stored being associated with a corresponding program stored in memory, said means for storing a limit indicia comprising first and second limit register means each defining an end bound of the limit number range and means for mutually exclusively enabling the first and second limit register means, and comparator means having one input means for receiving the limit register means address, another input means for receiving the effective address and an output means for providing an error signal when the effective address falls outside of the limit register means address.
Claim 3
Dependent Claim
19 words
In a multi-tasking computer system as set forth in claim 1 wherein each program has the same base address.
Claim 4
Dependent Claim
17 words
In a multi-tasking computer system as set forth in claim 2 wherein the base address is zero.
Claim 5
Dependent Claim
49 words
In a multi-tasking computer system as set forth in claim 1 including means coupling lower order addresses from the off-set register means to said another input means of the second adder means and means coupling lower order processor addresses to said one input means of the first adder means.
Claim 6
Dependent Claim
34 words
In a multi-tasking computer system as set forth in claim 4 including means coupling lower order addresses from the second off-set register means to the said another input means of the first adder means.
Claim 7
Dependent Claim
51 words
In a multi-tasking computer system as set forth in claim 5 including means coupling higher order addresses from the second off-set register means to the said another input means of the second adder means and means coupling higher order processor addresses to said one input means of the second adder means.
Claim 8
Dependent Claim
34 words
In a multi-tasking computer system as set forth in claim 6 including means coupling higher order addresses from the first off-set register means to the said another input means of the second adder means.
Claim 9
Dependent Claim
53 words
In a multi-tasking computer system as set forth in claim 7 including means coupling the effective addresses from both adder means to the said another input means of the comparator means, and means coupling the outputs in common from both limit register means to the said one input means of the comparator means.
Claim 10
Dependent Claim
46 words
In a multi-tasking computer system as set forth in claim 1 including first and second multiplexer means each having one input means for receiving said base address, another input means coupled from the adder means and an output means at which is provided the effective address.
Claim 11
Dependent Claim
33 words
In a multi-tasking computer system as set forth in claim 9 including means for commonly controlling the multiplexer means to couple to the output means thereof either the effective address or processor address.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-09-30 | 1989-04-01 | 1989-10-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-09-30 | 1993-04-01 | 1993-10-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-09-30 | 1997-04-01 | 1997-10-01 | $7700.00 | Window Closed / Lapsed |