• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.315-320
• /
• 2009

Since flash memory can not be overwritten on updating data, new data are updated in new area and old data should be invalidated and erased for garbage collection. With develop of flash memory technology, capacity of flash memory is rapidly increasing. It increases rapidly execution time of CPU to search an entire flash memory of large capacity when choosing the block to erase in garbage collection. To solve the problem that is increasing execution time of CPU, flash memory is partitioned into several groups, the block to erase in garbage collection is searched within the corresponding group. In workload of access locality, we enhanced wear-leveling within group by allocating hot data to hot group and cold data to cold group respectively and enhanced wear-leveling among groups by exchanging periodically hot group and cold group.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.51-57
• /
• 2013

Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.12
• /
• pp.419-428
• /
• 2022

Since in-place updates for pages are not allowed in flash memory, all new page writes should be written in an out-of-place manner. The old overwritten pages are invalidated. Such invalidated pages eventually trigger the costly garbage collection process. Since the garbage collection causes numerous read and write operations, it is one of the flash memory's major performance issues. In 2R, it modified the garbage collection algorithm, which applies the I/O characteristics of the On-Line Transaction Process workload to improve the Write Amplification Factor. However, this algorithm has a region pollution problem. Therefore, in this paper, we developed 2R++ that additionally separates pages with long access intervals to solve the region pollution problem. 2R++ introduces an extra bit per block to separate warm pages based on a second chance mechanism. Prevents warm pages from being misidentified as cold pages to solve region pollution problem. We conducted the experiments on TPC-C and Linkbench to make the performance comparison. The experiment showed that 2R++ achieved a Write Amplification Factor improvement of 57.8% and 13.8% compared to 2R, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.793-795
• /
• 2005

플래시 메모리는 PDA 등과 같은 모바일 장치에 많이 사용되는 저장 매체이다. 이 매체는 덮어 쓰기가 불가능하다는 특징으로 인해 흔히 JFFS2와 같은 전용 파일 시스템을 사용하게 된다. 현재의 JFFS2 파일 시스템은 Garbage Collection 시 많은 자원과 시간을 소비하는 문제점을 가지고 있다. 본 논문에서는 JFFS2 Garbage Collector에서 유효한 노드에 대한 다시 쓰기 작업을 개선한 새로운 Garbage Collector를 설계하였고, 이에 대한 성능 평가를 수행하였다.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.147-156
• /
• 2015

A typical solid-state drive contains several independent channels that can be operated in parallel. To exploit this channel-level parallelism, a variety of works proposed to split consecutive write sequences into small segments and schedule them to different channels. This scheme exploits the parallelism but breaks the spatial locality of write traffic; thus, it is able to significantly degrade the efficiency of garbage collection. This paper proposes a channel-aware write reordering (CAWR) mechanism to schedule write requests to different channels more intelligently. The novel mechanism encapsulates correlated pages into a cluster beforehand. All pages belonging to a cluster are scheduled to the same channels to exploit spatial locality, while different clusters are scheduled to different channels to exploit the parallelism. As CAWR covers both garbage collection and I/O performance, it outperforms existing schemes significantly. Trace-driven simulation results demonstrate that the CAWR mechanism reduces the average response time by 26% on average and decreases the valid page copies by 10% on average, while achieving a similar hit ratio to that of existing mechanisms.

• Proceedings of KOSOMES biannual meeting
• /
• 2007.11a
• /
• pp.91-95
• /
• 2007

It tries to develop a collect system for floating garbage flowed into the sea Based on the study on the characteristics of floating garbage in rainy season, it confirmed the structure and specification of each device and tested its performance on the sea It showed tint the collection device of this system could sweep more than 15 meters of sea area at a time when a ship moves with the efficiency of the spreading device. It means tint it is more efficient in collecting garbage than now in use garbage collecting ships. The water height of the net to which the garbage is finally input maintained more 50cm within the towing speed of 5kt. It indicates tint the garbage input performance is good The collect system of this research showed good performance collecting 200kg of garbage into the net for each test of collecting floating garbage.

• Journal of KIISE:Software and Applications
• /
• v.27 no.7
• /
• pp.759-768
• /
• 2000

The ZG-machine is a space-efficient G-machine, which exploits a simple encoding method, called tag-forwarding, to compress the heap structure of graphs. Experiments on the ZG-machine without garbage collection shows that the ZG-machine saves 30% of heap space and the run-time overhead is no more than 6% than the G-machine. This paper presents the results of further experiments on the ZG-machine with the garbage collector. As a result, the heap-residency of the ZG-machine decreases by 34% on average although the run-time increases by 34% compared to the G-machine. The high rate of the run-time overhead of the ZG-machine is incurred by the garbage collector. However, when the heap size is 7 times the heap-residency, the run-time overhead of the ZG-machine is no more than 12% compared to the G-machine. With the aspect of reduced heap-residency, the ZG-machine may be useful in memory-restricted environments such as embedded systems. Also, with the development of a more efficient garbage collector, the run-time is expected to decrease significantly.

• Hwankyungkyoyuk
• /
• v.11 no.1
• /
• pp.151-164
• /
• 1998

Conclusion and the improvement plan according to the survey on recycling wastes in 'the program of woman and environmental education' mainly for the chairwomen of the women's association of the apartment house in City and County of Chungchongnamdo during the first half of 1998 (from March tp April) are as follows. 1. Conclusion 1) It showed that the rate of recognition for recycle has no difference by regional groups and the rate of recognition is 57.4% but they mainly know vaguely or they do not know. 2) It showed that the rate they do not know how the separated wastes are recycled is 30.4% and the scope of their knowledge is approximative.(52.6%) 3) It showed that it is the housewives who mainly do the separate garbage collection (72.7%) and 19.1% of the people have no interest in the separate discharge. 4) It showed that the rate they filter the garbage or remove water from the garbage at house is 53.1%. And 20% of the people in the urban region dump untreated wastes but 8.5% of the people in the rural region do the same, so the rate of using garbage in the rural region is higher than that in the urban region. 5) It showed that the separate state of the garbage is 29.2% for the removal of toothpick and paper and 47.4% for the removal of vinyl and stopper. 6) It showed that 66.7% of the motive for recycling waste is the education activity for environment by the women's association and SAEMAEUL association and 34.5% of that is the influence of TV and radio. 7) It showed that the rate of making compost and feed using garbage in the rural region is higher than that in the urban region and in some urban regions, the rate they sprinkle the garbage in provisional compost state on the floor garden is high. 8) It showed that the recognition rate for the material of separately collected garbage corresponding to the separate waste system of 5-6 classification is 12.5% 9) It showed that the major variable which has an effect on the recycle is the education activity for environment by the neighborhood meeting(P<0.05) and by the women's association of saemaeul activity(P<0.05)

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.421-423
• /
• 1999

가전 제품이나 정보 가전 기기를 포함하는 실시간 임베디드 응용 분야에서 Java를 소프트웨어 개발 플랫폼으로 선택하는 범위가 확대되고 있다. 현재 Sun에서 제공하는 PersonalJava 기술은 동적인 메모리 할당에 대하여 마크-회수(mark-sweep) 방식의 자동 쓰레기 수집(garbage collection) 기능을 지원하는데, 이 방법은 쓰레기 회수 수행전 응용프로그램의 수행을 중지시키는 방식으로 실시간 임베디드 환경에 적합하지 않다. 본 논문에서는 Java 기반 인터넷 셋톱박스나 디지털 가전기기에 탑재할수 있는 Java 플랫폼을 대상으로 기존에 적용된 비실시간 마크-회수 메모리 관리 기법을 대체하는 실시간 자동 메모리 관리 기법을 제시한다.

• Journal of Environmental Science International
• /
• v.14 no.11
• /
• pp.985-994
• /
• 2005

Recently, Environmental friendliness and sustainability become the main concern of residential area planning. This paper deals with the estimation indicator system for environmentally friendliness of residential areas. An interview survey was carried out for resident groups by the type of housing. 'Environmentally friendly residential site' is defined as 'A site of sustainable development with low undesirable impact on environment, friendliness to natural environments such as green areas and waters, and amenity, health & hygiene of residents' Totally, nineteen individual indicators, six categories and three principles(Low Impact, High Contact, Amenity & Health) were proposed as estimation indicator system. Residents showed high importance on principle of 'amenity & health'. Individual indicators such as 'garbage segregated collection', 'secure green areas' and 'cleanness of water and air' showed high weighting value by each principles. Satisfaction level of residents for individual indicators, such as 'garbage segregated collection', 'common gardens', and 'cleanness of residential areas', were comparatively high. By the result of factor analysis, the proposed model for indicator system was valid.