• Journal of Computing Science and Engineering
• /
• v.8 no.3
• /
• pp.157-172
• /
• 2014

Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the case for write references, when the read and write references are monitored separately. Based on this observation, we present a new page replacement algorithm that uses different strategies for read and write operations in predicting the re-reference likelihood of pages. For read operations, only temporal locality is used; but for write operations, both write frequency and temporal locality are used. The algorithm logically partitions the memory space into read and write areas to keep track of their reference patterns precisely, and then dynamically adjusts their size based on their reference patterns and I/O costs. Without requiring any external parameter to tune, the proposed algorithm outperforms CLOCK, CAR, and CFLRU by 20%-66%. It also supports optimized implementations for virtual memory systems.

• Publications of The Korean Astronomical Society
• /
• v.19 no.1
• /
• pp.83-92
• /
• 2004

In this paper, we introduce the development of the large storage system in order to record the observed space radio signal in the Korean VLBI Network(KVN) with high-speed. The KVN is the Very Long Baseline Interferometery(VLBI) to observe the birth of star, the structure of space by constructing radio telescope with diameter 21m at the Seoul, Ulsan, Jeju from 2001 to 2007 years. To do this, Korea Astronomy Observatory joined the international consortium for developing the high-speed large storage system(Mark 5), which is developed by MIT Haystack observatory. The Mark 5 system based on hard disk has to record up to 1 Gbps the observed space radio signal. The main features of Mark 5 system are as follows; First it is able to directly record the input data to the hard disk without PC1(Peripheral Component Interconnect) internal bus, and the second, it has two hard disk banks, which are able to hot-swap ATA/IDE type very cheap up to 1 Gbps recording and playback. The third is that it follows the international VLBI standard interface hardware(VSI-H). Therefore it can be connect directly the VSI-H type system at the input/output. Finally it also supports e- VLBI(Electronic-VLBI) through the standard Gigabits Ethernet connection.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.405-412
• /
• 2002

The embedded system has less fast CPU and lower memory than PC(personal Computer) or Workstation system. Therefore embedded operating is system is designed to efficiently use the limited resource in the system. Virtual memory management or the embedded linux have a low efficiency when page fault is occurred to get a data from I/O device. Because a data is moving from the swap device to main memory. This paper suggests virtual memory compression algorithm for improving in virtual memory management and capacity of space. In this paper, we present a way to performance implement a virtual memory compression system that achieves significant improvement for the embedded system.

• Journal of Korean Ophthalmic Optics Society
• /
• v.20 no.2
• /
• pp.167-175
• /
• 2015

Purpose: The new-type rangefinder, which is using the biprism principle, is introduced to develop the range finder which can be easily carried by soldiers, and in order to realize those technologies specifically, we try to develop a scope for military rangefinder by doing optical design which can secure enough space to move the biprism. Methods: After setting up the verious initial condition to realize two kinds of goals, that are the securement of enough space to move the biprism and the easy-exchangeability of two kinds of biprisms, and then the optical system was optimized by using optical design program CodeV in order to minimize the finite ray aberrations. Results: We designed the biprism housing to makes it possible to swap the two kinds of biprisms. It was appeared that the Schmidt prism is suitable as erecting prism which can make sure the space to move the biprism. 16.5 mm was good for the face length of Schmidt prism. The optical system with a Schmidt prism and a biprism was designed, and the finite ray aberrations was minimized. Conclusions: We developed a 5X scope for an optical rangefinder using a biprism and a Schmidt prism with 16.5 mm face length. This scope is valid for the optical system which has the effective field angle of ${\pm}3.6^{\circ}$, and the finite ray aberrations are well controlled within the ${\pm}8.95^{\prime}$.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.171-181
• /
• 2008

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.543-556
• /
• 2009

Recently, NAND flash memory is being used as the swap device of virtual memory as well as the file storage of mobile systems. Since temporal locality is dominant in page references of virtual memory, LRU and its approximated CLOCK algorithms are widely used. However, cost of a write operation in flash memory is much larger than that of a read operation, and thus a page replacement algorithm should consider this factor. This paper analyzes virtual memory read/write reference patterns individually, and observes the ranking inversion problem of temporal locality in write references which is not observed in read references. With this observation, we present a new page replacement algorithm considering write frequency as well as temporal locality in estimating write reference behaviors. This new algorithm dynamically allocates memory space to read/write operations based on their reference patterns and I/O costs. Though the algorithm has no external parameter to tune, it supports optimized implementations for virtual memory systems, and also performs 20-66% better than CLOCK, CAR, and CFLRU algorithms.

• The Journal of Korean Association of Computer Education
• /
• v.15 no.3
• /
• pp.37-47
• /
• 2012

One of the major goals in high school Informatics is for students to develop creative problem-solving abilities based on knowledge on computer science. Thus, the contents of the textbooks should be accurate and appropriate. However, we discovered that the current Informatics textbooks contain the untrue and/or inappropriate descriptions of main memory and virtual memory. The textbooks describe that main memory is composed of RAM and ROM. The virtual memory is described as a technique in which a part of the secondary storage is utilized as main memory to execute an application of which size is larger than that of main memory. In this study, we attempted to uncover the root causes of the fallacies, and suggest the accurate explanations by comparing with renowned books adopted in most schools worldwide including USA. Our study reveals that it is inappropriate to include ROM in main memory from the memory hierarchy perspective. Virtual memory is a technique that provides convenience to programmers, through which an operating system loads the necessary portion of a program from secondary storage to main memory. As for the advantages of virtual memory in the current computer systems, the focus should be on providing the effective multitasking capability, rather than on executing a larger program than the size of main memory. We suggest that it is appropriate to exclude virtual memory in textbooks considering its complexity.