555 search results - page 1 / 111 » Improved results for a memory allocation problem |
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
WWIC
2005
Springer
14 years 4 months ago
2005
Springer
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
COMCOM
2006
13 years 11 months ago
2006
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
VLDB
1993
ACM
14 years 2 months ago
1993
ACM
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling...
IWMM
1998
Springer
14 years 3 months ago
1998
Springer
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...