• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.634-641
• /
• 2006

Flash memory has many advantages like non-volatility and fast I/O speed, but it has also disadvantages such as not-in-place-update data and asymmetric read/write/erase speed. For the performance of flash memory storage, it is essential for the buffer replacement algorithms to reduce the number of write operations that also affects the number of erase operations. A new buffer replacement algorithm is proposed in this paper, that delays the writes of not-cold-dirty pages in the buffer cache of flash storage. We show that this algorithm effectively decreases the number of write operations and erase operations without much degradation of hit ratio. As a result overall performance of flash I/O speed is improved.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.32 no.11
• /
• pp.1035-1040
• /
• 2008

Replacement period for vehicle cabin filter of most automobiles is fixed without consideration of conditions of filter and environment. Auto alarm system of replacement period at vehicle cabin filter and interception system of high concentration dust were developed. Control program which is related with the AQS has been developed based on the circuit drive algorithm. This system is expected to be beneficial to passenger's health and to extend the life of the filter which regulates vehicle HVAC system by ventilation mode change at the time of high concentration dust.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.469-480
• /
• 2008

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.25-32
• /
• 2015

The Genetic algorithm is a search algorithm using evaluation, genetic operator, natural selection to populational solution iteratively. The convergence and divergence characteristic of genetic algorithm are affected by selection strategy, generation replacement method, genetic operator when genetic algorithm is designed. This paper proposes fast convergence genetic algorithm for time-limited robot path planning. In urgent situation, genetic algorithm for robot path planning does not have enough time for computation, resulting in quality degradation of found path. Proposed genetic algorithm uses fast converging selection strategy and generation replacement method. Proposed genetic algorithm also uses not only traditional crossover and mutation operator but additional genetic operator for shortening the distance of found path. In this way, proposed genetic algorithm find reasonable path in time-limited situation.

• Smart Structures and Systems
• /
• v.25 no.2
• /
• pp.183-195
• /
• 2020

Mineral admixtures have been widely used to produce concrete. Pozzolans have been utilized as partially replacement for Portland cement or blended cement in concrete based on the materials' properties and the concrete's desired effects. Several environmental problems associated with producing cement have led to partial replacement of cement with other pozzolans. Furnace slag and fly ash are two of the pozzolans which can be appropriately used as partial replacements for cement in concrete. However, replacing cement with these materials results in significant changes in the mechanical properties of concrete, more specifically, compressive strength. This paper aims to intelligently predict the compressive strength of concretes incorporating furnace slag and fly ash as partial replacements for cement. For this purpose, a database containing 1030 data sets with nine inputs (concrete mix design and age of concrete) and one output (the compressive strength) was collected. Instead of absolute values of inputs, their proportions were used. A hybrid artificial neural network-genetic algorithm (ANN-GA) was employed as a novel approach to conducting the study. The performance of the ANN-GA model is evaluated by another artificial neural network (ANN), which was developed and tuned via a conventional backpropagation (BP) algorithm. Results showed that not only an ANN-GA model can be developed and appropriately used for the compressive strength prediction of concrete but also it can lead to superior results in comparison with an ANN-BP model.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.238-241
• /
• 2002

With the popularity of utilization of the Internet among people, the amount of data in the network rapidly increased. So that, the fall of response time from WWW server, which is caused by the network traffic and the burden on m server, has become more of an issue. This problem is encouraged the rearch by redundancy of requesting the same pages by many people, even though they browse the same the ones. To reduce these redundancy, WWW cache server is used commonly in order to store m page data and reuse them. However, the technical uses of WWW cache that different from CPU and Disk cache, is known for its difficulty of improving the cache hit rate. Consecuently, it is difficult to choose effective WWW data to be stored from all data flowing through the WWW cache server. On the other hand, there are room for improvement in commonly used cache replacement algorithms by WWW cache server. In our study, we try to realize a WWW cache server that stresses on the improvement of the stresses of response time. To this end, we propose the new cache replacement algorithm by focusing on the utilizable information of network distance from the WWW cache server to WWW server that possessing the page data of the user requesting.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.91-96
• /
• 2014

Since the sensors of Internet of Things (IOT) collect various data, the lifetime of sensor network is very important and the data should be aggregated efficiently. The contiguous collection by the certain sensors occurs an excessive battery consumption and successive transmission of same value of data should be avoided. To solve these things, we propose an weight-based cluster head replacement method that divides whole network into several grids and cluster head is selected by remaining energy, density of alive sensors and location of sensor. The aim of algorithm maximizes the lifetime of network. Our simulation results shows that the proposed method is very simple as well as balances energy consumption.

• Journal of the Korean Geotechnical Society
• /
• v.25 no.8
• /
• pp.23-32
• /
• 2009

In this study, the reliable and simple analysis method was proposed to predict the settlement characteristic of composite ground in stage of design and construction of sand compaction pile (SCP). Model parameters could be obtained by the optimization process based on genetic algorithm. In order to examine the proposed method, laboratory consolidation tests on the settlement characteristic of SCP composite ground were performed for various replacement ratio of sand such as 0 (no replacement), 20, 36, and 56%. The proposed model showed very good agreements with measured data in the relation of void ratio-log scaled stress and time-compression far each replacement ratio.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.169-176
• /
• 2017

To replace conventional DRAM, many researches have been done on nonvolatile memories. The DRAM&PCM hybrid memory is one of the effective structure because it can utilize an advantage of DRAM and PCM. However, in order to use this characteristics, pages can be replaced frequently between DRAM and PCM. Therefore, PCM still has major problem that has write-limits. Therefore, it needs an effective page management method for exploiting each memory characteristics dynamically and adaptively. So we aim reducing an average access time and write count of PCM by utilizing two locality for an effective page replacement. We proposed a page selection algorithm which is recently requested to write in DRAM and an algorithm witch uses two locality in PCM. According to our simulation, the proposed algorithm for the DRAM&PCM hybrid can reduce the PCM write count by around 22% and the average access time by 31% given the same PCM size, compared with CLOCK-DWF algorithm.