← Back to Patent Explorer
US5293593A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for the mapping of physically non-contiguous memory fragments to be linearly addressable

Assignee: HP Inc
•
Filing: 1990-10-11
•
Granted: 1994-03-08
•
Expires: 2010-10-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for use in read/write operations by a processor that reads and writes information in first and second address formats. The method and apparatus include a memory and a memory mapper for remapping according to a predetermined scheme those memory fragments not containing information stored in the first address format. Memory fragments are thus accessible to the processor for reading and writing information in the second address format. Such remapping operation results in the memory fragments appearing logically contiguous. In the preferred embodiment, the first address format is an x-y address format and the second address format is a linearly addressable format. An alternative embodiment discloses the use of a second memory for reading and writing information in the second address format. In that embodiment, the memory mapper remaps the memory fragments to appear logically contiguous with said second memory. The invention finds particular utility in conjunction with a graphics processor system. In such a system, the memory mapper is a programmable array logic device and the memory is VRAM memory. In certain situations it is preferred to remap that portion of the memory where information is to be stored in the first address format so that the first information signal is stored in locations which are physically contiguous.

Inventors

  • 👤 David J. Hodge
  • 👤 John C. Keith
  • 👤 Lief J. Sorensen
  • 👤 Steven P. Tucker

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 14:07
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/36; G09G5/39

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 97 words
Apparatus for use in read/write operations by a processor, wherein said processor reads and writes information in first and second address formats, said first address format for the storage of display information and said second address format for the storage of other information, said apparatus comprising: a memory; and a memory mapper, connected to said memory and said processor, said memory mapper for remapping those memory fragments not containing information stored in said first address format so that said memory fragments are linearly addressable by said processor for reading and writing information in said second address format.
Claim 2
Dependent Claim 97 words
Apparatus for use in read/write operations by a processor, wherein said processor reads and writes information in first and second address formats, said first address format for the storage of display information and said second address format for the storage of other information, said apparatus comprising: a memory; and a memory mapper, connected to said memory and said processor, said memory mapper for remapping those memory fragments not containing information stored in said first address format so that said memory fragments are linearly addressable by said processor for reading and writing information in said second address format.
Claim 3
Dependent Claim 42 words
The apparatus of claim 1, further comprising a second memory, wherein said second memory is utilized for reading and writing information in said second address format, wherein said memory mapper remaps said memory fragments to be logically contiguous with said second memory.
Claim 4
Dependent Claim 27 words
The apparatus of claim 1, wherein said memory mapper remaps said memory so that those memory fragments not containing information stored in said first address format are.
Claim 5
Dependent Claim 37 words
The apparatus of claim 3, wherein said second format is a linearly addressable format and wherein said first format is a non-linearly addressable format said memory mapper remapping said memory fragments for linear addressing by said processor.
Claim 6
Dependent Claim 14 words
The apparatus of claim 4, wherein said first address format is x-y address format.
Claim 7
Dependent Claim 119 words
A graphics system comprising: a graphics processor for generating first and second information signals, wherein said first and second information signals comprise digital words and wherein each of said digital words comprises an address portion, wherein the address portion associated with said first information signal is representative of a first address format and wherein the address portion associated with said second information signal is representative of a second address format; a memory; and a memory mapper, connected to said memory and said graphics processor, for remapping those memory fragments not containing information stored in said first address format so that said memory fragments are linearly addressable by said processor for reading and writing information in said second address format.
Claim 8
Dependent Claim 119 words
A graphics system comprising: a graphics processor for generating first and second information signals, wherein said first and second information signals comprise digital words and wherein each of said digital words comprises an address portion, wherein the address portion associated with said first information signal is representative of a first address format and wherein the address portion associated with said second information signal is representative of a second address format; a memory; and a memory mapper, connected to said memory and said graphics processor, for remapping those memory fragments not containing information stored in said first address format so that said memory fragments are linearly addressable by said processor for reading and writing information in said second address format.
Claim 9
Dependent Claim 15 words
The system of claim 6, wherein said memory mapper comprises a programmable array logic device.
Claim 10
Dependent Claim 41 words
The system of claim 6, wherein said memory mapper further remaps that portion of said memory where information is to be stored in said first address format so that said first information signal is stored in locations which are physically contiguous.
Claim 11
Dependent Claim 42 words
The system of claim 6, further comprising a second memory, wherein said second memory is utilized for reading and writing information in said second address format, wherein said memory mapper remaps said memory fragments to be logically contiguous with said second memory.
Claim 12
Dependent Claim 12 words
The apparatus of claim 9, wherein said second memory comprises DRAM memory.
Claim 13
Dependent Claim 11 words
The system of claim 6, wherein said memory comprises VRAM memory.
Claim 14
Dependent Claim 21 words
The system of claim 11, wherein said first information signal comprises display information and said second information signal comprises program information.
Claim 15
Independent Claim 98 words
A method for use in read/write operations by a processing system which includes a processor, an addressable memory, and a memory mapper, wherein said processor reads and writes information in first and second address formats, said first address format for the storage of display information and said second address format for the storage of other information, said method comprising the steps of: remapping those memory fragments not containing information stored in said first address format so that said memory fragments are linearly addressable by said processor and writing information to said memory fragments in said second address format.
Claim 16
Independent Claim 98 words
A method for use in read/write operations by a processing system which includes a processor, an addressable memory, and a memory mapper, wherein said processor reads and writes information in first and second address formats, said first address format for the storage of display information and said second address format for the storage of other information, said method comprising the steps of: remapping those memory fragments not containing information stored in said first address format so that said memory fragments are linearly addressable by said processor and writing information to said memory fragments in said second address format.
Claim 17
Dependent Claim 51 words
The method of claim 13, further comprising the step of providing a second memory, wherein said second memory is utilized for reading and writing information in said second address format, wherein said step of remapping comprises the step of remapping said memory fragments to be logically contiguous with said second memory.
Claim 18
Dependent Claim 31 words
The method of claim 13, wherein said step of remapping comprises remapping said memory so that those memory fragments not containing information stored in said first address format are physically contiguous.
Claim 19
Dependent Claim 52 words
The method of claim 15, wherein said second format is a linearly addressable format and wherein said first format is a non-linearly addressable format wherein said step of remapping those memory fragments not containing information stored in said first address format comprises remapping said memory fragments for linear addressing by said processor.
Claim 20
Dependent Claim 57 words
The method of claim 13, further comprising the step of providing a second memory, wherein said second memory is utilized for reading and writing information in said second address format, and further comprising the step of remapping those memory fragments not containing information stored in said first address format to be logically contiguous with said second memory.
Claim 21
Independent Claim 129 words
A method for remapping memory fragments in a data processing system, which system includes a processor, an addressable memory and a memory mapper, said method comprising: generating first and second information signals, wherein said first and second information signals comprise digital words and wherein each of said digital words comprises an address portion, wherein the address portion associated with said first information signal is representative of a first address format and wherein the address portion associated with said second information signal is representative of a second address format; and remapping those memory fragments present in said memory that do not contain information stored in said first address format so that said memory fragments are linearly addressable by said processor for reading and writing information in said second address format.
Claim 22
Independent Claim 129 words
A method for remapping memory fragments in a data processing system, which system includes a processor, an addressable memory and a memory mapper, said method comprising: generating first and second information signals, wherein said first and second information signals comprise digital words and wherein each of said digital words comprises an address portion, wherein the address portion associated with said first information signal is representative of a first address format and wherein the address portion associated with said second information signal is representative of a second address format; and remapping those memory fragments present in said memory that do not contain information stored in said first address format so that said memory fragments are linearly addressable by said processor for reading and writing information in said second address format.
Claim 23
Dependent Claim 21 words
The method of claim 18, wherein said first information signal comprises display information and said second information signal comprises program information.
Claim 24
Dependent Claim 44 words
The method of claim 19, further comprising the step of remapping that portion of said memory where information is to be stored in said first address format so that said first information signal is stored in locations in said memory which are physically contiguous.

References Cited (Backward Citations)

US4511964A Cited
US4672538A Cited
US4860252A Cited
US4774652A Cited
US4933877A Cited
US5113492A Cited
US4942541A Cited
US5146571A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-03-07 1997-09-06 1998-03-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-03-07 2001-09-06 2002-03-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-03-07 2005-09-06 2006-03-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag