Parallel dynamic storage allocation algorithms

A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel and Distributed Processing, 5th IEEE Symposium On s. 82 - 91
Hlavní autor: Iyengar, A.
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1993
Témata:
Aging
Computer languages
Concurrency control
Heuristic algorithms
Memory management
Parallel machines
Performance evaluation
Programming profession
System performance
Testing
ISBN:9780818642227, 081864222X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time for their creation. This paper examines parallel dynamic storage allocation algorithms. Three new algorithms, multiple free list fit I, modified quick fit, and multiple free list fit II, are presented which outperform all previous algorithms we tested. The performances of the three algorithms differ when the percentage of requests for large blocks is high. Multiple free list fit I is the fastest algorithm when large blocks of many different sizes are requested. Multiple free list fit II is the fastest algorithm when large blocks of only a few different sizes are requested.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9780818642227
081864222X
DOI:10.1109/SPDP.1993.395547