Hoard memory allocator: Difference between revisions

Revision as of 13:52, 11 November 2007

Revision as of 01:14, 6 January 2008

Line 1:

The '''Hoard memory allocator''', or '''Hoard''', is a [[memory allocation|memory allocator]] for [[Linux]], [[Solaris (operating system)|Solaris]], [[Microsoft Windows]] and other [[operating systems]]. Hoard can improve the performance of [[multithreaded]] applications by providing fast, [[scalable]] [[memory management]] functions ([[malloc]] and [[Free (programming)|free]]). In particular, it reduces contention for the heap (the central data structure used in [[dynamic memory allocation]]) caused when multiple threads allocate or free memory, and avoids the [[false sharing]] that can be introduced by memory allocators. At the same time, Hoard has low [[fragmentation (computer)|fragmentation]].<ref name=Berger2000>{{cite journal

{{unreferenced|date=August 2006}}

| author = Berger, E.D.

| coauthors = McKinley, K.S.; Blumofe, R.D.; Wilson, P.R.

The '''Hoard memory allocator''', or '''Hoard''', is a [[memory allocation|memory allocator]] for [[Linux]], [[Solaris (operating system)|Solaris]], [[Microsoft Windows]] and other [[operating systems]]. Hoard can improve the performance of [[multithreaded]] applications by providing fast, [[scalable]] [[memory management]] functions ([[malloc]] and [[Free (programming)|free]]). In particular, it reduces contention for the heap (the central data structure used in [[dynamic memory allocation]]) caused when multiple threads allocate or free memory, and avoids the [[false sharing]] that can be introduced by memory allocators. At the same time, Hoard has low [[fragmentation (computer)|fragmentation]].

| year = 2000

| title = Hoard: a scalable memory allocator for multithreaded applications

| journal = ACM SIGPLAN Notices

| volume = 35

| issue = 11

| pages = 117-128

| url = http://portal.acm.org/citation.cfm?id=356989.357000

| accessdate = 2008-01-06

}}</ref>.

==External links==