US2012030403A1PendingUtilityA1

Memory Module, Cache System and Address Conversion Method

49
Assignee: MIURA SEIJIPriority: May 20, 2005Filed: Jul 25, 2011Published: Feb 2, 2012
Est. expiryMay 20, 2025(expired)· nominal 20-yr term from priority
Inventors:Seiji Miura
H10W 90/754H10W 90/753H10W 90/752H10W 90/732H10W 90/724H10W 74/00H10W 72/5445H10W 72/884H10W 72/877G06F 2212/2022G11C 7/1006G06F 12/0862G06F 12/0246G06F 12/0888G11C 2207/2245G11C 5/02G06F 12/0893G06F 11/1068G06F 12/00
49
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A memory system including a non-volatile memory, a cache memory, a control circuit, and a data processing device is configured. The high speed can be achieved by transferring data in the non-volatile memory to the cache memory to retain the same therein. When the data in the non-volatile memory is transferred to the cache memory, error correction is performed so as to improve the reliability. Since the cache memory and the non-volatile memory can be accessed from the data processing device independently, improvement in usability can be achieved. The memory system including the plurality of chips is configured as a memory system module where respective chips are arranged in a stacked manner and wired by a ball grid array (BGA) and wire bonding between chips.

Claims

exact text as granted — not AI-modified
1 - 18 . (canceled) 
     
     
         19 . A cache system comprising:
 a non-volatile memory; and   a cache memory,   wherein, after address conversion, said cache memory is utilized for data retrieval in said cache memory.   
     
     
         20 . The cache system according to  claim 19 , wherein an address conversion method by said address conversion is programmable. 
     
     
         21 . An address conversion method,
 wherein, in the case where a storage capacity of a cache memory is 2 N  bytes, a line size address is Line[L−1:0], an index address is Index[I−1:0], and a tag address is Tag[N−1−L−1:0], when address inputted into said cache memory is defined as ADD[N−1:0], ADD[L−1:0] is allowed to correspond to the Line[L−1:0], ADD[N−1:I+L] is allowed to correspond to the Tag[N−1−L−1:0], ADD[I+L−1:L] is allowed to correspond to an address INDX 0 [I−1:0], ADD[I+I+L−1:I+L] is allowed to correspond to an address INDX 1 [I−1:0], and a result SUM[I−1:0] obtained by adding the INDX 0 [I−1:0] and INDX 1 [I−1:0] is allowed to correspond to the Index[I−1:0].   
     
     
         22 . A data processing device comprising:
 a cache memory,   wherein said cache memory is a cache memory in which data is retrieved by utilizing an address converted by the address conversion method according to  claim 21 .   
     
     
         23 . A memory module comprising:
 a cache memory,   wherein said cache memory is a cache memory in which data is retrieved by utilizing an address converted by the address conversion method according to  claim 21 .   
     
     
         24 . The cache system according to  claim 19 , wherein an address conversion method by said address conversion is the address conversion method according to  claim 19 . 
     
     
         25 - 36 . (canceled)

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.