• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.215-225
• /
• 2010

The NAND flash memory based SSDs are considered to replace the existing HDDs. To maximize the I/O performance, SSD is composed of several NAND flash memories in parallel. However, to adopt the hybrid mapping scheme in SSD may cause degradation of the I/O performance. In this paper, we propose a new mapping scheme for the SSD called WADPM. WADPM loads only necessary mapping information into RAM and dynamically adjusts the size of mapping information in the RAM. So, WADPM avoids the shortcoming of page-level mapping scheme that requires too large mapping table. Performance evaluation using simulations shows that I/O performance of WADPM is 3.5 times better than the hybrid-mapping scheme and maximum size of mapping table of WADPM is about 50% in comparison with the page-level mapping scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.119-122
• /
• 2003

본 논문에서는 분산메모리 멀티프로세서 시스템에서 태스크와 프로세서 노드간의 매핑에 관한 최적화 문제를 메타휴리스틱스(metatheuristics)의 장점을 효과적으로 결합한 새로운 방안을 소개한다. 태스크-프로세서 할당에 있어 부하균형을 고려한 MFA-GA 하이브리드 알고리즘을 제안하고 기존의 할당 방안들과 성능실험을 통해 비교 분석한다. 우리의 합성 휴리스틱을 이용하면 각 방법을 단독으로 사용하는 것 보다 매핑 품질과 수행시간 면에서 개선된 성능결과를 얻을 수 있음을 보여주었다.

• Spatial Information Research
• /
• v.19 no.4
• /
• pp.45-54
• /
• 2011

In this paper, we propose a hybrid index structure, called the SQMR-tree(Spatial Quad MR-tree) that can process spatial data efficiently by combining advantages of the MR-tree and the SQR-tree. The MR-tree is an extended R-tree using a mapping tree to access directly to leaf nodes of the R-tree and the SQR-tree is a combination of the SQ-tree(Spatial Quad-tree) which is an extended Quad-tree to process spatial objects with non-zero area and the R-tree which actually stores spatial objects and are associated with each leaf node of the SQ-tree. The SQMR-tree consists of the SQR-tree as the base structure and the mapping trees associated with each R-tree of the SQR-tree. Therefore, because spatial objects are distributedly inserted into several R-trees and only R-trees intersected with the query area are accessed to process spatial queries like the SQR-tree, the query processing cost of the SQMR-tree can be reduced. Moreover, the search performance of the SQMR-tree is improved by using the mapping trees to access directly to leaf nodes of the R-tree without tree traversal like the MR-tree. Finally, we proved superiority of the SQMR-tree through experiments.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.114-129
• /
• 2006

Ontology mapping is the task of finding semantic correspondences between two ontologies. In order to improve the effectiveness of ontology mapping, we need to consider the characteristics and constraints of data models used for implementing ontologies. Earlier research on ontology mapping, however, has proven to be inefficient because the approach should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. In this paper, we propose a multi-strategic mapping approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the topic maps. Our multi-strategic mapping approach includes a topic name-based mapping, a topic property-based mapping, a hierarchy-based mapping, and an association-based mapping approach. And it also uses a hybrid method in which a combined similarity is derived from the results of individual mapping approaches. In addition, we don't need to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the topic maps. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Yahoo german literature dictionary as input ontologies. Our experiments show that the automatically generated mapping results conform to the outputs generated manually by domain experts, which is very promising for further work.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.131-139
• /
• 2013

To overcome the limitations in performance and power consumption of traditional electrical interconnection based network-on-chips (NoCs), a hybrid optical network-on-chip (HONoC) architecture using optical interconnects is emerging. However, the HONoC architecture should use circuit-switching scheme owing to the overhead by optical devices, which worsens the latency unfairness problem caused by frequent path collisions. This resultingly exert a bad influence in overall performance of the system. In this paper, we propose a new task mapping algorithm for optimizing latency by reducing path collisions. The proposed algorithm allocates a task to a certain processing element (PE) for the purpose of minimizing path collisions and worst case latencies. Compared to the random mapping technique and the bandwidth-constrained mapping technique, simulation results show the reduction in latency by 43% and 61% in average for each $4{\times}4$ and $8{\times}8$ mesh topology, respectively.

• Composites Research
• /
• v.35 no.3
• /
• pp.188-195
• /
• 2022

This paper proposes a multiscale process-structural analysis methodology and applies to a battery housing part made of the short fiber-reinforced and fabric-reinforced composite layers. In particular, uncertainties of the material properties within the microscale representative volume element (RVE) were considered. The random spatial distribution of matrix properties in the microscale RVE was realized by the Karhunen-Loeve Expansion (KLE) method. Then, effective properties of the RVE reflecting on spatially varying matrix properties were obtained by the computational homogenization and mapped to a macroscale FE (finite element) model. Morever, through the hybrid process simulation, a FE (finite element) model mapping residual stress and fiber orientation from compression molding simulation is combined with one mapping fiber orientation from the draping process simulation. The proposed method is expected to rigorously evaluate the design requirements of the battery housing part and composite materials having various material configurations.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.23-30
• /
• 2010

Flash memory is non-volatile and can retain data even after system is powered off. Besides, it has many other features such as fast access speed, low power consumption, attractive shock resistance, small size, and light-weight. As its price decreases and capacity increases, the flash memory is expected to be widely used in consumer electronics, embedded systems, and mobile devices. Flash storage systems generally adopt a software layer, called FTL. In this research, we proposed a new FTL mechanism for overcoming the major drawback of conventional block mapping algorithm. In addition to the block mapping table, a index block mapping table with a small size is used to indicate sector location. The proposed indexed block mapping algorithm by adding a small size. By the simulation result, the proposed FTL provides an enhanced speed than a conventional hybrid mapping algorithm by around 45% in average, and the requirement of mapping memory is also reduced by around 12%.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.105-105
• /
• 2019

보나 여수로와 같은 수공구조물의 주변에서 발생하는 흐름 거동은 구조물 모서리에서 발생하는 흐름분리(flow separation)와 이에 따른 전단층(shear layer)과 재순환(recirculation) 흐름 영역의 발달 그리고 분리된 흐름의 재부착(reattachment)이 특징이다. 공학적으로 난류의 해석에 있어서 이러한 흐름 거동들을 정확하게 예측하는 것은 수공구조물 설계에 있어서 중요하다. 이 연구에서는 흐름 분리와 재순환 영역의 발달 그리고 흐름 재부착을 포함하는 후방계단(backward-facing step) 흐름을 155,000의 레이놀즈수 조건에서 하이브리드 RANS/LES 모델을 적용하여 해석결과를 평가한다. 하이브리드 모델로는 벽에 인접한 격자의 해상도에 상대적으로 민감하지 않은 SST(shear-stress transport) 난류 모델을 이용하는 DES(detached-eddy simulation) 기법을 적용하였다. 계단 높이가 h인 계산영역은 흐름방향 길이가 34h, 높이는 계단 상류와 하류에서 각각 1h와 2h 그리고 폭은 $2{\pi}$이다. 계단은 상류단으로부터 10h 하류부 지점에 위치한다. 경계조건으로 상부와 하부 벽면에 대해서는 비활조건을 적용한다. 상류부 수로에서 완전 발달한 흐름을 재현하기 위해서 유입경계조건은 유입부 하류 $2{\pi}h$ 지점에서 계산된 유속과 난류량을 매핑(mapping)기법을 이용하여 반복적으로 적용한다. 총 3.1백만개와 7.3백만개의 셀로 계산영역을 구현한 두 개의 계산격자 그리고 약 3.1백만개의 셀을 이용했지만 벽면 근처에서의 격자 구성을 다른 방식으로 설정한 두 가지 격자를 이용하여 격자 해상도가 DES 수치해석 결과에 미치는 영향을 분석하였다. 수치해석결과는 본 연구에서 상류단 조건으로 적용한 매핑기법이 대상 수로에서 완전 발달한 흐름을 잘 재현함을 보여주며, 합리적인 DES 해석 결과를 얻기 위해서는 벽에 수직한 방향으로 적절한 격자의 해상도와 분포가 필요함을 보여준다.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.4
• /
• pp.203-220
• /
• 2015

This study was to suggest the creation of hybrid bibliographic records in complicated bibliographic environment applying both AACR2 and RDA for uniform display and correct search. The literature reviews and case studies were used as the research methods. In case studies, Kent State University, University of Houston as the libraries, and Backstage Library Works as algorithm converting to hybrid records were surveyed. For creating the hybrid records, it was needed to differentiate hybrid records and born RDA records, to keep the data that appeared in 250 tag without spelling out edition data, to maintain 260 tag instead of converting 260 tag to 264 tag, and last to design mapping table for converting GMD to CMC. This study would suggest uniform display and search through hybridization of bibliographic records of foreign resources.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.771-772
• /
• 2009

최근 대표적인 공간 인덱스 구조인 R-tree를 기반으로 KD-tree나 Quad-tree와 같은 공간 분할 특성을 이용하여 인덱싱 성능을 향상시키기 위한 연구가 활발하다. 본 논문에서는 기존에 제시된 R-tree 기반 인덱스 구조인 SQR-tree와 PMR-tree의 특성을 결합하여 대용량 공간 데이타를 보다 효율적으로 처리하는 인덱스 구조인 MSQR-tree(Mapping-based SQR-tree)를 제시한다. SQR-tree는 Quad-tree를 확장한 SQ-tree와 각 SQ-tree 리프 노드마다 실제로 공간 객체를 저장하는 R-tree가 연계되어 있는 인덱스 구조이고, PMR-tree는 R-tree에 R-tree 리프 노드를 직접 접근할 수 있는 매핑 트리를 적용한 인덱스 구조이다. 본 논문에서 제시하는 MSQR-tree는 SQR-tree를 기본 구조로 가지고 R-tree마다 매핑 트리가 적용된 구조를 갖는다. 따라서, MSQR-tree에서는 SQR-tree와 같이 질의가 여러 R-tree에서 분산 처리되고, PMR-tree와 같이 매핑 트리를 통해 R-tree 리프 노드를 빠르게 접근할 수 있다. 마지막으로 성능 실험을 통해 MSQR-tree의 우수성을 입증하였다.