Sorting large files on a backend multiprocessor:
A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity and I/O bandwidth. In this paper, we investi...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
741 |
| Schlagworte: | |
| Zusammenfassung: | A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity and I/O bandwidth. In this paper, we investigate the feasibility and efficiency of a parallel sort-merge algorithm through implementation on the JASMIN prototype, a backend multiprocessor built around a fast packet bus. We describe the design and implementation of a parallel sort utility that may become a building block for query processing in a database system that runs on JASMIN. We present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. Our results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three and five microprocessor configurations provide a very cost-effective sort of large files. The three processor configuration sorts a 100 megabyte file in one hour, which compares well with commercial sort packages available on high-performance mainframes. In additional experiments, we investigate a model to tune our sort software, and scale our results to higher processor and network capabilities. |
| Beschreibung: | 27 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594331 | ||
| 003 | DE-604 | ||
| 005 | 19960201 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)14556822 | ||
| 035 | |a (DE-599)BVBBV010594331 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Beck, Micah |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Sorting large files on a backend multiprocessor |c Micah Beck ; Dina Bitton ; W. Kevin Wilkinson |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 27 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 741 | |
| 520 | 3 | |a A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity and I/O bandwidth. In this paper, we investigate the feasibility and efficiency of a parallel sort-merge algorithm through implementation on the JASMIN prototype, a backend multiprocessor built around a fast packet bus. We describe the design and implementation of a parallel sort utility that may become a building block for query processing in a database system that runs on JASMIN. We present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. Our results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three and five microprocessor configurations provide a very cost-effective sort of large files. The three processor configuration sorts a 100 megabyte file in one hour, which compares well with commercial sort packages available on high-performance mainframes. In additional experiments, we investigate a model to tune our sort software, and scale our results to higher processor and network capabilities. | |
| 650 | 4 | |a Database management | |
| 650 | 4 | |a File organization (Computer science) | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 700 | 1 | |a Bitton, Dina |e Verfasser |4 aut | |
| 700 | 1 | |a Wilkinson, William K. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 741 |w (DE-604)BV006185504 |9 741 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007064963 | ||
Datensatz im Suchindex
| _version_ | 1804125065570156545 |
|---|---|
| any_adam_object | |
| author | Beck, Micah Bitton, Dina Wilkinson, William K. |
| author_facet | Beck, Micah Bitton, Dina Wilkinson, William K. |
| author_role | aut aut aut |
| author_sort | Beck, Micah |
| author_variant | m b mb d b db w k w wk wkw |
| building | Verbundindex |
| bvnumber | BV010594331 |
| ctrlnum | (OCoLC)14556822 (DE-599)BVBBV010594331 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02445nam a2200337 cb4500</leader><controlfield tag="001">BV010594331</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960201 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14556822</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594331</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beck, Micah</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sorting large files on a backend multiprocessor</subfield><subfield code="c">Micah Beck ; Dina Bitton ; W. Kevin Wilkinson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 S.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">741</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity and I/O bandwidth. In this paper, we investigate the feasibility and efficiency of a parallel sort-merge algorithm through implementation on the JASMIN prototype, a backend multiprocessor built around a fast packet bus. We describe the design and implementation of a parallel sort utility that may become a building block for query processing in a database system that runs on JASMIN. We present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. Our results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three and five microprocessor configurations provide a very cost-effective sort of large files. The three processor configuration sorts a 100 megabyte file in one hour, which compares well with commercial sort packages available on high-performance mainframes. In additional experiments, we investigate a model to tune our sort software, and scale our results to higher processor and network capabilities.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">File organization (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sorting (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bitton, Dina</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilkinson, William K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">741</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">741</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007064963</subfield></datafield></record></collection> |
| id | DE-604.BV010594331 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007064963 |
| oclc_num | 14556822 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 27 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Beck, Micah Verfasser aut Sorting large files on a backend multiprocessor Micah Beck ; Dina Bitton ; W. Kevin Wilkinson Ithaca, New York 1986 27 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 741 A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity and I/O bandwidth. In this paper, we investigate the feasibility and efficiency of a parallel sort-merge algorithm through implementation on the JASMIN prototype, a backend multiprocessor built around a fast packet bus. We describe the design and implementation of a parallel sort utility that may become a building block for query processing in a database system that runs on JASMIN. We present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. Our results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three and five microprocessor configurations provide a very cost-effective sort of large files. The three processor configuration sorts a 100 megabyte file in one hour, which compares well with commercial sort packages available on high-performance mainframes. In additional experiments, we investigate a model to tune our sort software, and scale our results to higher processor and network capabilities. Database management File organization (Computer science) Sorting (Electronic computers) Bitton, Dina Verfasser aut Wilkinson, William K. Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 741 (DE-604)BV006185504 741 |
| spellingShingle | Beck, Micah Bitton, Dina Wilkinson, William K. Sorting large files on a backend multiprocessor Database management File organization (Computer science) Sorting (Electronic computers) |
| title | Sorting large files on a backend multiprocessor |
| title_auth | Sorting large files on a backend multiprocessor |
| title_exact_search | Sorting large files on a backend multiprocessor |
| title_full | Sorting large files on a backend multiprocessor Micah Beck ; Dina Bitton ; W. Kevin Wilkinson |
| title_fullStr | Sorting large files on a backend multiprocessor Micah Beck ; Dina Bitton ; W. Kevin Wilkinson |
| title_full_unstemmed | Sorting large files on a backend multiprocessor Micah Beck ; Dina Bitton ; W. Kevin Wilkinson |
| title_short | Sorting large files on a backend multiprocessor |
| title_sort | sorting large files on a backend multiprocessor |
| topic | Database management File organization (Computer science) Sorting (Electronic computers) |
| topic_facet | Database management File organization (Computer science) Sorting (Electronic computers) |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT beckmicah sortinglargefilesonabackendmultiprocessor AT bittondina sortinglargefilesonabackendmultiprocessor AT wilkinsonwilliamk sortinglargefilesonabackendmultiprocessor |