• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.497-503
• /
• 2016

Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.524-530
• /
• 2016

The desire to access data faster and the growth of next-generation memories such as non-volatile memories, contribute to the development of research on memory file systems. It is recommended that memory mapped file I/O, which has less overhead than read-write I/O, is utilized in a high-performance memory file system. Memory mapped file I/O, however, brings a page table overhead, which becomes one of the big overheads that needs to be resolved in the entire file I/O performance. We find that same overheads occur unnecessarily, because a page table of a file is removed whenever a file is opened after being closed. To remove the duplicated overhead, we propose the mapping cache, a technique that does not delete a page table of a file but saves the page table to be reused when the mapping of the file is released. We demonstrate that mapping cache improves the performance of traditional file I/O by 2.8x and web server performance by 12%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.154-156
• /
• 2003

웹 서버의 처리 용량을 향상시키기 위한 가장 보편적인 접근방안은 서버 시스템을 중복하여 여러 개 설치하는 것이다. 하지만 이러한 물리적인 증설은 확장이 용이한 반면 비용이나 공간 등의 측면에서 큰 부작용을 동반하기 마련이다. 이와 같은 물리적인 확장 외에 운영체제 환경이나 응용 프로그램의 작은 개선에 의해서도 뜻밖의 큰 성능효과를 얻을 수 있는 경우가 있다. 이 논문에서는 이미지나 데이터 파일 등 고정된 파일을 내려 받을 때 웹 서버에서 일반 파일 대신 Memory Mapped File 입ㆍ출력을 사용한 웹 서비스 성능 향상 방법을 설계ㆍ구현하고 이를 통해서 얻어지는 이득을 실 서비스 환경에서 검증한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.511-513
• /
• 2004

MMF(Memory Mapped File)는 대응된 주소 영역을 접근함으로써 파일에 대한 입.출력 효과를 얻는 기본적인 활용 외에, 커널 영역에 버퍼를 설정하여 입.출력 성능을 향상시키거나 파일의 효율적인 공유를 위한 수단 등 다양한 방법으로 사용된다. 기본 기능 활용의 대표적인 예 중의 하나가 웹 파일 서비스이다. 이 논문에서는 웹 서비스 성능향상을 위한 연구의 일환으로 몇 가지 유닉스/리눅스 시스템을 대상으로 MMF의 기본 기능에 대한 성능을 비교.분석하였다 그 결과 시스템 별로 상당한 차이가 있다는 사실이 드러났으며, 최악의 경우에는 오히려 성능이 30% 이상 저하되는 경우가 발견되었다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.861-870
• /
• 2014

According to the intelligence of the malicious code to extract the executable file in physical memory is emerging as an import researh issue. In previous physical memory studies on executable file extraction which is targeting running files, they are not extracted as same as original file saved in disc. Therefore, we need a method that can extract files as same as original one saved in disc and also can analyze file-information loaded in physical memory. In this paper, we provide a method that executable file extraction by analyzing information of Windows kernel file object. Also we analyze the characteristic of physical memory loaded file data from the experiment and we demonstrate superiority because the suggested method can effectively extract more of original file data than the existing method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1145-1153
• /
• 2013

Android mobile platform copy the class files of all applications installed in android platform and keep them into one directory. But to add the service library into a platform, Android must generate a new binary image of platform and replace the platform because android refer the libraries using the memory-mapped file method in a directory. And this memory-mapped file reference method waste the storage space of mobile device because that directory include the duplicated libraries if the libraries refered by application are duplicated, Therefore a dynamic reconfiguration method on android mobile platform is needed to manage the service libraries of application executed on android platform and support the version management and function addition/modification. In this paper, we propose the platform dynamic reconfiguration method to add dynmically the service libraries on android platform.

• IE interfaces
• /
• v.11 no.2
• /
• pp.149-157
• /
• 1998

In this paper, various techniques considering the characteristics of computer memory management are suggested, which can be used in the implementation of simplex method. First, reduction technique of indirect addressing, redundant references of memory, and scatter/gather technique are implemented, and the effectiveness of the techniques is shown. Loop-unrolling technique, which exploits the arithmetic operation mechanism of computer, is also implemented. Second, a subroutine frequently called is written in low-level language, and the effectiveness is proved by experimental results. Third, row-column linked list and Gustavson's data structure are compared as the data structure for the large sparse matrix in LU form. Last, buffering technique and memory-mapped file which can be used in reading large data file are implemented and the effectiveness is shown.

• Spatial Information Research
• /
• v.23 no.2
• /
• pp.1-9
• /
• 2015

Graphical processing unit (GPU) contains many arithmetic logic units (ALUs). Because many ALUs can be exploited to process parallel processing, GPU provides efficient data processing. The spatial data require many geographic coordinates to represent the shape of them in a map. The coordinates are usually stored as geodetic longitude and latitude. To display a map in 2-dimensional Cartesian coordinate system, the geodetic longitude and latitude should be converted to the Universal Transverse Mercator (UTM) coordinate system. The conversion to the other coordinate system and the rendering process to represent the converted coordinates to screen use complex floating-point computations. In this paper, we propose a parallel processing technique that processes the conversion and the rendering using the GPU to improve the performance. Large spatial data is stored in the disk on files. To process the large amount of spatial data efficiently, we propose a technique that merges the spatial data files to a large file and access the file with the method of memory mapped file. We implement the proposed technique and perform the experiment with the 747,302,971 points of the TIGER/Line spatial data. The result of the experiment is that the conversion time for the coordinate systems with the GPU is 30.16 times faster than the CPU only method and the rendering time is 80.40 times faster than the CPU.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.128-131
• /
• 2004

We suggest resource authorization system based on RBAC admitting someone to access resources. In existing grid environment, The authorization mechanism on user's resource is to give users an authority on the basis of DN(Distinguished Name) of proxy certificate and map file mapped in local system ID by one-to-one. In this case, it is difficulty in resource management such as each accounting management, memory resource, and disk resource, if the number of users, who want to use them is increased. To solve this problem, we specify the role of user's task in extension fields of his proxy certificate instead of the authorization mechanism of user's ID and propose resource authorization system being able to access his resource.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.107-116
• /
• 1994

Choropleth map is a type of thematic maps in which areal units are shaded with a color or pattern that symbolizes some characteristic of the mapped unit. CMS was first developed to produce choropleth maps on ordinary microcomputer environments in 1988. Since then there have been significant technological developments and enhancements in user environments, which have affected the field of choropleth mapping systems posi¬tively. A new version of CMS was developed in accordance with these changes. CMS II requires an IBM PC, or compatible, with the minimum 640KB memory and VGA graphic board. It supports HP laser jet printers to output a high resolution map. The program can use Hangul letters for main menu, map title, and legend. And dBase file format (DEW) was implemented to exchange attribute files effectively.