• ETRI Journal
• /
• v.30 no.6
• /
• pp.790-798
• /
• 2008

Recently, NAND flash memory has emerged as a next generation storage device because it has several advantages, such as low power consumption, shock resistance, and so on. However, it is necessary to use a flash translation layer (FTL) to intermediate between NAND flash memory and conventional file systems because of the unique hardware characteristics of flash memory. This paper proposes a new clustered FTL (CFTL) that uses clustered hash tables and a two-level software cache technique. The CFTL can anticipate consecutive addresses from the host because the clustered hash table uses the locality of reference in a large address space. It also adaptively switches logical addresses to physical addresses in the flash memory by using block mapping, page mapping, and a two-level software cache technique. Furthermore, anticipatory I/O management using continuity counters and a prefetch scheme enables fast address translation. Experimental results show that the proposed address translation mechanism for CFTL provides better performance in address translation and memory space usage than the well-known NAND FTL (NFTL) and adaptive FTL (AFTL).

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1199-1203
• /
• 2010

Data transfer between host system and storage device is based on the data unit called sector, which can be varied depending on computer systems. If NAND flash memory is used as a storage device, the variant sector size can affect storage system performance since its operation is much related to sector size and page size. In this paper, we propose an efficient FTL mapping management scheme to support multiple sector size within one NAND flash memory based storage device, and analyze the performance effect and management overhead. According to the proposed scheme, the management overhead of proposed FTL management is lower than conventional scheme when various sector sizes are configured in computer systems, while performance is less degraded in comparison with single sector size support system.

• The Journal of Society for e-Business Studies
• /
• v.18 no.3
• /
• pp.143-158
• /
• 2013

HTML5, new standard for web language, is being standardized corresponding to the development of web. Since several new semantic elements have been added into HTML5 standard, current Web Environment is becoming more and more semantic. In order to provide better user experience by using information extraction from HTML5 page, new HTML5 Elements should be mapped to a corresponding Ontology. In this research, we will focus on new semantic elements to build Ontology from HTML5 document. For this purpose, we will propose a methodology of Schema level mapping rule and instance mapping rule.

• Microbiology and Biotechnology Letters
• /
• v.23 no.2
• /
• pp.145-149
• /
• 1995

For the purpose of developing a new biodegradable detergent, we have isolated a gene encoding wide-range temperature applicable alkaline protease from Xanthomonas sp. YL-37 (Lee et al., 1994, Kor. J. Appl. Microbiol. Biotechnol.). An alkaline protease gene was isolated from the gene bank that was prepared from the chromosomal DNA of Xanthomonas sp. YL-37. From the results of agarose gel electrophoresis and a restriction enzyme mapping, a 2.7 kb DNA fragment containing the alkaline protease gene was inserted in the plasmid pUC9. Extracellular activity of a clone having alkaline protease gene was detected on SDS-polyacrylamide gel with activity staining assay. The molecular weight of alkaline protease was determined to be about 64 kDa from 11% SDS-PAGE analysis. Alkaline protease activity, produced from E. coli which harboring the plasmid, showed no difference at reaction temperature 20, 30 and 40$\circ$C, respectively. This result showed that alkaline protease produced from E. coli harboring the plasmid was apparently the same as that of Xanthomonas sp. YL-37.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.1-7
• /
• 2016

In this paper, we propose in this paper present a novel locality data allocation policy as COLD(Correlated Locality Data) allocation policy. COLD is defined as a set of data that will be updated together later. By distributing a COLD into a NAND block separately, it can preserve th locality. In addition, by handling multiple COLD simultaneously, it can obtain the parallelism among NAND chips. We perform two experiment to demonstrate the effectiveness of the COLD data allocation policy. First, we implement COLD detector, and then, analyze a well-known workload. And we confirm the amount of COLD found depending on the size of data constituting the COLD. Secondly, we compared the traditional page-level mapping policy and COLD for garbage collection overhead in actual development board Cosmos OpenSSD. Experimental results have shown that COLD data allocation policy is significantly reduces the garbage collection overhead. Also, we confirmed that garbage collection overhead vary depending on the COLD size.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.70-74
• /
• 2001

A general web-based remote lecture system uses video data and audio data to provide synchronize between teacher and students. This system requires high bandwidth, high speed networking, television, compression and computing technologies between server and client for remote lecture over Internet. As a result, this system can decrease an efficiency for lecturing over current Internet. So, this paper proposes a new mechanism calling as ‘Synchronization of WWW browsers between server and client’to cope with above problems and finally pursues low cost needed for real-time remote lecture over Internet. The mechanism means that every browser of teacher and students displays the same page and the action of teacher is transferred to the browser of student. And, this can be implemented by Windows hooking APIs, Memory Mapping, and DLL (Dynamic Link Library) programming technology. This paper points to the design and implementation of LAS (Lecture Assistant Server) and LAC (Lecture Assistant Client) to perform the synchronization between server and client.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.864-867
• /
• 2008

본 논문에서는 플래시 메모리를 효율적으로 관리하기 위하여 페이지 수준 주소 변환과 블록 수준 주소 변환을 선택적으로 적용하는 기법을 제시한다. 페이지 수준 변환을 사용하는 기존 FTL은 대용량의 주소 관리 정보를 플래시 메모리에 저장하여 성능과 사용측면에서 여러 문제점이 있다. 제안된 기법은 일부의 블록만 페이지 수준 주소 변환을 사용하고 나머지 블록은 블록 수준 주소변환을 이용하여 주소 관리 정보에 필요한 메모리 공간을 기존의 20% 수준으로 줄인 동시에 성능을 약 28%향상시켰다.

• Korean Journal of Microbiology
• /
• v.38 no.2
• /
• pp.74-80
• /
• 2002

The purpose of this work was to investigate the characterization and sequence of catechol 1,2-dioxygenase (Cl,2O) purified from Acinetobacter sp. KS-1 which was grown on benzoate as a sole carbon source. Cl,2O demonstrated its enzyme activity to catechol and 4-methylcatechol. The optimum temperature of Cl,2O was $35^{\circ}C$, and the optimal pH was in the range from pH 7.5 to 9.0. $Ag^{+}$, $Hg^{+}$, and $Cu^{2+}$ showed inhibitory effect on the activity of Cl,2O. Molecular weight of the enzyme was determined to approximately 36 kDa by SDS-PAGE and 7-terminal amino acid sequence of Cl,2O was analyzed as $^{1}MNYQQIDALVKQMNVDTAKG^{20}$and exhibited 95% sequence homology with that of Cl,2O from Acinetobacter radioresistens In addition, trypsin digestion and peptide mapping were performed for internal sequencing analysis. Molecular weights of three digested peptide fragments were analyzed as 966.3 Da, 1933.8 Da and 2081.7 Da by MALDI-TOF, which were matched with each internal sequences $^{1}SQSDFNLRR^{9}\, ^{1}HGNRPSHVHYFNSAPGYR^{18}\, ^{1}TIEGPLYVAGAPESVGFAR^{19}$) of. A. radioresistens. PCR product was amplified with the degenerated primers derived from N-terminal and each internal amino acid sequences.

• Journal of Digital Contents Society
• /
• v.14 no.2
• /
• pp.247-254
• /
• 2013

Storage Class Memory(SCM), such as PRAM, FRAM and MRAM, are expected to be comparable to DRAM in terms of access speed and to Flash memory in terms of capacity in a near future. In this paper, assuming that not only the secondary storage (HDD or Flash memory) but also the primary memory (DRAM) will be replaced by SCM in the future computer systems, we propose an efficient file access framework for the SCM based computer systems. The proposed framework do not assign exclusive area in the SCM to the file system and uses various memory-related techniques, such as unified data access path, zero-copy data read using file mapping, copy-on-write, and multiple page pre-faulting for file management. Based on the preliminary experimental results, we could conclude that the proposed framework can be an efficient baseline for designing a new operating system for the SCM based computer systems.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.205-214
• /
• 2011

Client based web mashups have become one of the most important architecture in web application development. Although there are well known methods to generate presentation view codes for web services, navigations between views and service requests are still developed manually in most web mashups. In this paper, we propose the concept of deterministic data binding from output data to input parameters of another method. Using binding relations, we can model navigation menus for service method requests. For a given set of data mappings between services, we investigate context dependent binding conditions and discuss the generation of views and navigation menus. The proposed approach provides UI for users to navigate services of client mashup page using simple and convenient interface even when the number of services and the size of the mashup page grows. In order to show the usability of the proposed approach, we present a historic tourism service.