University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • A. James Clark School of Engineering
    • Institute for Systems Research Technical Reports
    • View Item
    •   DRUM
    • A. James Clark School of Engineering
    • Institute for Systems Research Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Bin Packing and Dynamic File Storage: An 'Any-Fit' Algorithm Can Stabilize.

    Thumbnail
    View/Open
    TR_87-216.pdf (288.5Kb)
    No. of downloads: 556

    Date
    1987
    Author
    Gubner, John A.
    Metadata
    Show full item record
    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.
    URI
    http://hdl.handle.net/1903/4718
    Collections
    • Institute for Systems Research Technical Reports

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility
     

     

    Browse

    All of DRUMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister
    Pages
    About DRUMAbout Download Statistics

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility