REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION

Ron Asher; Danny Harnik; Kat I Ronen; Dmitry Sotnikov; Ron Asher; Danny Harnik; Oded Margalit; Kat I Ronen; Dmitry Sotnikov

REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION

Ron Asher (Inventor), Danny Harnik (Inventor), Kat I Ronen (Inventor), Dmitry Sotnikov (Inventor), Ron Asher (Inventor), Danny Harnik (Inventor), Oded Margalit (Inventor), Kat I Ronen (Inventor), Dmitry Sotnikov (Inventor)

Department of Computer Science

Research output: Patent

Abstract

Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression.

Original language	English
Patent number	US2014195498
IPC	H03M 7/ 30 A I
Priority date	10/01/13
State	Published - 10 Jul 2014

Cite this

@misc{a369bd7acbf849e2bdfc51e0b4d54f76,

title = "REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION",

abstract = "Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression.",

author = "Ron Asher and Danny Harnik and Ronen, {Kat I} and Dmitry Sotnikov and Ron Asher and Danny Harnik and Oded Margalit and Ronen, {Kat I} and Dmitry Sotnikov",

year = "2014",

month = jul,

day = "10",

language = "English",

type = "Patent",

note = "US2014195498; H03M 7/ 30 A I",

}

TY - PAT

T1 - REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION

AU - Asher, Ron

AU - Harnik, Danny

AU - Ronen, Kat I

AU - Sotnikov, Dmitry

AU - Asher, Ron

AU - Harnik, Danny

AU - Margalit, Oded

AU - Ronen, Kat I

AU - Sotnikov, Dmitry

PY - 2014/7/10

Y1 - 2014/7/10

N2 - Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression.

AB - Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression.

M3 - Patent

M1 - US2014195498

ER -

REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION

Abstract

Fingerprint

Cite this