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...
Saved in:
| Published in: | Parallel and Distributed Processing, 5th IEEE Symposium On pp. 82 - 91 |
|---|---|
| Main Author: | |
| Format: | Conference Proceeding Journal Article |
| Language: | English |
| Published: |
IEEE Comput. Soc. Press
1993
|
| Subjects: | |
| ISBN: | 9780818642227, 081864222X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

