Quantifying the common computational problems in contemporary applications
To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is stu...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 74 |
|---|---|
| container_issue | |
| container_start_page | 74 |
| container_title | |
| container_volume | |
| creator | Jongerius, R. Stanley-Marbell, P. Corporaal, H. |
| description | To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is studied. This is augmented by insight into the properties permitting separation of problem definitions from algorithms for their solution. It is conjectured that, since a large fraction (55 %) of the analyzed body of existing software was identified as CPs, algorithmic choice may be a viable approach. |
| doi_str_mv | 10.1109/IISWC.2011.6114199 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6114199</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6114199</ieee_id><sourcerecordid>6114199</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-3a7c848914eddb3c1746ffd779b26d00b6674558d16bdc021031a194f81368543</originalsourceid><addsrcrecordid>eNo1T81OwzAYC0JIwOgLwKUv0JKv-fmSI6qAFU2aJkAcp7RJIag_UZsd9vZsMHyxLFuWTcgt0ByA6vuqev0o84IC5BKAg9Zn5Bq4QCyo5HhOEo3qXzNxSZJ5_qYHSKQUiivystmZIfp274fPNH65tBn7fhyOFHbRRD8OpkvDNNad6-fUH50huj6Mk5n2qQmh881vbL4hF63pZpeceEHenx7fymW2Wj9X5cMq84AiZsxgo7jSwJ21NWsAuWxbi6jrQlpKaymRC6EsyNo2tADKwIDmrQImleBsQe7-er1zbhsm3x-WbE_32Q9WT07T</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Quantifying the common computational problems in contemporary applications</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jongerius, R. ; Stanley-Marbell, P. ; Corporaal, H.</creator><creatorcontrib>Jongerius, R. ; Stanley-Marbell, P. ; Corporaal, H.</creatorcontrib><description>To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is studied. This is augmented by insight into the properties permitting separation of problem definitions from algorithms for their solution. It is conjectured that, since a large fraction (55 %) of the analyzed body of existing software was identified as CPs, algorithmic choice may be a viable approach.</description><identifier>ISBN: 9781457720635</identifier><identifier>ISBN: 1457720639</identifier><identifier>EISBN: 1457720647</identifier><identifier>EISBN: 9781457720642</identifier><identifier>EISBN: 9781457720628</identifier><identifier>EISBN: 1457720620</identifier><identifier>DOI: 10.1109/IISWC.2011.6114199</identifier><language>eng</language><publisher>IEEE</publisher><subject>Benchmark testing ; Inspection ; Manuals ; Software ; Software algorithms ; Viterbi algorithm</subject><ispartof>2011 IEEE International Symposium on Workload Characterization (IISWC), 2011, p.74-74</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6114199$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6114199$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jongerius, R.</creatorcontrib><creatorcontrib>Stanley-Marbell, P.</creatorcontrib><creatorcontrib>Corporaal, H.</creatorcontrib><title>Quantifying the common computational problems in contemporary applications</title><title>2011 IEEE International Symposium on Workload Characterization (IISWC)</title><addtitle>IISWC</addtitle><description>To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is studied. This is augmented by insight into the properties permitting separation of problem definitions from algorithms for their solution. It is conjectured that, since a large fraction (55 %) of the analyzed body of existing software was identified as CPs, algorithmic choice may be a viable approach.</description><subject>Benchmark testing</subject><subject>Inspection</subject><subject>Manuals</subject><subject>Software</subject><subject>Software algorithms</subject><subject>Viterbi algorithm</subject><isbn>9781457720635</isbn><isbn>1457720639</isbn><isbn>1457720647</isbn><isbn>9781457720642</isbn><isbn>9781457720628</isbn><isbn>1457720620</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1T81OwzAYC0JIwOgLwKUv0JKv-fmSI6qAFU2aJkAcp7RJIag_UZsd9vZsMHyxLFuWTcgt0ByA6vuqev0o84IC5BKAg9Zn5Bq4QCyo5HhOEo3qXzNxSZJ5_qYHSKQUiivystmZIfp274fPNH65tBn7fhyOFHbRRD8OpkvDNNad6-fUH50huj6Mk5n2qQmh881vbL4hF63pZpeceEHenx7fymW2Wj9X5cMq84AiZsxgo7jSwJ21NWsAuWxbi6jrQlpKaymRC6EsyNo2tADKwIDmrQImleBsQe7-er1zbhsm3x-WbE_32Q9WT07T</recordid><startdate>201111</startdate><enddate>201111</enddate><creator>Jongerius, R.</creator><creator>Stanley-Marbell, P.</creator><creator>Corporaal, H.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201111</creationdate><title>Quantifying the common computational problems in contemporary applications</title><author>Jongerius, R. ; Stanley-Marbell, P. ; Corporaal, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-3a7c848914eddb3c1746ffd779b26d00b6674558d16bdc021031a194f81368543</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Benchmark testing</topic><topic>Inspection</topic><topic>Manuals</topic><topic>Software</topic><topic>Software algorithms</topic><topic>Viterbi algorithm</topic><toplevel>online_resources</toplevel><creatorcontrib>Jongerius, R.</creatorcontrib><creatorcontrib>Stanley-Marbell, P.</creatorcontrib><creatorcontrib>Corporaal, H.</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 Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jongerius, R.</au><au>Stanley-Marbell, P.</au><au>Corporaal, H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Quantifying the common computational problems in contemporary applications</atitle><btitle>2011 IEEE International Symposium on Workload Characterization (IISWC)</btitle><stitle>IISWC</stitle><date>2011-11</date><risdate>2011</risdate><spage>74</spage><epage>74</epage><pages>74-74</pages><isbn>9781457720635</isbn><isbn>1457720639</isbn><eisbn>1457720647</eisbn><eisbn>9781457720642</eisbn><eisbn>9781457720628</eisbn><eisbn>1457720620</eisbn><abstract>To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is studied. This is augmented by insight into the properties permitting separation of problem definitions from algorithms for their solution. It is conjectured that, since a large fraction (55 %) of the analyzed body of existing software was identified as CPs, algorithmic choice may be a viable approach.</abstract><pub>IEEE</pub><doi>10.1109/IISWC.2011.6114199</doi><tpages>1</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781457720635 |
| ispartof | 2011 IEEE International Symposium on Workload Characterization (IISWC), 2011, p.74-74 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6114199 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Benchmark testing Inspection Manuals Software Software algorithms Viterbi algorithm |
| title | Quantifying the common computational problems in contemporary applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T20%3A29%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Quantifying%20the%20common%20computational%20problems%20in%20contemporary%20applications&rft.btitle=2011%20IEEE%20International%20Symposium%20on%20Workload%20Characterization%20(IISWC)&rft.au=Jongerius,%20R.&rft.date=2011-11&rft.spage=74&rft.epage=74&rft.pages=74-74&rft.isbn=9781457720635&rft.isbn_list=1457720639&rft_id=info:doi/10.1109/IISWC.2011.6114199&rft_dat=%3Cieee_6IE%3E6114199%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457720647&rft.eisbn_list=9781457720642&rft.eisbn_list=9781457720628&rft.eisbn_list=1457720620&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6114199&rfr_iscdi=true |