• Journal of Biosystems Engineering
• /
• v.27 no.3
• /
• pp.203-210
• /
• 2002

In this study, the leveling control system for a tractor has been developed. The experimental model showed that the implementation of the proposed hydraulic control system fur the prototype design of a slope land tractor was feasible. The front axle was designed as a center pin type and the rear axle was designed as a trailing arm type. The leveling control of the body on the slope land was accomplished by controlling the height of the right and left trailing arms using the electronic controlled hydraulic cylinder. The maximum leveling control angles were ${\pm}$15$^{\circ}$ for roll angle and 7$^{\circ}$far pitch angle. The front and rear wheel drives were transmitted by gears from the main shaft to the final drive. The adaptability of the hydraulic control system was tested and investigated by analyzing the system response in time and frequency domain. The hydraulic control system on a step input showed a linearly increasing trend without any overshoot state. The hydraulic control system on a frequency input showed a little phase differences and gain drops within the range of 0.3Hz.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.1-8
• /
• 2015

Wear leveling techniques have been studied to prolong the lifetime of NAND flash memory. Most of studies have used Program/Erase(P/E) cycles as wear index for wear leveling. Unfortunately, P/E cycles could not predict the real lifetime of NAND flash blocks. Therefore, these algorithms have the limited performance from prolonging the lifetime when applied to the SSD. In order to apply the real lifetime, wear leveling algorithms, which use raw Bit Error Rate(rBER) as wear index, have been studied in recent years. In this paper, we propose CrEWL(Cold data identification using raw Bit error rate in Wear Leveling), which uses rBER as wear index to apply to the real lifetime. The proposed wear leveling reduces an overhead of garbage collections by using HBSQ(Hot Block Sequence Queue) which identifies hot data. In order to reduce overhead of wear leveling, CrEWL does not perform wear leveling until rBER of the some blocks reaches a threshold value. We evaluate CrEWL in comparison with the previous studies under the traces having the different Hot/Cold rate, and the experimental results show that our wear leveling technique can reduce the overhead up to 41% and prolong the lifetime up to 72% compared with previous wear leveling techniques.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.5
• /
• pp.1-9
• /
• 2017

Recently, flash memory has been in a great demand from embedded system sectors for storage devices. However, program/erase (P/E) cycles per block are limited on flash memory. For the limited number of P/E cycles, many wear leveling techniques are studied. They prolonged the life time of flash memory using information tables. As one of the techniques, block erase table (BET) method using a bit array table was studied for embedded devices. However, it has a disadvantage in that performance of wear leveling is sharply low, when the consumption of memory is reduced. To solve this problem, we propose a novel wear leveling technique using Sampling-based Block Erase Table (SBET). SBET relates one bit of the bit array table to each block by using exclusive OR operation with round robin function. Accordingly, SBET enhances accuracy of cold block information and can prevent to decrease the performance of wear leveling. In our experiment, SBET prolongs life time of flash memory by up to 88%, compared with previous techniques which use a bit array table.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.175-178
• /
• 2008

While read operation on flash memory is fast and doesn't have any constraints, flash memory can not be overwritten on updating data, new data are updated in new area. If data are frequently updated, garbage collection, which is achieved by erasing blocks, should be performed to reclaim new area. Hence, because the number of erase operations is limited due to characteristics of flash memory, every block should be evenly written and erased. However, if data with access locality are processed by cost benefit algorithm with separation of hot block and cold block, though the performance of processing is high, wear-leveling is not even. In this paper, we propose CB-MG (Cost Benefit between Multi Group) algorithm in which hot data are allocated in one group and cold data in another group, and in which role of hot group and cold group is exchanged every period. Experimental results show that performance and wear-leveling of CB-MG provide better results than those of CB-S.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.108-114
• /
• 2008

Since flash memory cannot be overwritten, new data are updated in new area. If data are frequently updated, garbage collection which is achieved by erasing blocks, should be performed to reclaim new area. Hence, because the count of erase operations is limited due to characteristics of flash memory, every block should be evenly written and erased. However, if data with access locality are processed by cost benefit algorithm with separation of hot block ad cold block though the performance of processing is hight wear-leveling is not even. In this paper, we propose CB-MB (Cost Benefit between Multi Bank) algorithm in which hot data are allocated in one bank and cold data in another bank, and in which role of hot bank and cold bank is exchanged every period. CB-MB shows that its performance is 30% better than cost benefit algorithm with separation of cold block and hot block its wear-leveling is about a third of that in standard deviation.

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

Magnetic disks have been used for decades in auxiliary storage devices of computer systems. In recent years, the use of NAND flash memory, which is called SSD, is increased as auxiliary storage devices. However, NAND flash memory, unlike traditional magnetic disks, necessarily performs the erase operation before the write operation in order to overwrite data and this leads to degrade the system lifetime and performance of overall NAND flash memory system. Moreover, NAND flash memory has the lower endurance, compared to traditional magnetic disks. To overcome this problem, this paper proposes EPET (Enhanced Prediction and Elapsed Time) wear leveling technique, which is especially efficient to portable devices. EPET wear leveling uses the advantage of PET (Prediction of Elapsed Time) wear leveling and solves long-term system failure time problem. Moreover, EPET wear leveling further improves space efficiency. In our experiments, EPET wear leveling prolonged the first bad time up to 328.9% and prolonged the system lifetime up to 305.9%, compared to other techniques.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.1-8
• /
• 2015

Flash memory has advantages in that it is fast access speed, low-power, and low-price. Therefore, they are widely used in electronics industry sectors. However, the flash memory has weak points, which are the limited number of erase operations and non-in-place update problem. To overcome the limited number of erase operations, many wear leveling techniques are studied. They use many tables storing information such as erase count of blocks, hot and cold block indicators, reference count of pages, and so on. These tables occupy some space of main memory for the wear leveling techniques. Accordingly, they are not appropriate for low-power devices limited main memory. In order to resolve it, a wear leveling technique using bit array and Bit Set Threshold (BST) for flash memory. The proposing technique reduces the used space of main memory using a bit array table, which saves the history of block erase operations. To enhance accuracy of cold block information, we use BST, which is calculated by using the number of invalid pages of the blocks in a one-to-many mode, where one bit is related to many blocks. The performance results illustrate that the proposed wear leveling technique improve life time of flash memory to about 6%, compared with previous wear leveling techniques using a bit array table in our experiment.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11c
• /
• pp.684-689
• /
• 2000

In harvesting rice and barley using combine, the inclination of the body caused by the irregular surface condition of the field and the soil sinking from the unbalanced weight during the grain collection used to make harvesting operation difficult and even impossible. To overcome such a problem, automatic leveling control system for a combine has been developed and tested. The system was composed of the sensor for measuring left and right inclination of the combine chassis and the hydraulic control system. The adaptability of the control system was investigated by analyzing system response in time domain. And the limit angle of the leveling control was set up to be +/- 7$^{\circ}$. The proposed control and hydraulic power system was implemented to the prototype combine. The prototype combine was designed and built as a separable structure with chassis and track. This paper shows results of the leveling performance tested in the laboratory and the grain field.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.558-563
• /
• 2005

This paper presents a GA-based optimal algorithm for a resource leveling model that levels the resources of a set of non-critical activities experiencing conflicts simultaneously up to an assumed level of resource rates specified by the planner using a pair-wise comparison of the activities being considered. A parameter called the future float is adopted and applied as an indicator for assigning leveling priorities to the sets of activities experiencing conflicts. A construction project network example was worked out to demonstrate the performance of the proposed method. The histogram obtained using the algorithm proposed was shown to be the same as, or very close to that produced by the existing resource leveling method based on the least total float rule, which shifts non-critical activities individually.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4595-4600
• /
• 2014

A geoid has great meaning as a vertical reference plane, and at this point when GPS measurement is vitalized, it is an important factor that makes level measurements with GPS possible. This study carried out GPS and leveling of newly created complex control points targeting Daejeon. The geoid for the precise area was built by calculating the plane location, elevation and the geoid of each reference point using GPS/Leveling. In addition, this study evaluated the potential of GPS leveling throughout the site calibration. The geoid for the precise area intervals of approximately 1.5km throughout the study was determined. The results highlight the possibility of leveling by estimating direct leveling performance and mean altitude deviation by less than 2cm. Based on the results, if a geoid model for the precise and wide area can be developed throughout ongoing research, survey tasks that require elevation can be streamlined and the efficiency maximized.