malloc() Performance in a Multithreaded Linux Environment
dc.contributor.author | Lever, Chuck | en_US |
dc.contributor.author | Boreham, David | en_US |
dc.date.accessioned | 2014-07-18T18:11:54Z | |
dc.date.available | 2014-07-18T18:11:54Z | |
dc.date.issued | 2000-05-02 | en_US |
dc.identifier.citation | C. Lever, D. Boreham, "malloc() in a Multithreaded Linux Environment," May 2000. [FREENIX track, USENIX Technical Conference, San Diego (June 2000).] <http://hdl.handle.net/2027.42/107907> | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/107907 | |
dc.description.abstract | Network servers make special demands that other types of applications may not make on memory allocators. We describe a simple malloc() microbenchmark suite that tests the ability of malloc() to divide its work efficiently among multiple threads and processors. The purpose of this suite is to determine the suitability of an operating system's heap allocator for use with network servers running in an SMP environment. | en_US |
dc.publisher | Center for Information Technology Integration | en_US |
dc.title | malloc() Performance in a Multithreaded Linux Environment | en_US |
dc.type | Technical Report | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.contributor.affiliationother | Sun-Netscape Alliance | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/107907/1/citi-tr-00-5.pdf | |
dc.owningcollname | Electrical Engineering and Computer Science, Department of (EECS) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.