Optimal sorting in linear arrays with minimum global control:
Abstract: "We investigate linear sorting arrays with a single global control wire. We show that the lower bound on the necessary time to sort n numbers in such an array is 2n, in contrast to 3n in arrays without global control. We present a two-phase sorting algorithm for arrays with a global c...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,44 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We investigate linear sorting arrays with a single global control wire. We show that the lower bound on the necessary time to sort n numbers in such an array is 2n, in contrast to 3n in arrays without global control. We present a two-phase sorting algorithm for arrays with a global control wire that matches the time bound of 2n. As 2n is a lower bound for sorting arrays with sequential input and output, this implies that further global control cannot lead to any improvements as long as sequential I/O is assumed. The algorithm needs an array of minimum length [n/2]. The scheme can be easily extended to eliminate duplicate numbers. One possible application of the algorithm is in packet routing for algorithms that need presorted inputs." |
| Beschreibung: | 6 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015831 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28981999 | ||
| 035 | |a (DE-599)BVBBV009015831 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Abolhassan, Ferri |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal sorting in linear arrays with minimum global control |c Ferri Abolhassan ; Jörg Keller ; Dieter Scheerer |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 6 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 92,44 | |
| 520 | 3 | |a Abstract: "We investigate linear sorting arrays with a single global control wire. We show that the lower bound on the necessary time to sort n numbers in such an array is 2n, in contrast to 3n in arrays without global control. We present a two-phase sorting algorithm for arrays with a global control wire that matches the time bound of 2n. As 2n is a lower bound for sorting arrays with sequential input and output, this implies that further global control cannot lead to any improvements as long as sequential I/O is assumed. The algorithm needs an array of minimum length [n/2]. The scheme can be easily extended to eliminate duplicate numbers. One possible application of the algorithm is in packet routing for algorithms that need presorted inputs." | |
| 650 | 4 | |a Sorting (Electronic computers) | |
| 700 | 1 | |a Keller, Jörg |e Verfasser |4 aut | |
| 700 | 1 | |a Scheerer, Dieter |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,44 |w (DE-604)BV008928356 |9 92,44 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961361 | ||
Datensatz im Suchindex
| _version_ | 1804123365188829184 |
|---|---|
| any_adam_object | |
| author | Abolhassan, Ferri Keller, Jörg Scheerer, Dieter |
| author_facet | Abolhassan, Ferri Keller, Jörg Scheerer, Dieter |
| author_role | aut aut aut |
| author_sort | Abolhassan, Ferri |
| author_variant | f a fa j k jk d s ds |
| building | Verbundindex |
| bvnumber | BV009015831 |
| ctrlnum | (OCoLC)28981999 (DE-599)BVBBV009015831 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01863nam a2200313 cb4500</leader><controlfield tag="001">BV009015831</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28981999</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015831</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Abolhassan, Ferri</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal sorting in linear arrays with minimum global control</subfield><subfield code="c">Ferri Abolhassan ; Jörg Keller ; Dieter Scheerer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">92,44</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We investigate linear sorting arrays with a single global control wire. We show that the lower bound on the necessary time to sort n numbers in such an array is 2n, in contrast to 3n in arrays without global control. We present a two-phase sorting algorithm for arrays with a global control wire that matches the time bound of 2n. As 2n is a lower bound for sorting arrays with sequential input and output, this implies that further global control cannot lead to any improvements as long as sequential I/O is assumed. The algorithm needs an array of minimum length [n/2]. The scheme can be easily extended to eliminate duplicate numbers. One possible application of the algorithm is in packet routing for algorithms that need presorted inputs."</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">Keller, Jörg</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Scheerer, Dieter</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: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">92,44</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,44</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961361</subfield></datafield></record></collection> |
| id | DE-604.BV009015831 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961361 |
| oclc_num | 28981999 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 6 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Abolhassan, Ferri Verfasser aut Optimal sorting in linear arrays with minimum global control Ferri Abolhassan ; Jörg Keller ; Dieter Scheerer Amsterdam 1992 6 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,44 Abstract: "We investigate linear sorting arrays with a single global control wire. We show that the lower bound on the necessary time to sort n numbers in such an array is 2n, in contrast to 3n in arrays without global control. We present a two-phase sorting algorithm for arrays with a global control wire that matches the time bound of 2n. As 2n is a lower bound for sorting arrays with sequential input and output, this implies that further global control cannot lead to any improvements as long as sequential I/O is assumed. The algorithm needs an array of minimum length [n/2]. The scheme can be easily extended to eliminate duplicate numbers. One possible application of the algorithm is in packet routing for algorithms that need presorted inputs." Sorting (Electronic computers) Keller, Jörg Verfasser aut Scheerer, Dieter Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,44 (DE-604)BV008928356 92,44 |
| spellingShingle | Abolhassan, Ferri Keller, Jörg Scheerer, Dieter Optimal sorting in linear arrays with minimum global control Sorting (Electronic computers) |
| title | Optimal sorting in linear arrays with minimum global control |
| title_auth | Optimal sorting in linear arrays with minimum global control |
| title_exact_search | Optimal sorting in linear arrays with minimum global control |
| title_full | Optimal sorting in linear arrays with minimum global control Ferri Abolhassan ; Jörg Keller ; Dieter Scheerer |
| title_fullStr | Optimal sorting in linear arrays with minimum global control Ferri Abolhassan ; Jörg Keller ; Dieter Scheerer |
| title_full_unstemmed | Optimal sorting in linear arrays with minimum global control Ferri Abolhassan ; Jörg Keller ; Dieter Scheerer |
| title_short | Optimal sorting in linear arrays with minimum global control |
| title_sort | optimal sorting in linear arrays with minimum global control |
| topic | Sorting (Electronic computers) |
| topic_facet | Sorting (Electronic computers) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT abolhassanferri optimalsortinginlineararrayswithminimumglobalcontrol AT kellerjorg optimalsortinginlineararrayswithminimumglobalcontrol AT scheererdieter optimalsortinginlineararrayswithminimumglobalcontrol |