An algorithm for storage device selection and file assignment

Newly available write-once/read-many (WORM) optical storage devices provide the opportunity for storing massive amounts of data online at very low cost. However, the slow random access time of the WORM and its write-once limitation has, in general, restricted its application to archival storage and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 1992-09, Vol.61 (3), p.326-344
Hauptverfasser: Han, Bernard T., Diehr, George
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 344
container_issue 3
container_start_page 326
container_title European journal of operational research
container_volume 61
creator Han, Bernard T.
Diehr, George
description Newly available write-once/read-many (WORM) optical storage devices provide the opportunity for storing massive amounts of data online at very low cost. However, the slow random access time of the WORM and its write-once limitation has, in general, restricted its application to archival storage and static files. In this paper we analyze a hybrid storage system which uses a combination of conventional magnetic disks and optical devices for management of files which have moderate volatility. The hybrid system appears to be particularly attractive for databases used for decision support. Cost models and solution algorithms are developed which determine a near-optimum database ‘storage plan’. A storage plan specifies the selection of device types and the assignment of files to devices. The solution approach uses a dynamic programming-based heuristic to obtain an initial solution followed by a set-covering algorithm which employs column generation to both search for an improved solution and to provide a tight lower bound. Computational results indicate that the method produces solutions with an average suboptimality of less than 1 percent. More importantly, this research demonstrates that a storage plan which uses a mix of device types can provide costs savings of up to 70% over a storage plan which is limited to conventional magnetic devices.
doi_str_mv 10.1016/0377-2217(92)90362-D
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_25689701</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>037722179290362D</els_id><sourcerecordid>1070620</sourcerecordid><originalsourceid>FETCH-LOGICAL-c458t-cc76a4d303bfe70f29b91ac3c9388a22f74cb7c732be819899c10ec0e868fcc43</originalsourceid><addsrcrecordid>eNp9kUtrGzEUhUVpIG7Sf9DFUEJpF9PqNXosGghJHwmBbtq1kO9cOTIzI0caG_LvK8fBiy4qOLqb71wO5xLyjtHPjDL1hQqtW86Z_mj5J0uF4u3NK7JgRvNWGUVfk8UROSVvSllTSlnHugX5ejU1flilHOeHsQkpN2VO2a-w6XEXAZuCA8IcU8WmvglxwMaXElfTiNN8Tk6CHwq-fZln5M_3b7-vf7b3v37cXl_dtyA7M7cAWnnZCyqWATUN3C4t8yDACmM850FLWGrQgi_RMGusBUYRKBplAoAUZ-TDYe8mp8ctltmNsQAOg58wbYvjnTJWU1bB9_-A67TNU83mOJWCSypsheQBgpxKyRjcJsfR5yfHqNsX6vZtuX1bznL3XKi7qba7gy3jBuHowfrWKWNxOye8YvV7qmK2WoWPVaJqs59cOSGle5jHuuziJagv4IeQ_QSxHJd2HReU8YpdHjCs7e4iZlcg4gTYx1zP4voU_x_6L-g3oYQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204324039</pqid></control><display><type>article</type><title>An algorithm for storage device selection and file assignment</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Han, Bernard T. ; Diehr, George</creator><creatorcontrib>Han, Bernard T. ; Diehr, George</creatorcontrib><description>Newly available write-once/read-many (WORM) optical storage devices provide the opportunity for storing massive amounts of data online at very low cost. However, the slow random access time of the WORM and its write-once limitation has, in general, restricted its application to archival storage and static files. In this paper we analyze a hybrid storage system which uses a combination of conventional magnetic disks and optical devices for management of files which have moderate volatility. The hybrid system appears to be particularly attractive for databases used for decision support. Cost models and solution algorithms are developed which determine a near-optimum database ‘storage plan’. A storage plan specifies the selection of device types and the assignment of files to devices. The solution approach uses a dynamic programming-based heuristic to obtain an initial solution followed by a set-covering algorithm which employs column generation to both search for an improved solution and to provide a tight lower bound. Computational results indicate that the method produces solutions with an average suboptimality of less than 1 percent. More importantly, this research demonstrates that a storage plan which uses a mix of device types can provide costs savings of up to 70% over a storage plan which is limited to conventional magnetic devices.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/0377-2217(92)90362-D</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Computer science; control theory; systems ; Cost control ; device selection ; Exact sciences and technology ; file assignment ; Integer programming ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Operations research ; Optimization ; Records management ; Software ; Storage systems ; WORM</subject><ispartof>European journal of operational research, 1992-09, Vol.61 (3), p.326-344</ispartof><rights>1992</rights><rights>1992 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Sep 25, 1992</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c458t-cc76a4d303bfe70f29b91ac3c9388a22f74cb7c732be819899c10ec0e868fcc43</citedby><cites>FETCH-LOGICAL-c458t-cc76a4d303bfe70f29b91ac3c9388a22f74cb7c732be819899c10ec0e868fcc43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/037722179290362D$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=5523012$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a61_3ay_3a1992_3ai_3a3_3ap_3a326-344.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Han, Bernard T.</creatorcontrib><creatorcontrib>Diehr, George</creatorcontrib><title>An algorithm for storage device selection and file assignment</title><title>European journal of operational research</title><description>Newly available write-once/read-many (WORM) optical storage devices provide the opportunity for storing massive amounts of data online at very low cost. However, the slow random access time of the WORM and its write-once limitation has, in general, restricted its application to archival storage and static files. In this paper we analyze a hybrid storage system which uses a combination of conventional magnetic disks and optical devices for management of files which have moderate volatility. The hybrid system appears to be particularly attractive for databases used for decision support. Cost models and solution algorithms are developed which determine a near-optimum database ‘storage plan’. A storage plan specifies the selection of device types and the assignment of files to devices. The solution approach uses a dynamic programming-based heuristic to obtain an initial solution followed by a set-covering algorithm which employs column generation to both search for an improved solution and to provide a tight lower bound. Computational results indicate that the method produces solutions with an average suboptimality of less than 1 percent. More importantly, this research demonstrates that a storage plan which uses a mix of device types can provide costs savings of up to 70% over a storage plan which is limited to conventional magnetic devices.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Cost control</subject><subject>device selection</subject><subject>Exact sciences and technology</subject><subject>file assignment</subject><subject>Integer programming</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Records management</subject><subject>Software</subject><subject>Storage systems</subject><subject>WORM</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kUtrGzEUhUVpIG7Sf9DFUEJpF9PqNXosGghJHwmBbtq1kO9cOTIzI0caG_LvK8fBiy4qOLqb71wO5xLyjtHPjDL1hQqtW86Z_mj5J0uF4u3NK7JgRvNWGUVfk8UROSVvSllTSlnHugX5ejU1flilHOeHsQkpN2VO2a-w6XEXAZuCA8IcU8WmvglxwMaXElfTiNN8Tk6CHwq-fZln5M_3b7-vf7b3v37cXl_dtyA7M7cAWnnZCyqWATUN3C4t8yDACmM850FLWGrQgi_RMGusBUYRKBplAoAUZ-TDYe8mp8ctltmNsQAOg58wbYvjnTJWU1bB9_-A67TNU83mOJWCSypsheQBgpxKyRjcJsfR5yfHqNsX6vZtuX1bznL3XKi7qba7gy3jBuHowfrWKWNxOye8YvV7qmK2WoWPVaJqs59cOSGle5jHuuziJagv4IeQ_QSxHJd2HReU8YpdHjCs7e4iZlcg4gTYx1zP4voU_x_6L-g3oYQ</recordid><startdate>19920925</startdate><enddate>19920925</enddate><creator>Han, Bernard T.</creator><creator>Diehr, George</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19920925</creationdate><title>An algorithm for storage device selection and file assignment</title><author>Han, Bernard T. ; Diehr, George</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c458t-cc76a4d303bfe70f29b91ac3c9388a22f74cb7c732be819899c10ec0e868fcc43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Cost control</topic><topic>device selection</topic><topic>Exact sciences and technology</topic><topic>file assignment</topic><topic>Integer programming</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Records management</topic><topic>Software</topic><topic>Storage systems</topic><topic>WORM</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Han, Bernard T.</creatorcontrib><creatorcontrib>Diehr, George</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Han, Bernard T.</au><au>Diehr, George</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An algorithm for storage device selection and file assignment</atitle><jtitle>European journal of operational research</jtitle><date>1992-09-25</date><risdate>1992</risdate><volume>61</volume><issue>3</issue><spage>326</spage><epage>344</epage><pages>326-344</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>Newly available write-once/read-many (WORM) optical storage devices provide the opportunity for storing massive amounts of data online at very low cost. However, the slow random access time of the WORM and its write-once limitation has, in general, restricted its application to archival storage and static files. In this paper we analyze a hybrid storage system which uses a combination of conventional magnetic disks and optical devices for management of files which have moderate volatility. The hybrid system appears to be particularly attractive for databases used for decision support. Cost models and solution algorithms are developed which determine a near-optimum database ‘storage plan’. A storage plan specifies the selection of device types and the assignment of files to devices. The solution approach uses a dynamic programming-based heuristic to obtain an initial solution followed by a set-covering algorithm which employs column generation to both search for an improved solution and to provide a tight lower bound. Computational results indicate that the method produces solutions with an average suboptimality of less than 1 percent. More importantly, this research demonstrates that a storage plan which uses a mix of device types can provide costs savings of up to 70% over a storage plan which is limited to conventional magnetic devices.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0377-2217(92)90362-D</doi><tpages>19</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 1992-09, Vol.61 (3), p.326-344
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_miscellaneous_25689701
source RePEc; Elsevier ScienceDirect Journals
subjects Algorithms
Applied sciences
Computer science
control theory
systems
Cost control
device selection
Exact sciences and technology
file assignment
Integer programming
Memory and file management (including protection and security)
Memory organisation. Data processing
Operations research
Optimization
Records management
Software
Storage systems
WORM
title An algorithm for storage device selection and file assignment
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T07%3A15%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20algorithm%20for%20storage%20device%20selection%20and%20file%20assignment&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Han,%20Bernard%20T.&rft.date=1992-09-25&rft.volume=61&rft.issue=3&rft.spage=326&rft.epage=344&rft.pages=326-344&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/0377-2217(92)90362-D&rft_dat=%3Cproquest_cross%3E1070620%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204324039&rft_id=info:pmid/&rft_els_id=037722179290362D&rfr_iscdi=true