Memory Compaction-Compact Fit
| dc.contributor.author | Akshay, J P | |
| dc.contributor.author | Archana, Udayashankar | |
| dc.contributor.author | Immanuel, Raj | |
| dc.contributor.author | Kusum, Ijari | |
| dc.date.accessioned | 2015-12-18T07:06:31Z | |
| dc.date.available | 2015-12-18T07:06:31Z | |
| dc.date.issued | 2015-12-18T07:06:31Z | |
| dc.description.abstract | We propose a real real-time memory management system called Compact-fit that offers both time and space predictability. Compact-fit is a compacting memory management system for allocating, deallocating, and accessing memory in real time. The system provides predictable memory fragmentation and response times that are constant or linear in the size of the request, independently of the global memory state. We present two Compact-fit implementations and compare them to established memory management systems, which all fail to provide predictable memory fragmentation. The experiments confirm our theoretical complexity bounds and demonstrate competitive performance. In addition, we can control the performance versus fragmentation trade-off via our concept of partial compaction. The system can be parameterized with the needed level of compaction, improving the performance while keeping memory fragmentation predictable. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/5387 | |
| dc.language.iso | en | en_US |
| dc.subject | Memory Compaction-Compact Fit | en_US |
| dc.subject | Akshay | en_US |
| dc.subject | Archana | en_US |
| dc.subject | Immanuel | en_US |
| dc.subject | Kusum | en_US |
| dc.title | Memory Compaction-Compact Fit | en_US |
| dc.type | Thesis | en_US |