• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.250-252
• /
• 2003

현재 무선단말기를 비롯한 많은 내장형 기기에서 자바 플랫폼을 채택하고 있다. 내장형 기기는 제공되는 메모리 용량의 제약으로 인하여 J2ME 플랫폼을 주로 사용하고 있다. J2ME 플랫폼은 CDC와 CLDC 컨피큐레이션으로 나뉘며. CDC는 JAVA 어플리케이션의 수행에 있어서 JVM보다 적은 동적 수행 메모리를 요구하는 CVM을 채택하고 있다. CDC는 CLDC에 비하여 메모리의 제약이 상대적으로 적은 셋탑박스 등과 같은 내장형 기기에서 주로 사용된다. 본 논문에서는 J2ME 플랫폼의 VM중에 하나인 CVM상에서 어플리케이션 수행에 따른 Generational GC의 특성에 대하여 알아본다. 특히 오브젝트의 life time, 가비지 컬렉션 주기 pause time 및 young generation의 크기에 따른 동작 특성을 중점적으로 고찰한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.377-384
• /
• 2017

The performance improvement of a single core processor has reached its limit since the circuit density cannot be increased any longer due to overheating. Therefore, the multicore and manycore architectures have emerged as viable approaches and parallel programming becomes more important. Haskell, a purely functional language, is getting popular in this situation since it naturally supports parallel programming owing to its beneficial features including the implicit parallelism in evaluating expressions and the monadic tools supporting parallel constructs. However, the performance of Haskell parallel programs is strongly influenced by the performance of the run-time system including the garbage collector. Though a memory profiling tool namely GC-tune has been suggested, we need a more systematic way to use this tool. Since GC-tune finds the optimal memory size by executing the target program with all the different possible GC options, the GC-tuning time takes too long. This paper suggests a basic divide-and-conquer method to reduce the number of GC-tune executions by reducing the search area by one-quarter for every searching step. Applying this method to two parallel programs, a maximally independent set and a K-means programs, the memory tuning time is reduced by 7.78 times with accuracy 98% on average.