Improving Haskell GC-Tuning Time Using Divide-and-Conquer

The present invention relates to a Haskell garbage collection (GC)-tuning technique using divide-and-conquer, which uses a divide-and-conquer method to reduce a GC-tune search area by one quarter for each step. According to the present invention, the Haskell GC-tuning technique comprises: a step of...

Full description

Saved in:
Bibliographic Details
Main Authors HWAMOK KIM, SUGWOO BYUN, JUNSEOK CHEON, GYUN WOO, YEONEO KIM, HYUNGJUN AN
Format Patent
LanguageEnglish
Korean
Published 22.05.2019
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:The present invention relates to a Haskell garbage collection (GC)-tuning technique using divide-and-conquer, which uses a divide-and-conquer method to reduce a GC-tune search area by one quarter for each step. According to the present invention, the Haskell GC-tuning technique comprises: a step of calculating -A, -H, and maximum and minimum values of an option which are available to set an initial search area, wherein two cases of a minimum value and a maximum value exists for each option and thus the total number of available combinations is four and is set as the initial search area; a step of searching for an option combination of the shortest execution time among the four combinations and reducing a search area by one quarter based on the combination; and a step of repeating such step until the search area cannot be reduced any more. 분할 정복법을 이용하여 GC-tune의 탐색 영역을 줄이는 방법을 제공한다.
Bibliography:Application Number: KR20170150340