Scalability of dynamic storage allocation algorithms

Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96) s. 223 - 232
Hlavný autor: Iyengar, A.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1996
Predmet:
Aging
Computer languages
Computer performance
Concurrent computing
Heuristic algorithms
Parallel machines
Programming profession
Scalability
System performance
Throughput
ISBN:0818675519, 9780818675515
ISSN:1088-4955
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the ability to satisfy multiple requests concurrently. This paper examines parallel dynamic storage allocation algorithms and how performance scales with increasing numbers of processors. The highest throughputs and lowest instruction counts are achieved with multiple free list fit I. The best memory utilization is achieved using a best fit system.
ISBN:0818675519
9780818675515
ISSN:1088-4955
DOI:10.1109/FMPC.1996.558089