Towards an optimal design of distributed file systems:
Abstract: "In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-ba...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1991
|
| Schriftenreihe: | Technische Universität <München>: TUM-I
9122 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-based approach is used. To access the data files, a user initiates a program execution. Based on the current allocation of the program and data files as well as the knowledge about the characteristics of the programs, a first optimization calculates the optimal cluster for each individual program execution. The objective of this optimization is the minimization of the intercluster traffic of an individual program execution. Within the optimal cluster, a simple load-balancing strategy is used to determine the corresponding executing node. A second optimization looks for file allocations where the global intercluster traffic is minimized subject to the following constraints: minimal number of file copies, availability, and storage capacity. Experimental results showing the efficiency of the proposed algorithms are examined, and the implications of the model for the design of very large distributed file systems are discussed." |
| Beschreibung: | Literaturverz. S. 25 - 28 |
| Beschreibung: | 32 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004819263 | ||
| 003 | DE-604 | ||
| 005 | 20040408 | ||
| 007 | t | ||
| 008 | 920323s1991 gw d||| t||| 00||| eng d | ||
| 035 | |a (OCoLC)31897724 | ||
| 035 | |a (DE-599)BVBBV004819263 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM I 9122 | ||
| 100 | 1 | |a Borghoff, Uwe M. |d 1959- |e Verfasser |0 (DE-588)118121979 |4 aut | |
| 245 | 1 | 0 | |a Towards an optimal design of distributed file systems |c Uwe M. Borghoff |
| 264 | 1 | |a München |c 1991 | |
| 300 | |a 32 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9122 | |
| 500 | |a Literaturverz. S. 25 - 28 | ||
| 520 | 3 | |a Abstract: "In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-based approach is used. To access the data files, a user initiates a program execution. Based on the current allocation of the program and data files as well as the knowledge about the characteristics of the programs, a first optimization calculates the optimal cluster for each individual program execution. The objective of this optimization is the minimization of the intercluster traffic of an individual program execution. Within the optimal cluster, a simple load-balancing strategy is used to determine the corresponding executing node. A second optimization looks for file allocations where the global intercluster traffic is minimized subject to the following constraints: minimal number of file copies, availability, and storage capacity. Experimental results showing the efficiency of the proposed algorithms are examined, and the implications of the model for the design of very large distributed file systems are discussed." | |
| 650 | 4 | |a File organization (Computer science) | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9122 |w (DE-604)BV006185376 |9 9122 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002964213 | ||
Datensatz im Suchindex
| _version_ | 1804118929103126528 |
|---|---|
| any_adam_object | |
| author | Borghoff, Uwe M. 1959- |
| author_GND | (DE-588)118121979 |
| author_facet | Borghoff, Uwe M. 1959- |
| author_role | aut |
| author_sort | Borghoff, Uwe M. 1959- |
| author_variant | u m b um umb |
| building | Verbundindex |
| bvnumber | BV004819263 |
| ctrlnum | (OCoLC)31897724 (DE-599)BVBBV004819263 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02242nam a2200325 cb4500</leader><controlfield tag="001">BV004819263</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040408 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">920323s1991 gw d||| t||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31897724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004819263</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9122</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Borghoff, Uwe M.</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118121979</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Towards an optimal design of distributed file systems</subfield><subfield code="c">Uwe M. Borghoff</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9122</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 25 - 28</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-based approach is used. To access the data files, a user initiates a program execution. Based on the current allocation of the program and data files as well as the knowledge about the characteristics of the programs, a first optimization calculates the optimal cluster for each individual program execution. The objective of this optimization is the minimization of the intercluster traffic of an individual program execution. Within the optimal cluster, a simple load-balancing strategy is used to determine the corresponding executing node. A second optimization looks for file allocations where the global intercluster traffic is minimized subject to the following constraints: minimal number of file copies, availability, and storage capacity. Experimental results showing the efficiency of the proposed algorithms are examined, and the implications of the model for the design of very large distributed file systems are discussed."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">File organization (Computer science)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9122</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9122</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002964213</subfield></datafield></record></collection> |
| id | DE-604.BV004819263 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:18:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002964213 |
| oclc_num | 31897724 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 32 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Borghoff, Uwe M. 1959- Verfasser (DE-588)118121979 aut Towards an optimal design of distributed file systems Uwe M. Borghoff München 1991 32 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9122 Literaturverz. S. 25 - 28 Abstract: "In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-based approach is used. To access the data files, a user initiates a program execution. Based on the current allocation of the program and data files as well as the knowledge about the characteristics of the programs, a first optimization calculates the optimal cluster for each individual program execution. The objective of this optimization is the minimization of the intercluster traffic of an individual program execution. Within the optimal cluster, a simple load-balancing strategy is used to determine the corresponding executing node. A second optimization looks for file allocations where the global intercluster traffic is minimized subject to the following constraints: minimal number of file copies, availability, and storage capacity. Experimental results showing the efficiency of the proposed algorithms are examined, and the implications of the model for the design of very large distributed file systems are discussed." File organization (Computer science) Technische Universität <München>: TUM-I 9122 (DE-604)BV006185376 9122 |
| spellingShingle | Borghoff, Uwe M. 1959- Towards an optimal design of distributed file systems Technische Universität <München>: TUM-I File organization (Computer science) |
| title | Towards an optimal design of distributed file systems |
| title_auth | Towards an optimal design of distributed file systems |
| title_exact_search | Towards an optimal design of distributed file systems |
| title_full | Towards an optimal design of distributed file systems Uwe M. Borghoff |
| title_fullStr | Towards an optimal design of distributed file systems Uwe M. Borghoff |
| title_full_unstemmed | Towards an optimal design of distributed file systems Uwe M. Borghoff |
| title_short | Towards an optimal design of distributed file systems |
| title_sort | towards an optimal design of distributed file systems |
| topic | File organization (Computer science) |
| topic_facet | File organization (Computer science) |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT borghoffuwem towardsanoptimaldesignofdistributedfilesystems |