Show simple item record

malloc() Performance in a Multithreaded Linux Environment

dc.contributor.authorLever, Chucken_US
dc.contributor.authorBoreham, Daviden_US
dc.date.accessioned2014-07-18T18:11:54Z
dc.date.available2014-07-18T18:11:54Z
dc.date.issued2000-05-02en_US
dc.identifier.citationC. 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.urihttps://hdl.handle.net/2027.42/107907
dc.description.abstractNetwork 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.publisherCenter for Information Technology Integrationen_US
dc.titlemalloc() Performance in a Multithreaded Linux Environmenten_US
dc.typeTechnical Reporten_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.contributor.affiliationotherSun-Netscape Allianceen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/107907/1/citi-tr-00-5.pdf
dc.owningcollnameElectrical Engineering and Computer Science, Department of (EECS)


Files in this item

Show simple item record

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.