-
公开(公告)号:US20240160579A1
公开(公告)日:2024-05-16
申请号:US18512989
申请日:2023-11-17
Applicant: Zeropoint Technologies AB
Inventor: Angelos Arelakis , Vasileios Spiliopoulos , Per Stenström
IPC: G06F12/1045 , G06F3/06 , G06F12/02 , G06F12/06 , G06F12/0882
CPC classification number: G06F12/1054 , G06F3/0608 , G06F3/0656 , G06F3/0659 , G06F3/0673 , G06F12/0246 , G06F12/0646 , G06F12/0882
Abstract: A method for accessing compressed computer memory residing in physical computer memory is disclosed. In the method, compressed memory blocks are represented as sectors, wherein all sectors contain a fixed number of compressed memory blocks, have a fixed logical size in the form of the fixed number of compressed memory blocks, and have varying physical sizes in the form of the total size of data stored in the respective compressed memory blocks. The method involves providing sector-based translation metadata to keep track of the sectors within a compressed memory page, receiving a physical memory access request comprising an address in the physical computer memory, using the address in the physical memory access request to derive a memory block index, using the memory block index and the fixed logical size of the sectors to determine a sector id, using the sector-based translation metadata to locate a sector having the sector id in the compressed memory page, and using the address of the physical memory access request to locate the requested data within said sector.
-
2.
公开(公告)号:US11658679B2
公开(公告)日:2023-05-23
申请号:US17415047
申请日:2019-12-23
Applicant: ZEROPOINT TECHNOLOGIES AB
Inventor: Henrik Häggebrant , Daniel Moreau , Angelos Arelakis , Per Stenström
CPC classification number: H03M7/40 , H03M7/3059 , H03M7/6005 , H03M7/6017
Abstract: A decompression system has a plurality of decompression devices in an array or chain layout for decompressing respective compressed data values of a compressed data block. A first decompression device is connected to a next decompression device, and a last decompression device is connected to a preceding decompression device. The first decompression device decompresses a compressed data value and reduces the compressed data block by extracting a codeword of the compressed data value and removing the compressed data value from the compressed data block, retrieving a decompressed data value out of the extracted codeword, and passing the reduced compressed data block to the next decompression device. The last decompression device receives a reduced compressed data block from the preceding decompression device and decompresses another compressed data value by extracting a codeword of the other compressed data value, and retrieving another decompressed data value out of the extracted codeword.
Elected for publication; FIG. 8.-
公开(公告)号:US11868271B2
公开(公告)日:2024-01-09
申请号:US17293584
申请日:2019-11-14
Applicant: ZEROPOINT TECHNOLOGIES AB
Inventor: Angelos Arelakis , Vasileios Spiliopoulos , Per Stenström
IPC: G06F12/1045 , G06F3/06 , G06F12/02 , G06F12/06 , G06F12/0882
CPC classification number: G06F12/1054 , G06F3/0608 , G06F3/0656 , G06F3/0659 , G06F3/0673 , G06F12/0246 , G06F12/0646 , G06F12/0882
Abstract: A method for accessing compressed computer memory residing in physical computer memory is disclosed. In the method, compressed memory blocks are represented as sectors, wherein all sectors contain a fixed number of compressed memory blocks, have a fixed logical size in the form of the fixed number of compressed memory blocks, and have varying physical sizes in the form of the total size of data stored in the respective compressed memory blocks. The method involves providing sector-based translation metadata to keep track of the sectors within a compressed memory page, receiving a physical memory access request comprising an address in the physical computer memory, using the address in the physical memory access request to derive a memory block index, using the memory block index and the fixed logical size of the sectors to determine a sector id, using the sector-based translation metadata to locate a sector having the sector id in the compressed memory page, and using the address of the physical memory access request to locate the requested data within said sector.
-
公开(公告)号:US20220012184A1
公开(公告)日:2022-01-13
申请号:US17293584
申请日:2019-11-14
Applicant: ZEROPOINT TECHNOLOGIES AB
Inventor: Angelos Arelakis , Vasileios Spiliopoulos , Per Stenström
IPC: G06F12/1045 , G06F12/06 , G06F12/02 , G06F12/0882 , G06F3/06
Abstract: A method for accessing compressed computer memory residing in physical computer memory is disclosed. In the method, compressed memory blocks are represented as sectors, wherein all sectors contain a fixed number of compressed memory blocks, have a fixed logical size in the form of the fixed number of compressed memory blocks, and have varying physical sizes in the form of the total size of data stored in the respective compressed memory blocks. The method involves providing sector-based translation metadata to keep track of the sectors within a compressed memory page, receiving a physical memory access request comprising an address in the physical computer memory, using the address in the physical memory access request to derive a memory block index, using the memory block index and the fixed logical size of the sectors to determine a sector id, using the sector-based translation metadata to locate a sector having the sector id in the compressed memory page, and using the address of the physical memory access request to locate the requested data within said sector.
-
公开(公告)号:US10819369B2
公开(公告)日:2020-10-27
申请号:US16653610
申请日:2019-10-15
Applicant: Zeropoint Technologies AB
Inventor: Angelos Arelakis , Per Stenström
Abstract: Methods, devices and systems enhance compression and decompression of data blocks of data values by selecting the best suited compression method and device among two or a plurality of compression methods and devices, which are combined together and which said compression methods and devices compress effectively data values of particular data types; said best suited compression method and device is selected using as main selection criterion the dominating data type in a data block by predicting the data types within said data block.
-
公开(公告)号:US11922016B2
公开(公告)日:2024-03-05
申请号:US17293571
申请日:2019-11-14
Applicant: ZEROPOINT TECHNOLOGIES AB
Inventor: Chloe Alverti , Angelos Arelakis , Ioannis Nikolakopoulos , Per Stenström , Pedro Petersen Moura Trancoso
IPC: G06F3/06 , G06F12/02 , G06F12/0882
CPC classification number: G06F3/0608 , G06F3/0604 , G06F3/0659 , G06F3/0673 , G06F12/0238 , G06F12/0882
Abstract: Disclosed is a compressed memory management method for a computer system having one or more processors (P1-PN), compressible main memory, secondary memory and an operating system. The compressible main memory has a compressed memory space comprising an active part directly accessible to said one or more processors (P1-PN), as well as an inactive part not directly accessible to said one or more processors (P1-PN) in the form of memory freed up by memory compression. The compressed memory management method comprises maintaining, in an auxiliary memory, a layout of the compressed memory space of the compressible main memory, the layout including size and location of individual memory pages as well as free memory regions in said compressed memory space; triggering the compression of a memory page in the compressible main memory; intercepting a page-in request from said operating system to said secondary memory, using the layout of the compressed memory space maintained by the auxiliary memory to locate, when available, in said auxiliary memory a page requested by the page-in request, and making the located requested page available in the active part of the compressed memory space; and intercepting a page-out request from said operating system to said secondary memory, using the layout of the compressed memory space maintained by the auxiliary memory to obtain a free region for a page requested by the page-out request, and accommodating the requested page in the obtained free region of the auxiliary memory.
-
公开(公告)号:US20200044663A1
公开(公告)日:2020-02-06
申请号:US16653610
申请日:2019-10-15
Applicant: Zeropoint Technologies AB
Inventor: Angelos Arelakis , Per Stenström
Abstract: Methods, devices and systems enhance compression and decompression of data blocks of data values by selecting the best suited compression method and device among two or a plurality of compression methods and devices, which are combined together and which said compression methods and devices compress effectively data values of particular data types; said best suited compression method and device is selected using as main selection criterion the dominating data type in a data block by predicting the data types within said data block.
-
公开(公告)号:US10476520B2
公开(公告)日:2019-11-12
申请号:US15575007
申请日:2016-05-20
Applicant: Zeropoint Technologies AB
Inventor: Angelos Arelakis , Per Stenström
Abstract: Methods, devices and systems enhance compression and decompression of data blocks of data values by selecting the best suited compression method and device among two or a plurality of compression methods and devices, which are combined together and which said compression methods and devices compress effectively data values of particular data types; said best suited compression method and device is selected using as main selection criterion the dominating data type in a data block by predicting the data types within said data block.
-
9.
公开(公告)号:US20230076729A2
公开(公告)日:2023-03-09
申请号:US17421800
申请日:2020-01-09
Applicant: ZEROPOINT TECHNOLOGIES AB
Inventor: Angelos Arelakis , Per Stenström
IPC: G06F16/215 , G06F16/22 , G06F12/0804
Abstract: A computer memory compression method involves analyzing (1210) computer memory content with respect to occurrence of duplicate memory objects as well as value redundancy of data values in unique memory objects. The computer memory content is encoded (1220) by eliminating the duplicate memory objects and compressing each remaining unique memory object by exploiting data value locality of the data values thereof. Metadata (500) is provided (1230) to represent the memory objects of the encoded computer memory content. The metadata reflects eliminated duplicate memory objects, remaining unique memory objects as well as a type of compression used for compressing each remaining unique memory object. A memory object in the encoded computer memory content is located (1240) using the metadata (500).
-
10.
公开(公告)号:US20220069840A1
公开(公告)日:2022-03-03
申请号:US17415047
申请日:2019-12-23
Applicant: ZEROPOINT TECHNOLOGIES AB
Inventor: Henrik Häggebrant , Daniel Moreau , Angelos Arelakis , Per Stenström
Abstract: A decompression system (800; 1100; 1300) for decompressing a compressed data block that comprises a plurality of compressed data values is presented. The decompression system has a plurality of decompression devices (700; 1200A-B) in an array or chain layout (820a-820m−1; 120a-1120m−1; 1320a-1320m−1) for decompressing respective compressed data values of the compressed data block. A first decompression device (820a; 1120a; 1320a) is connected to a next decompression device (820b; 1120b; 1320b), and a last decompression device (820m−1; 120m−1; 1320m−1) is connected to a preceding decompression device (820m−2; 1120m−2; 320m−2). The first decompression device (820a; 1120a; 1320a) decompresses a compressed data value of the compressed data block and reduces the compressed data block by extracting a codeword of the compressed data value and removing the compressed data value from the compressed data block, retrieving a decompressed data value out of the extracted codeword, and passing the reduced compressed data block to the next decompression device (820b; 1120b; 320b). The last decompression device (820m−1; 1120m−1; 1320m−1) receives a reduced compressed data block as reduced by the preceding decompression device (820m−2; 1120m−2; 320m−2) and decompresses another compressed data value of the compressed data block by extracting a codeword of said another compressed data value, and retrieving another decompressed data value out of the extracted codeword.
-
-
-
-
-
-
-
-
-