公开(公告)号：GB2545068A

公开(公告)日：2017-06-07

申请号：GB201617773

申请日：2016-10-20

Applicant: IBM

Inventor： BULENT ABALI ,  SEETHARAMI SEELAM ,  CHUNG-SHENG LI ,  HUBERTUS FRANKE

IPC: G06F12/0862 ,  G06F12/0882

Abstract: A method for reducing reactivation time of services (e.g Cloud Based Services) comprises examining page faults occurring during processing of a service after the service has been inactive including analysing the address that caused the page fault, to provide a plurality of prefetch groups by logging addresses that caused page faults; formulating a prefetch decision tree from page fault data in the prefetch groups, including edges providing a probability that a page will be touched during the service request; where pages from an initial page table for the service following a reactivated service request are then compared with the prefetched pages in the resident memory in accordance with the prefetch decision tree, and pages in the page table that are not included in said prefetched pages are paged in. A process to provide to provide the service is executed using the page table. Executing the process substantially avoids page faults. Preferably, previously paged out pages are inserted in an in parameter/out parameter vector for bulk restore. Examining page faults preferably includes a reactivation time reducing system, that is switched from a non-participating mode to a learning mode by a reactivation event.

公开(公告)号：GB2544587B

公开(公告)日：2018-02-07

申请号：GB201615020

申请日：2016-09-05

Applicant: IBM

Inventor： BULENT ABALI ,  BARTHOLOMEW BLANER ,  HUBERTUS FRANKE ,  JOHN JOSEPH REILLY

IPC: H03M7/42

公开(公告)号：GB2545068B

公开(公告)日：2020-05-27

申请号：GB201617773

申请日：2016-10-20

Applicant: IBM

Inventor： BULENT ABALI ,  SEETHARAMI SEELAM ,  CHUNG-SHENG LI ,  HUBERTUS FRANKE

IPC: G06F12/0862 ,  G06F12/0882

Abstract: A method for reducing reactivation time of services that includes examining page faults that occur during processing of a service after the service has been inactive to provide a plurality of prefetch groups, and formulating a prefetch decision tree from page fault data in the prefetch groups. Pages from an initial page table for the service following a reactivated service request are then compared with the prefetched pages in the resident memory in accordance with the prefetch decision tree. Pages in the page table that are not included in said prefetched pages are paged in. A process to provide to provide the service is executed using the page table. Executing the process substantially avoids page faults.

公开(公告)号：GB2544587A

公开(公告)日：2017-05-24

申请号：GB201615020

申请日：2016-09-05

Applicant: IBM

Inventor： BULENT ABALI ,  BARTHOLOMEW BLANER ,  HUBERTUS FRANKE ,  JOHN JOSEPH REILLY

IPC: H03M7/42

Abstract: Techniques for creating a dynamic Huffman table in hardware are provided. The method includes the steps of: implementing dynamic Huffman tables in hardware representing a plurality of Huffman tree shapes pre-computed from a sample data set, wherein the Huffman tree shapes are represented in the dynamic Huffman tables by code length values; upon receipt of input data, writing symbols and their counts from the input data to the dynamic Huffman tables; calculating a score for each of the dynamic Huffman tables with the symbols and counts from the input data, wherein the score is based on the code length values of the pre-computed Huffman tree shapes and the counts from the input data; and selecting a given one of the dynamic Huffman tables having a lowest score for encoding the input data. The score may be based on a sum of products of pre-computed code length values and counts from the input data. A process for implementing the present techniques in SRAM is also provided. The use of pre-computed tables simplifies the hardware.