Differences

This shows you the differences between two versions of the page.

--- pub:projects:ssmalloc [2012/04/17 15:48] – root
+++ pub:projects:ssmalloc [2014/08/22 10:32] (current) – [Publications] root
@@ Line 18: / Line 18: @@
 Here is the figure of the overall architecture of SSMalloc.
-{{:pub:projects:ssmalloc-arch.jpg|Figure 1: Overall Architecture of SSMalloc}}
+{{:pub:projects:ssmalloc-arch.jpg?nolink&400|Figure 1: Overall Architecture of SSMalloc}}
 SSMalloc maintains a private heap for each application thread. A thread operates on its own heap for most requests, thus eliminates most of the synchronization. Each private heap holds several fixed-size memory chunks. A memory chunk contains many objects of the same size class.
@@ Line 31: / Line 31: @@
 Experiments using a number of commonly used allocation-benchmarks running on a 48-core machines show that for most cases SSMalloc outperforms prior systems in allocation latency and access locality, and provides more stable and scalable performance.
-Here is some of the experimental result.
+Here is some experimental results.
-Sequential Performance
+=== Sequential Performance ===
 {{:pub:projects:seq.jpg|Figure 2: Relative Execution Time of Sequential Applications}}
-Multi-thread Scalability and Stableness
+=== Multi-thread Scalability and Stableness ===
 {{:pub:projects:recycle.jpg|Figure 3: Recycle Execution Time}}
@@ Line 43: / Line 43: @@
 {{:pub:projects:larson.jpg|Figure 5: Larson Throughput}}
-Locality Stableness
+=== Locality Stableness ===
 {{:pub:projects:cachemiss.jpg|Figure 6: Cache Miss Breakdown for WordCount}}
@@ Line 55: / Line 55: @@
 ===== Publications =====
+  *Ran Liu and Haibo Chen. SSMalloc: A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability. In Proceedings of 3rd ACM SIGOPS Asia-Pacific Workshop on Systems (**APSys 2012**), Seoul, Korea. [{{:publications:ssmalloc-apsys2012.pdf|pdf}}]
 ===== Source Code =====
-(Coming soon)
+[[https://github.com/Naruil/SSMalloc]]