Skip to content
No description, website, or topics provided.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Code_Regenerator Update Code Regenerator: mibench Sep 5, 2017
Dillo
F-STM_Library f-stm remove swap_file Feb 17, 2016
Garbage_Collector update libary and tiny May 19, 2015
HEAPO_ARM64_4.6 update HEAPO_ARM64_4.6 May 30, 2017
HEAPO_ARM_3.15 clean the key-value store code Jan 2, 2015
HEAPO_UFLRU Swapping Update Aug 26, 2017
HEAPO_x86_2.6.32 Update readme.txt Jan 28, 2016
MultiType_GC multi-type gc update Nov 10, 2017
Persistent_Heapo upload persistent heapo Aug 18, 2017
README.md Update README.md Nov 13, 2014

README.md

HEAPO

we developed a heap-based persistent object store, HEAPO, to manage persistent objects in byte-addressable NVRAM. HEAPO defines its own persistent heap layout, the persistent object format, name space organization, object sharing and protection mechanism, and undo-only log based crash recovery, all of which are effectively tailored for NVRAM. We put our effort into developing lightweight and flexible layer to exploit the DRAM-like access latency of NVRAM. To address this objective, we developed (i) native management layer for NVRAM to eliminate redundancy between in-core and on-disk copy of the metadata, (ii) expandable object format, (iii) burst trie based global name space with local name space caching, (iv) static address binding, and (v) minimal logging for undo-only crash recovery.

Publication

  • Taeho Hwang, Jaemin Jung, and Youjip Won, "HEAPO: Heap-based Persistent Object Store", ACM Transactions on Storage, Accepted for publication, May 2014

Acknowledgement

  • This work is supported by IT R&D program MKE/KEIT (No. 10041608, Embedded System Software for New-memory based Smart Device), and supported by IT R&D program MKE/KEIT. [No.10035202, Large Scale hyper-MLC SSD Technology Development].
You can’t perform that action at this time.