Quantitative Analysis of Run-Time Reconfigurable Database Search
This paper reports two contributions to the theory and practice of reconfigurable search engines based on hashing techniques. The first contribution concerns technology-independent optimisations involving run-time reconfiguration of hash functions; a quantitative framework is developed for estimatin...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 263 |
|---|---|
| container_issue | |
| container_start_page | 253 |
| container_title | |
| container_volume | |
| creator | Shirazi, N. Luk, W. Benyamin, D. Cheung, P. Y. K. |
| description | This paper reports two contributions to the theory and practice of reconfigurable search engines based on hashing techniques. The first contribution concerns technology-independent optimisations involving run-time reconfiguration of hash functions; a quantitative framework is developed for estimating design trade-offs, such as the amount of temporary storage versus reconfiguration time. The second contribution concerns methods for optimising implementations in Xilinx FPGA technology, which achieve different trade-offs in cell utilisation, reconfiguration time and critical path delay; quantitative analysis of these trade-offs is provided. |
| doi_str_mv | 10.1007/978-3-540-48302-1_26 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1827811</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3087807_31_269</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1866-b926433b843250211074c7c2eb52d6f3ffc2c7bd6c7fd2db5dc47855ba43bb1e3</originalsourceid><addsrcrecordid>eNotkLtOwzAUhs1VlNI3YMjAarB9HNvZqLhLSIhSZst2nDaQJsVOkfr2OLRnOdJ_Gz6ELim5poTIm0IqDDjnBHMFhGGqmThA55CUf4EcohEVlGIAXhztDCF4LtkxGpGhUUgOp2hUJF8WBcnP0CTGL5IOGFAqR-j2fWPavu5NX__6bNqaZhvrmHVVNtu0eF6vfDbzrmurerEJxjY-uze9sSb67MOb4JYX6KQyTfST_R-jz8eH-d0zfn17ermbvuI1VUJgWzDBAaziwHLCKCWSO-mYtzkrRQVV5ZiTthROViUrbV46LlWeW8PBWuphjK52u2sTnWmqYFpXR70O9cqEraaKSUVpirFdLCanXfigbdd9R02JHpjqxFSDTqD0P0I9ME0l2G-H7mfjY6_90HK-7YNp3NKsex-iBqKkShswlAr4A0_9dD0</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3087807_31_269</pqid></control><display><type>book_chapter</type><title>Quantitative Analysis of Run-Time Reconfigurable Database Search</title><source>Springer Books</source><creator>Shirazi, N. ; Luk, W. ; Benyamin, D. ; Cheung, P. Y. K.</creator><contributor>Goos, Gerhard ; Hartmanis, Juris ; van Leeuwen, Jan ; Hartenstein, Reiner ; Lysaght, Patrick ; Irvine, James</contributor><creatorcontrib>Shirazi, N. ; Luk, W. ; Benyamin, D. ; Cheung, P. Y. K. ; Goos, Gerhard ; Hartmanis, Juris ; van Leeuwen, Jan ; Hartenstein, Reiner ; Lysaght, Patrick ; Irvine, James</creatorcontrib><description>This paper reports two contributions to the theory and practice of reconfigurable search engines based on hashing techniques. The first contribution concerns technology-independent optimisations involving run-time reconfiguration of hash functions; a quantitative framework is developed for estimating design trade-offs, such as the amount of temporary storage versus reconfiguration time. The second contribution concerns methods for optimising implementations in Xilinx FPGA technology, which achieve different trade-offs in cell utilisation, reconfiguration time and critical path delay; quantitative analysis of these trade-offs is provided.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540664572</identifier><identifier>ISBN: 9783540664574</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540483020</identifier><identifier>EISBN: 9783540483021</identifier><identifier>DOI: 10.1007/978-3-540-48302-1_26</identifier><identifier>OCLC: 934979905</identifier><identifier>LCCallNum: TK7895.G36.F545 1999</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems performance. Reliability ; Exact sciences and technology ; Execution Time ; Hash Function ; Software ; Temporary Memory ; Temporary Storage ; Total Execution Time</subject><ispartof>Field Programmable Logic and Applications, 1999, p.253-263</ispartof><rights>Springer-Verlag Berlin Heidelberg 1999</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3087807-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-48302-1_26$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-48302-1_26$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1827811$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Goos, Gerhard</contributor><contributor>Hartmanis, Juris</contributor><contributor>van Leeuwen, Jan</contributor><contributor>Hartenstein, Reiner</contributor><contributor>Lysaght, Patrick</contributor><contributor>Irvine, James</contributor><creatorcontrib>Shirazi, N.</creatorcontrib><creatorcontrib>Luk, W.</creatorcontrib><creatorcontrib>Benyamin, D.</creatorcontrib><creatorcontrib>Cheung, P. Y. K.</creatorcontrib><title>Quantitative Analysis of Run-Time Reconfigurable Database Search</title><title>Field Programmable Logic and Applications</title><description>This paper reports two contributions to the theory and practice of reconfigurable search engines based on hashing techniques. The first contribution concerns technology-independent optimisations involving run-time reconfiguration of hash functions; a quantitative framework is developed for estimating design trade-offs, such as the amount of temporary storage versus reconfiguration time. The second contribution concerns methods for optimising implementations in Xilinx FPGA technology, which achieve different trade-offs in cell utilisation, reconfiguration time and critical path delay; quantitative analysis of these trade-offs is provided.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems performance. Reliability</subject><subject>Exact sciences and technology</subject><subject>Execution Time</subject><subject>Hash Function</subject><subject>Software</subject><subject>Temporary Memory</subject><subject>Temporary Storage</subject><subject>Total Execution Time</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540664572</isbn><isbn>9783540664574</isbn><isbn>3540483020</isbn><isbn>9783540483021</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1999</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkLtOwzAUhs1VlNI3YMjAarB9HNvZqLhLSIhSZst2nDaQJsVOkfr2OLRnOdJ_Gz6ELim5poTIm0IqDDjnBHMFhGGqmThA55CUf4EcohEVlGIAXhztDCF4LtkxGpGhUUgOp2hUJF8WBcnP0CTGL5IOGFAqR-j2fWPavu5NX__6bNqaZhvrmHVVNtu0eF6vfDbzrmurerEJxjY-uze9sSb67MOb4JYX6KQyTfST_R-jz8eH-d0zfn17ermbvuI1VUJgWzDBAaziwHLCKCWSO-mYtzkrRQVV5ZiTthROViUrbV46LlWeW8PBWuphjK52u2sTnWmqYFpXR70O9cqEraaKSUVpirFdLCanXfigbdd9R02JHpjqxFSDTqD0P0I9ME0l2G-H7mfjY6_90HK-7YNp3NKsex-iBqKkShswlAr4A0_9dD0</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Shirazi, N.</creator><creator>Luk, W.</creator><creator>Benyamin, D.</creator><creator>Cheung, P. Y. K.</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>1999</creationdate><title>Quantitative Analysis of Run-Time Reconfigurable Database Search</title><author>Shirazi, N. ; Luk, W. ; Benyamin, D. ; Cheung, P. Y. K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1866-b926433b843250211074c7c2eb52d6f3ffc2c7bd6c7fd2db5dc47855ba43bb1e3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems performance. Reliability</topic><topic>Exact sciences and technology</topic><topic>Execution Time</topic><topic>Hash Function</topic><topic>Software</topic><topic>Temporary Memory</topic><topic>Temporary Storage</topic><topic>Total Execution Time</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shirazi, N.</creatorcontrib><creatorcontrib>Luk, W.</creatorcontrib><creatorcontrib>Benyamin, D.</creatorcontrib><creatorcontrib>Cheung, P. Y. K.</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shirazi, N.</au><au>Luk, W.</au><au>Benyamin, D.</au><au>Cheung, P. Y. K.</au><au>Goos, Gerhard</au><au>Hartmanis, Juris</au><au>van Leeuwen, Jan</au><au>Hartenstein, Reiner</au><au>Lysaght, Patrick</au><au>Irvine, James</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Quantitative Analysis of Run-Time Reconfigurable Database Search</atitle><btitle>Field Programmable Logic and Applications</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1999</date><risdate>1999</risdate><spage>253</spage><epage>263</epage><pages>253-263</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540664572</isbn><isbn>9783540664574</isbn><eisbn>3540483020</eisbn><eisbn>9783540483021</eisbn><abstract>This paper reports two contributions to the theory and practice of reconfigurable search engines based on hashing techniques. The first contribution concerns technology-independent optimisations involving run-time reconfiguration of hash functions; a quantitative framework is developed for estimating design trade-offs, such as the amount of temporary storage versus reconfiguration time. The second contribution concerns methods for optimising implementations in Xilinx FPGA technology, which achieve different trade-offs in cell utilisation, reconfiguration time and critical path delay; quantitative analysis of these trade-offs is provided.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-48302-1_26</doi><oclcid>934979905</oclcid><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Field Programmable Logic and Applications, 1999, p.253-263 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1827811 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Computer systems performance. Reliability Exact sciences and technology Execution Time Hash Function Software Temporary Memory Temporary Storage Total Execution Time |
| title | Quantitative Analysis of Run-Time Reconfigurable Database Search |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T21%3A22%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Quantitative%20Analysis%20of%20Run-Time%20Reconfigurable%20Database%20Search&rft.btitle=Field%20Programmable%20Logic%20and%20Applications&rft.au=Shirazi,%20N.&rft.date=1999&rft.spage=253&rft.epage=263&rft.pages=253-263&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540664572&rft.isbn_list=9783540664574&rft_id=info:doi/10.1007/978-3-540-48302-1_26&rft_dat=%3Cproquest_pasca%3EEBC3087807_31_269%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540483020&rft.eisbn_list=9783540483021&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3087807_31_269&rft_id=info:pmid/&rfr_iscdi=true |