A computer assisted optimal depth lower bound for sorting networks with nine inputs
It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: |
Computing methodologies
> Modeling and simulation
> Simulation types and techniques
> Massively parallel and high-performance simulations
Software and its engineering
> Software organization and properties
> Software system structures
> Distributed systems organizing principles
> Grid computing
|
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 161 |
---|---|
container_issue | |
container_start_page | 152 |
container_title | |
container_volume | |
creator | Parberry, I. |
description | It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than mathematics. In keeping with the paradigms of experimental science, a high-level description of the experiment and analysis of the result are given. |
doi_str_mv | 10.1145/76263.76280 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>proquest_6IE</sourceid><recordid>TN_cdi_acm_books_10_1145_76263_76280_brief</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5349039</ieee_id><sourcerecordid>31095045</sourcerecordid><originalsourceid>FETCH-LOGICAL-a1520-e7a458800c45ab7a6a8c2278fa31cec906e4066fa0ec200860d8b783f2d5820a3</originalsourceid><addsrcrecordid>eNqNkD9PwzAQxS0hJFDpxMjiATEgtZzj2LHHCvFPqsQAzJbjXMA0jYOdqOLbY1o-ADfcDe-np3uPkHMGS8ZKcVPJQvJl3gqOyFxXCpSuNOMlkydkntIn5BFCKc1OycuKurAdphEjtSn5NGJDwzD6re1og8P4Qbuwy2Idpr6hbYg0hTj6_p32OO5C3CS685nqfY_U99kpnZHj1nYJ5393Rt7u715vHxfr54en29V6YZkoYIGVLfMXAK4Utq6stMoVRaVay5lDp0FiCVK2FtAVAEpCo-pK8bZohCrA8hm5OvgOMXxNmEaz9clh19kew5QMZ6AFlCKDFwfQI6IZYg4Xv43gpQaus3p5UK3bmjqETTIMzG-VZl-l2VeZset_YKaOHlv-A08rcm0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>31095045</pqid></control><display><type>conference_proceeding</type><title>A computer assisted optimal depth lower bound for sorting networks with nine inputs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Parberry, I.</creator><creatorcontrib>Parberry, I.</creatorcontrib><description>It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than mathematics. In keeping with the paradigms of experimental science, a high-level description of the experiment and analysis of the result are given.</description><identifier>ISBN: 9780897913416</identifier><identifier>ISBN: 0897913418</identifier><identifier>DOI: 10.1145/76263.76280</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Computer networks ; Computer systems organization -- Architectures -- Distributed architectures -- Grid computing ; Computer systems organization -- Architectures -- Parallel architectures ; Computer systems organization -- Architectures -- Parallel architectures -- Cellular architectures ; Computer systems organization -- Architectures -- Parallel architectures -- Multicore architectures ; Computer systems organization -- Architectures -- Serial architectures -- Superscalar architectures ; Computing methodologies -- Modeling and simulation -- Simulation types and techniques -- Massively parallel and high-performance simulations ; Hardware -- Emerging technologies -- Quantum technologies -- Quantum dots and cellular automata ; Software and its engineering -- Software organization and properties -- Software system structures -- Distributed systems organizing principles -- Grid computing ; Sorting ; Theory of computation -- Design and analysis of algorithms -- Data structures design and analysis -- Sorting and searching ; Theory of computation -- Models of computation</subject><ispartof>Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89), 1989, p.152-161</ispartof><rights>1989 ACM</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5349039$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5349039$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Parberry, I.</creatorcontrib><title>A computer assisted optimal depth lower bound for sorting networks with nine inputs</title><title>Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89)</title><addtitle>sc</addtitle><description>It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than mathematics. In keeping with the paradigms of experimental science, a high-level description of the experiment and analysis of the result are given.</description><subject>Computer networks</subject><subject>Computer systems organization -- Architectures -- Distributed architectures -- Grid computing</subject><subject>Computer systems organization -- Architectures -- Parallel architectures</subject><subject>Computer systems organization -- Architectures -- Parallel architectures -- Cellular architectures</subject><subject>Computer systems organization -- Architectures -- Parallel architectures -- Multicore architectures</subject><subject>Computer systems organization -- Architectures -- Serial architectures -- Superscalar architectures</subject><subject>Computing methodologies -- Modeling and simulation -- Simulation types and techniques -- Massively parallel and high-performance simulations</subject><subject>Hardware -- Emerging technologies -- Quantum technologies -- Quantum dots and cellular automata</subject><subject>Software and its engineering -- Software organization and properties -- Software system structures -- Distributed systems organizing principles -- Grid computing</subject><subject>Sorting</subject><subject>Theory of computation -- Design and analysis of algorithms -- Data structures design and analysis -- Sorting and searching</subject><subject>Theory of computation -- Models of computation</subject><isbn>9780897913416</isbn><isbn>0897913418</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1989</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNqNkD9PwzAQxS0hJFDpxMjiATEgtZzj2LHHCvFPqsQAzJbjXMA0jYOdqOLbY1o-ADfcDe-np3uPkHMGS8ZKcVPJQvJl3gqOyFxXCpSuNOMlkydkntIn5BFCKc1OycuKurAdphEjtSn5NGJDwzD6re1og8P4Qbuwy2Idpr6hbYg0hTj6_p32OO5C3CS685nqfY_U99kpnZHj1nYJ5393Rt7u715vHxfr54en29V6YZkoYIGVLfMXAK4Utq6stMoVRaVay5lDp0FiCVK2FtAVAEpCo-pK8bZohCrA8hm5OvgOMXxNmEaz9clh19kew5QMZ6AFlCKDFwfQI6IZYg4Xv43gpQaus3p5UK3bmjqETTIMzG-VZl-l2VeZset_YKaOHlv-A08rcm0</recordid><startdate>19891101</startdate><enddate>19891101</enddate><creator>Parberry, I.</creator><general>ACM</general><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19891101</creationdate><title>A computer assisted optimal depth lower bound for sorting networks with nine inputs</title><author>Parberry, I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a1520-e7a458800c45ab7a6a8c2278fa31cec906e4066fa0ec200860d8b783f2d5820a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Computer networks</topic><topic>Computer systems organization -- Architectures -- Distributed architectures -- Grid computing</topic><topic>Computer systems organization -- Architectures -- Parallel architectures</topic><topic>Computer systems organization -- Architectures -- Parallel architectures -- Cellular architectures</topic><topic>Computer systems organization -- Architectures -- Parallel architectures -- Multicore architectures</topic><topic>Computer systems organization -- Architectures -- Serial architectures -- Superscalar architectures</topic><topic>Computing methodologies -- Modeling and simulation -- Simulation types and techniques -- Massively parallel and high-performance simulations</topic><topic>Hardware -- Emerging technologies -- Quantum technologies -- Quantum dots and cellular automata</topic><topic>Software and its engineering -- Software organization and properties -- Software system structures -- Distributed systems organizing principles -- Grid computing</topic><topic>Sorting</topic><topic>Theory of computation -- Design and analysis of algorithms -- Data structures design and analysis -- Sorting and searching</topic><topic>Theory of computation -- Models of computation</topic><toplevel>online_resources</toplevel><creatorcontrib>Parberry, I.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Parberry, I.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A computer assisted optimal depth lower bound for sorting networks with nine inputs</atitle><btitle>Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89)</btitle><stitle>sc</stitle><date>1989-11-01</date><risdate>1989</risdate><spage>152</spage><epage>161</epage><pages>152-161</pages><isbn>9780897913416</isbn><isbn>0897913418</isbn><abstract>It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than mathematics. In keeping with the paradigms of experimental science, a high-level description of the experiment and analysis of the result are given.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/76263.76280</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9780897913416 |
ispartof | Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89), 1989, p.152-161 |
issn | |
language | eng |
recordid | cdi_acm_books_10_1145_76263_76280_brief |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Computer networks Computer systems organization -- Architectures -- Distributed architectures -- Grid computing Computer systems organization -- Architectures -- Parallel architectures Computer systems organization -- Architectures -- Parallel architectures -- Cellular architectures Computer systems organization -- Architectures -- Parallel architectures -- Multicore architectures Computer systems organization -- Architectures -- Serial architectures -- Superscalar architectures Computing methodologies -- Modeling and simulation -- Simulation types and techniques -- Massively parallel and high-performance simulations Hardware -- Emerging technologies -- Quantum technologies -- Quantum dots and cellular automata Software and its engineering -- Software organization and properties -- Software system structures -- Distributed systems organizing principles -- Grid computing Sorting Theory of computation -- Design and analysis of algorithms -- Data structures design and analysis -- Sorting and searching Theory of computation -- Models of computation |
title | A computer assisted optimal depth lower bound for sorting networks with nine inputs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T07%3A34%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20computer%20assisted%20optimal%20depth%20lower%20bound%20for%20sorting%20networks%20with%20nine%20inputs&rft.btitle=Proceedings%20of%20the%201989%20ACM/IEEE%20Conference%20on%20Supercomputing%20(Supercomputing%20'89)&rft.au=Parberry,%20I.&rft.date=1989-11-01&rft.spage=152&rft.epage=161&rft.pages=152-161&rft.isbn=9780897913416&rft.isbn_list=0897913418&rft_id=info:doi/10.1145/76263.76280&rft_dat=%3Cproquest_6IE%3E31095045%3C/proquest_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=31095045&rft_id=info:pmid/&rft_ieee_id=5349039&rfr_iscdi=true |