WO2007112083A3 - High-speed data compression based on set associative cache mapping techniques - Google Patents

High-speed data compression based on set associative cache mapping techniques Download PDF

Info

Publication number
WO2007112083A3
WO2007112083A3 PCT/US2007/007412 US2007007412W WO2007112083A3 WO 2007112083 A3 WO2007112083 A3 WO 2007112083A3 US 2007007412 W US2007007412 W US 2007007412W WO 2007112083 A3 WO2007112083 A3 WO 2007112083A3
Authority
WO
WIPO (PCT)
Prior art keywords
memory address
current symbol
symbol value
address reference
values
Prior art date
Application number
PCT/US2007/007412
Other languages
French (fr)
Other versions
WO2007112083A2 (en
Inventor
Luis Paris
Original Assignee
Univ Mississippi
Luis Paris
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Univ Mississippi, Luis Paris filed Critical Univ Mississippi
Priority to EP07753991A priority Critical patent/EP2005594A4/en
Priority to CA002647259A priority patent/CA2647259A1/en
Priority to MX2008012216A priority patent/MX2008012216A/en
Priority to JP2009502914A priority patent/JP2009531976A/en
Priority to AU2007230901A priority patent/AU2007230901B2/en
Publication of WO2007112083A2 publication Critical patent/WO2007112083A2/en
Publication of WO2007112083A3 publication Critical patent/WO2007112083A3/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
    • G06F5/06—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor
    • G06F5/10—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations, e.g. using random access memory
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0864—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches using pseudo-associative means, e.g. set-associative or hashing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G06F12/123—Replacement control using replacement algorithms with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H03M7/3088—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing the use of a dictionary, e.g. LZ78
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/40—Specific encoding of data in memory or cache
    • G06F2212/401—Compressed data

Abstract

A method of compressing data works by reading two contiguous data values, of length K bits (20) and N bits (30), respectively, from the data stream, as a memory address reference, and a current symbol value, respectively. The current symbol value is written (40) to replace one of the values at the memory address reference if the current symbol value does not match any of the values at the memory address reference, and a MISS code followed by the current symbol value are appended to the compressed data stream (40). Alternatively, if the current symbol value matches any of the values at the memory address reference then a HIT code is added to the compressed data stream (50), the HIT code representing the location, or an attribute associated with the location where the value was found in the memory address reference.
PCT/US2007/007412 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping techniques WO2007112083A2 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP07753991A EP2005594A4 (en) 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping techniques
CA002647259A CA2647259A1 (en) 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping techniques
MX2008012216A MX2008012216A (en) 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping techniques.
JP2009502914A JP2009531976A (en) 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping technology
AU2007230901A AU2007230901B2 (en) 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping techniques

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US78557206P 2006-03-24 2006-03-24
US60/785,572 2006-03-24

Publications (2)

Publication Number Publication Date
WO2007112083A2 WO2007112083A2 (en) 2007-10-04
WO2007112083A3 true WO2007112083A3 (en) 2008-07-24

Family

ID=38541725

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2007/007412 WO2007112083A2 (en) 2006-03-24 2007-03-26 High-speed data compression based on set associative cache mapping techniques

Country Status (10)

Country Link
US (1) US7436330B2 (en)
EP (1) EP2005594A4 (en)
JP (1) JP2009531976A (en)
KR (1) KR20090021149A (en)
CN (1) CN101449462A (en)
AU (1) AU2007230901B2 (en)
CA (1) CA2647259A1 (en)
MX (1) MX2008012216A (en)
WO (1) WO2007112083A2 (en)
ZA (1) ZA200808522B (en)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8085171B2 (en) * 2006-03-24 2011-12-27 University Of Mississippi High-speed data compression based on set associative cache mapping techniques
US7834784B1 (en) * 2007-01-18 2010-11-16 Cisco Technology, Inc. Data redundancy elimination mechanism including fast lookup of data patterns exhibiting spatial locality
US8918588B2 (en) * 2009-04-07 2014-12-23 International Business Machines Corporation Maintaining a cache of blocks from a plurality of data streams
US8098247B2 (en) * 2009-09-24 2012-01-17 Crucs Holdings, Llc Systems and methods for geometric data compression and encryption
US9378560B2 (en) * 2011-06-17 2016-06-28 Advanced Micro Devices, Inc. Real time on-chip texture decompression using shader processors
KR101956031B1 (en) * 2012-10-15 2019-03-11 삼성전자 주식회사 Data compressor, memory system comprising the compress and method for compressing data
US8886926B2 (en) 2012-11-07 2014-11-11 Centri Technology, Inc. Single-pass data compression and encryption
US9467294B2 (en) * 2013-02-01 2016-10-11 Symbolic Io Corporation Methods and systems for storing and retrieving data
US8804814B1 (en) 2013-06-04 2014-08-12 Centri Technology, Inc. Seeding of a workspace to optimize codec operations
US9483199B1 (en) * 2014-08-18 2016-11-01 Permabit Technology Corporation Data deduplication using multiple devices
US9537504B1 (en) * 2015-09-25 2017-01-03 Intel Corporation Heterogeneous compression architecture for optimized compression ratio
JP6834327B2 (en) * 2016-10-06 2021-02-24 富士通株式会社 Coding program, coding device and coding method
US10713750B2 (en) * 2017-04-01 2020-07-14 Intel Corporation Cache replacement mechanism
CN111384963B (en) * 2018-12-28 2022-07-12 上海寒武纪信息科技有限公司 Data compression/decompression device and data decompression method
CN111384962B (en) * 2018-12-28 2022-08-09 上海寒武纪信息科技有限公司 Data compression/decompression device and data compression method
US10936825B1 (en) * 2019-07-19 2021-03-02 Clrv Technologies, Llc Methods and apparatus to improve disambiguation and interpretation in automated text analysis using transducers applied on a structured language space
CN111614359B (en) * 2020-06-02 2023-04-11 同济大学 Data encoding method and decoding method using point prediction and frequent occurrence position array

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5991902A (en) * 1991-08-07 1999-11-23 Mitsubishi Denki Kabushiki Kaisha Memory apparatus and data processor using the same
US6941442B2 (en) * 2002-08-02 2005-09-06 Arm Limited Entry lockdown within a translation lookaside buffer mechanism
US20060174083A1 (en) * 2005-02-03 2006-08-03 Barrick Brian D Method of load/store dependencies detection with dynamically changing address length

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3675211A (en) 1970-09-08 1972-07-04 Ibm Data compaction using modified variable-length coding
US5450562A (en) * 1992-10-19 1995-09-12 Hewlett-Packard Company Cache-based data compression/decompression
JPH08223428A (en) * 1995-02-10 1996-08-30 Fuji Xerox Co Ltd Image data compressor and image data expander
EP1320833B1 (en) 2000-09-28 2008-12-03 Roke Manor Research Limited Improved huffman data compression method
US6657565B2 (en) 2002-03-21 2003-12-02 International Business Machines Corporation Method and system for improving lossless compression efficiency
GB0210604D0 (en) 2002-05-09 2002-06-19 Ibm Method and arrangement for data compression
US7177985B1 (en) * 2003-05-30 2007-02-13 Mips Technologies, Inc. Microprocessor with improved data stream prefetching
CN1868127B (en) 2003-10-17 2011-06-22 佩茨拜特软件有限公司 Data compression system and method
US7180433B1 (en) 2005-09-22 2007-02-20 Tandberg Storage Asa Fast data compression and decompression system and method
US7849241B2 (en) 2006-03-23 2010-12-07 International Business Machines Corporation Memory compression method and apparatus for heterogeneous processor architectures in an information handling system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5991902A (en) * 1991-08-07 1999-11-23 Mitsubishi Denki Kabushiki Kaisha Memory apparatus and data processor using the same
US6941442B2 (en) * 2002-08-02 2005-09-06 Arm Limited Entry lockdown within a translation lookaside buffer mechanism
US20060174083A1 (en) * 2005-02-03 2006-08-03 Barrick Brian D Method of load/store dependencies detection with dynamically changing address length

Also Published As

Publication number Publication date
MX2008012216A (en) 2008-12-10
AU2007230901B2 (en) 2010-12-16
US7436330B2 (en) 2008-10-14
AU2007230901A1 (en) 2007-10-04
CA2647259A1 (en) 2007-10-04
JP2009531976A (en) 2009-09-03
KR20090021149A (en) 2009-02-27
WO2007112083A2 (en) 2007-10-04
EP2005594A4 (en) 2010-10-20
EP2005594A2 (en) 2008-12-24
US20080122665A1 (en) 2008-05-29
CN101449462A (en) 2009-06-03
ZA200808522B (en) 2009-08-26

Similar Documents

Publication Publication Date Title
WO2007112083A3 (en) High-speed data compression based on set associative cache mapping techniques
WO2010045334A3 (en) High-speed data compression based on set associative cache mapping techniques
CN103326732B (en) The method of compression data, the decompression method of data, encoder
TWI266223B (en) Interfacing with ink
US9146933B2 (en) Compressed storage access system with uncompressed frequent use data
WO2008042298A3 (en) Data cache virtual hint way prediction, and applications thereof
WO2006099633A3 (en) Method and system for optimizing translation lookaside buffer entries
WO2005029369A3 (en) Data profiling
WO2007065105A3 (en) Method for tracking of non-resident pages
CN102147768B (en) Memory, solid caching system and caching data processing method
TW200705220A (en) Information processor, information processing method, program storage medium, program, and data structure
WO2006118667A3 (en) Prefetching across a page boundary
IL169265A0 (en) Page descriptors for prefetching and memory management
WO2007117643A3 (en) System and method for maintaining the genealogy of documents
WO2006051513A3 (en) Cache with prefetch
WO2011041047A3 (en) Home agent data and memory management
CN110908931B (en) Updating method of TLB module
WO2006102665A3 (en) Global modified indicator to reduce power consumption on cache miss
JP2007102312A5 (en)
CN103019959A (en) Instruction cache
CA2633528A1 (en) A method of filtering high data rate traffic
US10067705B2 (en) Hybrid compression for large history compressors
WO2006120408A3 (en) Memory caching in data processing
WO2006138249A3 (en) Caching of information according to popularity
WO2002095950A8 (en) Character table implemented data compression method and apparatus

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200780018509.7

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07753991

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 2009502914

Country of ref document: JP

Ref document number: 2647259

Country of ref document: CA

Ref document number: MX/a/2008/012216

Country of ref document: MX

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2007230901

Country of ref document: AU

WWE Wipo information: entry into national phase

Ref document number: 8768/DELNP/2008

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2007753991

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020087025942

Country of ref document: KR

ENP Entry into the national phase

Ref document number: 2007230901

Country of ref document: AU

Date of ref document: 20070326

Kind code of ref document: A