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

Podrobná bibliografia

Vydané v:	Parallel and Distributed Processing, 5th IEEE Symposium On s. 82 - 91
Hlavný autor:	Iyengar, A.
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE Comput. Soc. Press 1993
Predmet:	Aging Computer languages Concurrency control Heuristic algorithms Memory management Parallel machines Performance evaluation Programming profession System performance Testing
ISBN:	9780818642227, 081864222X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!