| |
Browse All Reviews > Software (D) > Operating Systems (D.4) > Storage Management (D.4.2) > Allocation/Deallocation Strategies (D.4.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 13
Reviews about "Allocation/Deallocation Strategies (D.4.2...)":
|
Date Reviewed |
| |
Online learning for network resource allocation
Salem T., Salem T. ACM SIGMETRICS Performance Evaluation Review 50(3): 20-23, 2023. Type: Article
Network resource allocation is still a challenge in many scenarios where fast services need to be provided in changing and unpredictable situations, for example, the ones encountered in streaming data applications....
|
Aug 25 2023 |
| |
An Efficient Task Allocation Scheme for 2D Mesh Architectures
Yoo S., Youn H., Shirazi B. IEEE Transactions on Parallel and Distributed Systems 8(9): 934-942, 1997. Type: Article
Efficient allocation of processors to incoming tasks in parallel computer systems is important to high performance. The authors present an efficient task allocation scheme for 2D architectures. By effectively manipulating the allocatio...
|
Jul 1 1998 |
| |
Garbage collection
Jones R., Lins R., John Wiley & Sons, Inc., New York, NY, 1996. Type: Book (9780471941484)
Garbage collection is “the automatic reclamation of heap allocated storage after its last use by a program.” Garbage collection is a unique topic within computer science, since it is a well-known problem that is clo...
|
Sep 1 1997 |
| |
Compacting garbage collection can be fast and simple
Clarke C., Mason D. Software--Practice & Experience 26(2): 177-194, 1996. Type: Article
The performance of a compacting garbage collector with that of a copying collector is compared. The comparison was made by implementing Standard ML of New Jersey (SML-NJ) with a compacting collector, and then measuring the behavior of ...
|
Jan 1 1997 |
| |
Robust, distributed references and acyclic garbage collection
Shapiro M., Dickman P., Plainfossé D. Principles of distributed computing (Proceedings of the eleventh annual ACM symposium, Vancouver, British Columbia, Canada, Aug 10-12, 1992) 135-146, 1992. Type: Proceedings
Research by the authors on a generic addressing mechanism and a distributed garbage collector as a language-independent service for distributed systems is presented. As described, the garbage collector does not collect cyclic garbage.<...
|
Aug 1 1993 |
| |
An adaptive tenuring policy for generation scavengers
Ungar D., Jackson F. ACM Transactions on Programming Languages and Systems 14(1): 1-27, 1992. Type: Article
In systems with automatic garbage collection, most garbage is relatively short-lived. An effective approach for reducing garbage collection costs is to perform frequent, relatively cheap collections on recently allocated storage object...
|
Oct 1 1992 |
| |
A Buffer-Based Method for Storage Allocation in an Object-Oriented System
Vogt C. IEEE Transactions on Computers 39(3): 375-383, 1990. Type: Article
As the title indicates, this paper presents a free storage management scheme in an object-oriented segmented environment; the scheme is based on a set of free storage descriptor buffers. In a object-oriented system, buffer operations a...
|
Mar 1 1991 |
| |
Efficient implementation of the first-fit strategy for dynamic storage allocation
Brent R. ACM Transactions on Programming Languages and Systems 11(3): 388-403, 1989. Type: Article
This paper describes the many types of dynamic memory allocation strategies and discusses the many possible implementation algorithms for each. Perhaps the most commonly used strategy is first-fit, in which a list is maintained ...
|
Feb 1 1990 |
| |
Managing stored voice in the Etherphone system
Terry D., Swinehart D. ACM Transactions on Computer Systems 6(1): 3-27, 1988. Type: Article
According to the authors’ abstract, “the voice manager in the Etherphone system provides facilities for recording, editing, and playing stored voice in a distributed personal-computing environment. It provides the b...
|
Apr 1 1989 |
| |
Disk allocation methods for binary Cartesian product files
Du H. BIT 26(2): 138-147, 1986. Type: Article
In response to a query, a database system must search the index for suitable records and fetch them from the disk. When the database occupies more than one disk, the response can be faster if the records are on different disks so the f...
|
Aug 1 1987 |
| |
|
|
| |
|
|
