Flash Memory Garbage Collection in Hard Real-Time Systems

Simple item page
dc.contributorBettati, Riccardo
dc.creatorLai, Chien-An
dc.date.accessioned2012-10-19T15:29:39Z
dc.date.accessioned2012-10-22T18:02:00Z
dc.date.accessioned2017-04-07T20:00:49Z
dc.date.available2012-10-19T15:29:39Z
dc.date.available2012-10-22T18:02:00Z
dc.date.available2017-04-07T20:00:49Z
dc.date.created2011-08
dc.date.issued2012-10-19
dc.description.abstractDue to advances in capacity, speed, and economics, NAND-based flash memory technology is increasingly integrated into all types of computing systems, ranging from enterprise servers to embedded devices. However, due to its unpredictable up-date behavior and time consuming garbage collection mechanism, NAND-based flash memory is difficult to integrate into hard-real-time embedded systems. In this thesis, I propose a performance model for flash memory garbage collection that can be used in conjunction with a number of different garbage collection strategies. I describe how to model the cost of reactive (lazy) garbage collection and compare it to that of more proactive schemes. I develop formulas to assess the schedulability of hard real- time periodic task sets under simplified memory consumption models. Results show that I prove the proactive schemes achieve the larger maximum schedulable utilization than the traditional garbage collection mechanism for hard real-time systems in flash memory.
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10195
dc.language.isoen_US
dc.subjectreal-time systems
dc.subjectflash memory
dc.subjectgarbage collection
dc.titleFlash Memory Garbage Collection in Hard Real-Time Systems
dc.typeThesis

Files

Collections

Texas A&M University at College Station