• Journal of the Korean earth science society
• /
• v.27 no.1
• /
• pp.95-117
• /
• 2006

From the Tertiary Yeonil Group distributed in Songra and Cheongha areas, the northern part of the Pohang Basin, nine archaeomonad species belonging to two genera, and other three types of chryophycean cysts considered as stomatocysts, five endoskeletal dinoflagellate species belonging to three genera and eighteen ebridian species belonging to eleven genera were identified. Based on above siliceous microfossil assemblages, the Yeonil Group is corresponded to Middle Miocene age. The group is correlated with the Calvert Formation (Maryland in USA) and the Hojuji Formation (in Central Japan) by its archaeomonad cysts. And, the group is correlated with the intervals of Actiniscus elongatus to Middle Hermesinella conata zones in Southwest Pacific region and of Spongebria miocenica to Middle Hermesineila schulzii zones in $V{\o}ring$ Plateau, Norwegian Sea, based on the ebridian assemblages of the group. From the chrysophycean cyst including archaeomonad, endoskeletal dinoflagellate and ebridian assemblages in the Yeonil Group of the study area, it is inferred that cold water masses dominated during the deposition oi the group with occasional warm water. The upper part of the group might be somewhat colder than the lower one of the group in depositional condition. In addition, minute chrysopycean cysts considered as stomatocysts suggest the influence of fresh or brackish water during the deposition of the group.

• Korean Institute of Interior Design Journal
• /
• no.34
• /
• pp.106-113
• /
• 2002

Certosa, a representative Monastic Architecture of Renaissance era, has been well preserved. And it has worked as a symbol of the space form & style revealed by monad, sell, arcade and court, which are characteristic of a monastery. A court is divided into large court and small one, and it connects each units and each sells through the annex with clarifying each space identities. And arcade and pillar is not only to derive a unitary space from entire space, but also to try openness and extension applying a different height in spite of physical closure of style. Especially planned by monad and cell, the routine space of monks, a structure of rational space is a yardstick of moderation and frugality, showing affluent space which occupy essential areas without extra space. And the space appears self-sufficiency, honest poverty, and affluence with order and eternity based on elementary principles of the Cartusio order in composition and plan of the space. Keeping strong linking with entire sells in the monastery, Each sell symbolizes entire sells, and the inverse is the same. And it is the universe advocating eternity and it is also a small city which provides the monks with accurate modules and scales in the very recluse space.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.2
• /
• pp.1-9
• /
• 2021

In this paper, we extend a generic library framework based on the state monad to exploit deterministic parallelism in a purely functional language Haskell and provide benchmarks for the extended features on a multicore machine. Although purely functional programs are known to be well-suited to exploit parallelism, unintended squential data dependencies could prohibit effective parallelism. Symbolic execution programs usually implement fresh name generation in order to prevent confusion between variables in different scope with the same name. Such implementations are often based on squential state management, working against parallelism. We provide reusable primitives to help developing parallel symbolic execution programs with unbound-genercis, a generic name-binding library for Haskell, avoiding sequential dependencies in fresh name generation. Our parallel extension does not modify the internal implementation of the unbound-generics library, having zero possibility of degrading existing serial implementations of symbolic execution based on unbound-genecrics. Therefore, our extension can be applied only to the parts of source code that need parallel speedup.

• 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.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.459-465
• /
• 2017

Although the performance of computer hardware is increasing due to the development of manycore technologies, software lacking a proportional increase in throughput. Functional languages can be a viable alternative to improve the performance of parallel programs since such languages have an inherent parallelism in evaluating pure expressions without side-effects. Specifically, Haskell is notably popular for parallel programming because it provides easy-to-use parallel constructs based on monads. However, the scalability of parallel programs in Haskell tends to fluctuate as the number of cores increases, and the garbage collector is suspected to be the source of this fluctuations because it affects both the space and the time needed to execute the programs. This paper uses the tuning tool, GC-Tune, to improve the scalability of the performance. Our experiment was conducted with a parallel plagiarism detection program, and the scalability improved. Specifically, the fluctuation range of the speedup was narrowed down by 39% compared to the original execution of the program without any tuning.