The Experts below are selected from a list of 18510 Experts worldwide ranked by ideXlab platform
Ohhoon Kwon - One of the best experts on this subject based on the ideXlab platform.
-
swap aware Garbage Collection for nand flash memory based embedded systems
Computer and Information Technology, 2007Co-Authors: Ohhoon KwonAbstract:Embedded systems use NAND flash memory as a secondary storage device because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. NAND flash memory based embedded systems exploit a "demand paging" to run applications and also use a "swapping" to extend a limited main memory space. Because the embedded systems use NAND flash memory as swap space, it should perform Garbage Collection, which is a time-consuming operation. Besides, the number of the erase operations allowed to each block is also limited. In this paper, we propose a new Garbage Collection policy for embedded systems with the swap system. The proposed Garbage Collection policy focuses on minimizing the Garbage Collection time and even wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing Garbage Collection policies in terms of the Garbage Collection time and the endurance of flash memory.
-
an efficient Garbage Collection policy for flash memory based swap systems
International Conference on Computational Science and Its Applications, 2007Co-Authors: Ohhoon KwonAbstract:Mobile computing devices use flash memory as a secondary storage because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. Mobile computing devices exploit a swap system to extend a limited main memory space and use flash memory as a swap system. Although flash memory has the attractive features, it should perform Garbage Collection, which includes erase operations. The erase operations are very slow, and usually decrease the performance of the system. Besides, the number of the erase operations allowed to each block is also limited. To minimize the Garbage Collection time and evenly wear out, our proposed Garbage Collection policy focuses on minimizing the Garbage Collection time and wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing Garbage Collection policies in terms of the number of erase operation, the Garbage Collection time, total amount of energy consumption and the endurance of flash memory.
-
ef greedy a novel Garbage Collection policy for flash memory based embedded systems
International Conference on Conceptual Structures, 2007Co-Authors: Ohhoon Kwon, Jaewoo Lee, Kern KohAbstract:Flash memory is becoming increasingly important for embedded systems because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. Although flash memory has attractive features, it should perform Garbage Collection, which includes erase operations. The erase operations are very slow, and usually decrease the performance of the system. Besides, the number of the erase operations allowed to each block is also limited. To minimize the Garbage Collection time and evenly wear out, our proposed Garbage Collection policy focuses on minimizing the Garbage Collection time and wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing Garbage Collection policies in terms of the Garbage Collection time and the endurance of flash memory. Specifically, we have shown that the performance improvement of our proposed policy against the greedy policy in terms of the endurance of flash memory is as much as 90.6%.
Kern Koh - One of the best experts on this subject based on the ideXlab platform.
-
ef greedy a novel Garbage Collection policy for flash memory based embedded systems
International Conference on Conceptual Structures, 2007Co-Authors: Ohhoon Kwon, Jaewoo Lee, Kern KohAbstract:Flash memory is becoming increasingly important for embedded systems because it has many attractive features such as small size, fast access speeds, shock resistance, and light weight. Although flash memory has attractive features, it should perform Garbage Collection, which includes erase operations. The erase operations are very slow, and usually decrease the performance of the system. Besides, the number of the erase operations allowed to each block is also limited. To minimize the Garbage Collection time and evenly wear out, our proposed Garbage Collection policy focuses on minimizing the Garbage Collection time and wear-leveling. Trace-driven simulations show that the proposed policy performs better than existing Garbage Collection policies in terms of the Garbage Collection time and the endurance of flash memory. Specifically, we have shown that the performance improvement of our proposed policy against the greedy policy in terms of the endurance of flash memory is as much as 90.6%.
Seungryoul Maeng - One of the best experts on this subject based on the ideXlab platform.
-
evaluation of Garbage Collection techniques on flash translation layer
Computational Intelligence, 2006Co-Authors: Min Choi, Seungryoul MaengAbstract:Flash memory technology is becoming more popular in designing and building embedded systems applications because of its shock-resistent, power economic, and nonvolatile nature. Because flash memory is a write-once and bulk-erase medium, the Garbage Collection mechanism on Flash Translation Layer is needed to provide applications a transparent and high bandwidth storage service. In this paper, we propose and implement a FAT-aware log-based Flash Translation Layer, which has two points of Garbage Collection time. We also propose two versions of victim selection policy which is to select a log block and invalidate it. The performance between the proposed victim selection policies is evaluated in terms of the effectiveness and the overhead by a series of experiments over our implemented system.
Min Choi - One of the best experts on this subject based on the ideXlab platform.
-
evaluation of Garbage Collection techniques on flash translation layer
Computational Intelligence, 2006Co-Authors: Min Choi, Seungryoul MaengAbstract:Flash memory technology is becoming more popular in designing and building embedded systems applications because of its shock-resistent, power economic, and nonvolatile nature. Because flash memory is a write-once and bulk-erase medium, the Garbage Collection mechanism on Flash Translation Layer is needed to provide applications a transparent and high bandwidth storage service. In this paper, we propose and implement a FAT-aware log-based Flash Translation Layer, which has two points of Garbage Collection time. We also propose two versions of victim selection policy which is to select a log block and invalidate it. The performance between the proposed victim selection policies is evaluated in terms of the effectiveness and the overhead by a series of experiments over our implemented system.
Eliot Moss - One of the best experts on this subject based on the ideXlab platform.
-
the Garbage Collection handbook the art of automatic memory management
2011Co-Authors: Richard Jones, Antony L Hosking, Eliot MossAbstract:Published in 1996, Richard Joness Garbage Collection was a milestone in the area of automatic memory management. The field has grown considerably since then, sparking a need for an updated look at the latest state-of-the-art developments. The Garbage Collection Handbook: The Art of Automatic Memory Management brings together a wealth of knowledge gathered by automatic memory management researchers and developers over the past fifty years. The authors compare the most important approaches and state-of-the-art techniques in a single, accessible framework. The book addresses new challenges to Garbage Collection made by recent advances in hardware and software. It explores the consequences of these changes for designers and implementers of high performance Garbage collectors. Along with simple and traditional algorithms, the book covers parallel, incremental, concurrent, and real-time Garbage Collection. Algorithms and concepts are often described with pseudocode and illustrations. The nearly universal adoption of Garbage Collection by modern programming languages makes a thorough understanding of this topic essential for any programmer. This authoritative handbook gives expert insight on how different collectors work as well as the various issues currently facing Garbage collectors. Armed with this knowledge, programmers can confidently select and configure the many choices of Garbage collectors. Web ResourceThe books online bibliographic database at www.gchandbook.org includes over 2,500 Garbage Collection-related publications. Continually updated, it contains abstracts for some entries and URLs or DOIs for most of the electronically available ones. The database can be searched online or downloaded as BibTeX, PostScript, or PDF.
-
memory subsystem performance of programs using copying Garbage Collection
Symposium on Principles of Programming Languages, 1994Co-Authors: Amer Diwan, David Tarditi, Eliot MossAbstract:Heap allocation with copying Garbage Collection is believed to have poor memory subsystem performance. We conducted a study of the memory subsystem performance of heap allocation for memory subsystems found on many machines. We found that many machines support heap allocation poorly. However, with the appropriate memory subsystem organization, heap allocation can have good memory subsystem performance.
