← Back to Patent Explorer
EP0439920A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

System and method for memory management in a microcomputer

Assignee: HP Inc
•
Filing: 1990-11-27
•
Granted: —
•
Expires: 2010-11-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method for managing memory in a microcomputer dynamically allocates a pointer table of varying length at one end of a data memory area, and similarly allocates a data field, comprising data blocks, at the other end of the data memory area. Data pointers within the pointer table point to the memory locations of the data blocks. As data blocks are added, the data field and the pointer table grow towards each other. <IMAGE>

Inventors

  • 👤 Philip Garcia

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-03 17:39
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0223; G06F2212/00; G06F2212/20; G06F2212/202; G06F2212/2022; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99953; Y10S707/99956

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 150 words
A system for allocation and management of memory in a microcomputer, comprising: a data memory area, having a first end and a second end; first means for dynamically allocating a pointer table of variable length containing one or more data pointers, where said one or more data pointers begin from said first end of said data memory area; second means for obtaining from said pointer table a next available data memory location for dynamically allocating a data block of variable length within a data field, where said data field begins from said second end of said data memory area; and, third means for placing in said one or more data pointers updated location information for said data field of said data memory area; and, where said pointer table and said data field grow towards each other from said first end and said second end, respectively, of said data memory area.
Claim 2
Dependent Claim 13 words
The system of claim 1, wherein said data memory area comprises CMOS memory.
Claim 3
Dependent Claim 53 words
The system of claim 1, further comprising means responsive to said second means and said third means for detecting whether the allocation of an additional data block in said data field and allocation of an additional data pointer in said pointer table would cause said data field and said pointer table to overlap.
Claim 4
Dependent Claim 32 words
The system of claim 1, wherein said second means comprises a free pointer index containing the address of a data pointer in said pointer table having said next available data memory location.
Claim 5
Dependent Claim 16 words
The system of claim 1, wherein said data block of said second means has zero length.
Claim 6
Independent Claim 117 words
A method for allocation and management of memory in a microcomputer, comprising the steps of: (1) dynamically allocating a pointer table of variable length containing data pointers, beginning from a first end of a data memory area; (2) obtaining from said pointer table an address of a next available data memory location, beginning from a second end of said data memory area, to which a data block is to be written; (3) writing said data block at said next available data memory location; and (4) allocating a data pointer in said pointer table containing location information for a subsequent data block, and said subsequent data block being contiguous with said data block of said data memory area.
Claim 7
Dependent Claim 21 words
The method of claim 6, wherein step (3) comprises the step of writing said data block to a non-volatile CMOS memory.
Claim 8
Dependent Claim 47 words
The method of claim 6, wherein step (2) comprises the step of detecting whether the allocation of an additional data block in said data field and allocation of an additional data pointer in said pointer table would cause said data field and said pointer table to overlap.
Claim 9
Dependent Claim 35 words
The method of claim 6, wherein step (2) comprises the step of using a free pointer index containing the address of a data pointer in said pointer table having said next available data memory location.
Claim 10
Dependent Claim 26 words
The method of claim 6, wherein step (3) comprises the step of writing said data block such that said data block has a has zero length.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag