Definition and solution of the memory packing problem for field-programmable systems
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
Fast Allocation of Processes in Distributed and Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Tight Bounds for Online Class-Constrained Packing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Feedback linking: optimizing object code layout for updates
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
A tunable hybrid memory allocator
Journal of Systems and Software
A comparison of memory allocators for real-time applications
JTRES '06 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
IEEE Transactions on Computers
Implementation of a constant-time dynamic storage allocator
Software—Practice & Experience
Note: Random-order bin packing
Discrete Applied Mathematics
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics
Multidimensional bin packing algorithms
IBM Journal of Research and Development
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Fast algorithms for bin packing
Journal of Computer and System Sciences
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A study of best-fit memory allocators
Computer Languages, Systems and Structures
Online bin packing with resource augmentation
Discrete Optimization
An approximation algorithm for square packing
Operations Research Letters
A note on a selfish bin packing problem
Journal of Global Optimization
| Hi-index | 0.00 |
Various memory allocation problems can be modeled by the following abstract problem. Given a list A &equil; (&agr;1,&agr;2,...&agr;n,) of real numbers in the range (0, 1], place these in a minimum number of “bins” so that no bin holds numbers summing to more than 1. We let A* be the smallest number of bins into which the numbers of list A may be placed. Since a general placement algorithm for attaining A* appears to be impractical, it is important to determine good heuristic methods for assigning numbers of bins. We consider four such simple methods and analyze the worst-case performance of each, closely bounding the maximum of the ratio of the number of bins used by each method applied to list A to the optimal quantity A*.