Bin Packing and Dynamic File Storage: An 'Any-Fit' Algorithm Can Stabilize.
| dc.contributor.author | Gubner, John A. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:40:16Z | |
| dc.date.available | 2007-05-23T09:40:16Z | |
| dc.date.issued | 1987 | en_US |
| dc.description.abstract | In this paper we first consider the one-dimensional bin-packing problem and show that a class of "any-fit" algorithms can bound the expected wasted space in the system under certain conditions. In the second part of the paper we consider a dynamic file- storage problem and show, under certain conditions, that a class of "any-fit" algorithms can bound the expected wasted space left by deleted files. | en_US |
| dc.format.extent | 295426 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4718 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1987-216 | en_US |
| dc.title | Bin Packing and Dynamic File Storage: An 'Any-Fit' Algorithm Can Stabilize. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1