WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
Identifieur interne : 001074 ( Istex/Corpus ); précédent : 001073; suivant : 001075WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
Auteurs : Christoph Meinel ; Harald Sack ; Arno WagnerSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2002.
Abstract
Abstract: There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.
Url:
DOI: 10.1007/3-540-36383-1_6
Links to Exploration step
ISTEX:529C253E2D464E525FBE7425A7EF571C091B3AC0Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: meinel@ti.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name><affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: sack@ti.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Wagner, Arno" sort="Wagner, Arno" uniqKey="Wagner A" first="Arno" last="Wagner">Arno Wagner</name><affiliation><mods:affiliation>Institute TIK, ETH Zürich, Gloriastr. 35, CH-8092, Zuerich, Switzerland</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: wagner@tik.ee.ethz.ch</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:529C253E2D464E525FBE7425A7EF571C091B3AC0</idno><date when="2002" year="2002">2002</date><idno type="doi">10.1007/3-540-36383-1_6</idno><idno type="url">https://api.istex.fr/document/529C253E2D464E525FBE7425A7EF571C091B3AC0/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001074</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001074</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: meinel@ti.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name><affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: sack@ti.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Wagner, Arno" sort="Wagner, Arno" uniqKey="Wagner A" first="Arno" last="Wagner">Arno Wagner</name><affiliation><mods:affiliation>Institute TIK, ETH Zürich, Gloriastr. 35, CH-8092, Zuerich, Switzerland</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: wagner@tik.ee.ethz.ch</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2002</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">529C253E2D464E525FBE7425A7EF571C091B3AC0</idno><idno type="DOI">10.1007/3-540-36383-1_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Christoph Meinel</name><affiliations><json:string>Dept. of Computer Science, University of Trier, Trier, Germany</json:string><json:string>E-mail: meinel@ti.uni-trier.de</json:string></affiliations></json:item><json:item><name>Harald Sack</name><affiliations><json:string>Dept. of Computer Science, University of Trier, Trier, Germany</json:string><json:string>E-mail: sack@ti.uni-trier.de</json:string></affiliations></json:item><json:item><name>Arno Wagner</name><affiliations><json:string>Institute TIK, ETH Zürich, Gloriastr. 35, CH-8092, Zuerich, Switzerland</json:string><json:string>E-mail: wagner@tik.ee.ethz.ch</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.</abstract><qualityIndicators><score>5.877</score><pdfVersion>1.3</pdfVersion><pdfPageSize>558 x 864 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>970</abstractCharCount><pdfWordCount>4173</pdfWordCount><pdfCharCount>24941</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>142</abstractWordCount></qualityIndicators><title>WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title><chapterId><json:string>6</json:string><json:string>Chap6</json:string></chapterId><refBibs><json:item><host><author><json:item><name>A Bogliolo</name></json:item><json:item><name>L Benini</name></json:item><json:item><name>G De</name></json:item><json:item><name>B Micheli</name></json:item><json:item><name> Riccó</name></json:item></author><title>PPP: A gate-level power simulator — a World Wide Web application</title><publicationDate>1996</publicationDate></host></json:item><json:item><author><json:item><name>B Bollig</name></json:item><json:item><name>M Löbbing</name></json:item><json:item><name>I Wegener</name></json:item></author><host><author></author><title>Proceedings of IWLS'95, Lake Tahoe</title><publicationDate>1995</publicationDate></host><title>Simulated annealing to improve variable orderings for OBDDs</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>R,K Brayton</name></json:item><json:item><name>G,D Hachtel</name></json:item><json:item><name>A Sangiovanni-Vincenteli</name></json:item><json:item><name>F Somenzi</name></json:item></author><host><pages><last>432</last><first>428</first></pages><author></author><title>Proceedings of Computer- Aided Verification</title><publicationDate>1996</publicationDate></host><title>VIS: a system for verification and synthesis</title><publicationDate>1996</publicationDate></json:item><json:item><author><json:item><name>F Brglez</name></json:item><json:item><name>D Bryan</name></json:item><json:item><name>K Kozminski</name></json:item></author><host><pages><last>1934</last><first>1929</first></pages><author></author><title>Proceedings of the IEEE International Symposium on Circuits and Systems</title><publicationDate>1989-03</publicationDate></host><title>Combinational profiles of sequential benchmark circuits</title><publicationDate>1989-03</publicationDate></json:item><json:item><author><json:item><name>R Drechsler</name></json:item><json:item><name>B Becker</name></json:item><json:item><name>N Göckel</name></json:item></author><host><author></author><title>Proceedings of IWLS'95, Lake Tahoe</title><publicationDate>1995</publicationDate></host><title>A genetic algorithm for variable reordering of OBDDs</title><publicationDate>1995</publicationDate></json:item><json:item><author><json:item><name>H Higuchi</name></json:item><json:item><name>F Somenzi</name></json:item></author><host><pages><last>49</last><first>45</first></pages><author></author><title>Procceedings of ICCAD'99</title><publicationDate>1999</publicationDate></host><title>Lazy group sifting for efficient symbolic state traversal of FSMs</title><publicationDate>1999</publicationDate></json:item><json:item><host><pages><last>192</last><first>182</first></pages><author><json:item><name>S Höreth</name></json:item></author><title>A word-level graph manipulation package Software Tools For Technology Transfer</title><publicationDate>2001</publicationDate></host></json:item><json:item><author><json:item><name>D Ku</name></json:item></author><host><author></author><title>Procceedings of IC- CAD'97</title><publicationDate>1997</publicationDate></host><title>Embedded tutorial: EDA and the network</title><publicationDate>1997</publicationDate></json:item><json:item><author><json:item><name>S Lawrence</name></json:item><json:item><name>C,L Gilles</name></json:item></author><host><pages><first>400</first></pages><issue>6740</issue><author></author><title>Nature</title><publicationDate>1999</publicationDate></host><title>Accessibility of information on the web</title><publicationDate>1999</publicationDate></json:item><json:item><author><json:item><name>C Meinel</name></json:item><json:item><name>F Somenzi</name></json:item><json:item><name>T Theobald</name></json:item></author><host><pages><last>86</last><first>81</first></pages><author></author><title>Proceedings of ASP-DAC'98</title><publicationDate>1998</publicationDate></host><title>Functional decomposition and synthesis using linear sifting</title><publicationDate>1998</publicationDate></json:item><json:item><host><author><json:item><name>C Meinel</name></json:item><json:item><name>T Theobald</name></json:item></author><title>Algorithms and Data Structures in VLSI Design</title><publicationDate>1998</publicationDate></host></json:item><json:item><author><json:item><name>C Meinel</name></json:item><json:item><name>A Wagner</name></json:item></author><host><author></author><title>Proceedings of IWLS'99</title><publicationDate>1999</publicationDate></host><title>OBDD heuristics online</title><publicationDate>1999</publicationDate></json:item><json:item><author><json:item><name>C Meinel</name></json:item><json:item><name>A Wagner</name></json:item><json:item><name> Www</name></json:item><json:item><name> Bdd-Portal</name></json:item><json:item><name> Org</name></json:item></author><host><pages><last>353</last><first>349</first></pages><author></author><title>Proceedings of IWLS'00</title><publicationDate>2000</publicationDate></host><publicationDate>2000</publicationDate></json:item><json:item><author><json:item><name>C Meinel</name></json:item><json:item><name>A Wagner</name></json:item><json:item><name> Www</name></json:item><json:item><name> Bdd-Portal</name></json:item></author><host><author></author><title>Proceedings of CRIS'00</title><publicationDate>2000</publicationDate></host><title>ORG — an electronical basis for cooperative research in EDA</title><publicationDate>2000</publicationDate></json:item><json:item><host><author></author><title>Formal Methods — Model Checking</title></host></json:item><json:item><author><json:item><name>M,J Silva</name></json:item><json:item><name>R,H Katz</name></json:item></author><host><author></author><title>Procceedings of the 32th Design Automation Conference</title><publicationDate>1995</publicationDate></host><title>The case for design using the World Wide Web</title><publicationDate>1995</publicationDate></json:item><json:item><host><author><json:item><name>F Somenzi</name></json:item></author><title>Colorado University Decision Diagram Package</title><publicationDate>1996</publicationDate></host></json:item></refBibs><genre><json:string>research-article</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2002</copyrightDate></serie><host><editor><json:item><name>Rudolf Fleischer</name><affiliations><json:string>Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong</json:string><json:string>E-mail: rudolf@cs.ust.hk</json:string></affiliations></json:item><json:item><name>Bernard Moret</name><affiliations><json:string>Department of Computer Science, University of New Mexico, Farris Engineering Bldg, 87131-1386, Albuquerque, NM, USA</json:string><json:string>E-mail: moret@cs.unm.edu</json:string></affiliations></json:item><json:item><name>Erik Meineche Schmidt</name><affiliations><json:string>Department of Computer Science, University of Aarhus, Bld. 540, Ny Munkegade, 8000, Aarhus C, Denmark</json:string><json:string>E-mail: ems@daimi.au.dk</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science, general</value></json:item><json:item><value>Data Structures</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Numeric Computing</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Algorithms</value></json:item></subject><isbn><json:string>978-3-540-00346-5</json:string></isbn><language><json:string>unknown</json:string></language><title>Experimental Algorithmics</title><bookId><json:string>3-540-36383-1</json:string></bookId><volume>2547</volume><pages><last>138</last><first>127</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-36383-5</json:string></eisbn><copyrightDate>2002</copyrightDate><doi><json:string>10.1007/3-540-36383-1</json:string></doi></host><publicationDate>2002</publicationDate><copyrightDate>2002</copyrightDate><doi><json:string>10.1007/3-540-36383-1_6</json:string></doi><id>529C253E2D464E525FBE7425A7EF571C091B3AC0</id><score>0.9748623</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/529C253E2D464E525FBE7425A7EF571C091B3AC0/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/529C253E2D464E525FBE7425A7EF571C091B3AC0/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/529C253E2D464E525FBE7425A7EF571C091B3AC0/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2002</p></availability><date>2002</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title><author xml:id="author-1"><persName><forename type="first">Christoph</forename><surname>Meinel</surname></persName><email>meinel@ti.uni-trier.de</email><affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Harald</forename><surname>Sack</surname></persName><email>sack@ti.uni-trier.de</email><affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</affiliation></author><author xml:id="author-3"><persName><forename type="first">Arno</forename><surname>Wagner</surname></persName><email>wagner@tik.ee.ethz.ch</email><affiliation>Institute TIK, ETH Zürich, Gloriastr. 35, CH-8092, Zuerich, Switzerland</affiliation></author></analytic><monogr><title level="m">Experimental Algorithmics</title><title level="m" type="sub">From Algorithm Design to Robust and Efficient Software</title><idno type="pISBN">978-3-540-00346-5</idno><idno type="eISBN">978-3-540-36383-5</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-36383-1</idno><idno type="book-ID">3-540-36383-1</idno><idno type="book-title-ID">72525</idno><idno type="book-sequence-number">2547</idno><idno type="book-volume-number">2547</idno><idno type="book-chapter-count">11</idno><editor><persName><forename type="first">Rudolf</forename><surname>Fleischer</surname></persName><email>rudolf@cs.ust.hk</email><affiliation>Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong</affiliation></editor><editor><persName><forename type="first">Bernard</forename><surname>Moret</surname></persName><email>moret@cs.unm.edu</email><affiliation>Department of Computer Science, University of New Mexico, Farris Engineering Bldg, 87131-1386, Albuquerque, NM, USA</affiliation></editor><editor><persName><forename type="first">Erik</forename><forename type="first">Meineche</forename><surname>Schmidt</surname></persName><email>ems@daimi.au.dk</email><affiliation>Department of Computer Science, University of Aarhus, Bld. 540, Ny Munkegade, 8000, Aarhus C, Denmark</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2002-12-16"></date><biblScope unit="volume">2547</biblScope><biblScope unit="page" from="127">127</biblScope><biblScope unit="page" to="138">138</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Utrecht University, The Netherlands</affiliation></editor><biblScope><date>2002</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="series-Id">558</idno></series><idno type="istex">529C253E2D464E525FBE7425A7EF571C091B3AC0</idno><idno type="DOI">10.1007/3-540-36383-1_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2002</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I00001</label><label>I15017</label><label>I16021</label><label>I1701X</label><label>I17028</label><label>M14018</label><item><term>Computer Science</term></item><item><term>Computer Science, general</term></item><item><term>Data Structures</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Numeric Computing</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Algorithms</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2002-12-16">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/529C253E2D464E525FBE7425A7EF571C091B3AC0/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Professional book" Language="En" MediaType="eBook" NumberingStyle="Outline" TocLevels="0"><BookID>3-540-36383-1</BookID><BookTitle>Experimental Algorithmics</BookTitle><BookSubTitle>From Algorithm Design to Robust and Efficient Software</BookSubTitle><BookVolumeNumber>2547</BookVolumeNumber><BookSequenceNumber>2547</BookSequenceNumber><BookDOI>10.1007/3-540-36383-1</BookDOI><BookTitleID>72525</BookTitleID><BookPrintISBN>978-3-540-00346-5</BookPrintISBN><BookElectronicISBN>978-3-540-36383-5</BookElectronicISBN><BookChapterCount>11</BookChapterCount><BookHistory><OnlineDate><Year>2002</Year><Month>12</Month><Day>16</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2002</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I00001" Priority="1" Type="Secondary">Computer Science, general</BookSubject><BookSubject Code="I15017" Priority="2" Type="Secondary">Data Structures</BookSubject><BookSubject Code="I16021" Priority="3" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I1701X" Priority="4" Type="Secondary">Numeric Computing</BookSubject><BookSubject Code="I17028" Priority="5" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject><BookSubject Code="M14018" Priority="6" Type="Secondary">Algorithms</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Rudolf</GivenName><FamilyName>Fleischer</FamilyName></EditorName><Contact><Email>rudolf@cs.ust.hk</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Bernard</GivenName><FamilyName>Moret</FamilyName></EditorName><Contact><Email>moret@cs.unm.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>Erik</GivenName><GivenName>Meineche</GivenName><FamilyName>Schmidt</FamilyName></EditorName><Contact><Email>ems@daimi.au.dk</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>Hong Kong University of Science and Technology</OrgName><OrgAddress><Street>Clear Water Bay</Street><City>Kowloon</City><Country>Hong Kong</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of New Mexico</OrgName><OrgAddress><Street>Farris Engineering Bldg</Street><Postcode>87131-1386</Postcode><City>Albuquerque</City><State>NM</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Aarhus</OrgName><OrgAddress><Street>Bld. 540, Ny Munkegade</Street><Postcode>8000</Postcode><City>Aarhus C</City><Country>Denmark</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap6" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Outline" TocLevels="0"><ChapterID>6</ChapterID><ChapterDOI>10.1007/3-540-36383-1_6</ChapterDOI><ChapterSequenceNumber>6</ChapterSequenceNumber><ChapterTitle Language="En">WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</ChapterTitle><ChapterFirstPage>127</ChapterFirstPage><ChapterLastPage>138</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2002</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2002</Year><Month>12</Month><Day>15</Day></RegistrationDate><OnlineDate><Year>2002</Year><Month>12</Month><Day>16</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3-540-36383-1</BookID><BookTitle>Experimental Algorithmics</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Christoph</GivenName><FamilyName>Meinel</FamilyName></AuthorName><Contact><Email>meinel@ti.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Harald</GivenName><FamilyName>Sack</FamilyName></AuthorName><Contact><Email>sack@ti.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>Arno</GivenName><FamilyName>Wagner</FamilyName></AuthorName><Contact><Email>wagner@tik.ee.ethz.ch</Email></Contact></Author><Affiliation ID="Aff7"><OrgDivision>Dept. of Computer Science</OrgDivision><OrgName>University of Trier</OrgName><OrgAddress><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgDivision>Institute TIK</OrgDivision><OrgName>ETH Zürich</OrgName><OrgAddress><Street>Gloriastr. 35</Street><Postcode>CH-8092</Postcode><City>Zuerich</City><Country>Switzerland</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms</title></titleInfo><name type="personal"><namePart type="given">Christoph</namePart><namePart type="family">Meinel</namePart><affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</affiliation><affiliation>E-mail: meinel@ti.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Harald</namePart><namePart type="family">Sack</namePart><affiliation>Dept. of Computer Science, University of Trier, Trier, Germany</affiliation><affiliation>E-mail: sack@ti.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Arno</namePart><namePart type="family">Wagner</namePart><affiliation>Institute TIK, ETH Zürich, Gloriastr. 35, CH-8092, Zuerich, Switzerland</affiliation><affiliation>E-mail: wagner@tik.ee.ethz.ch</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2002-12-16</dateIssued><copyrightDate encoding="w3cdtf">2002</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.</abstract><relatedItem type="host"><titleInfo><title>Experimental Algorithmics</title><subTitle>From Algorithm Design to Robust and Efficient Software</subTitle></titleInfo><name type="personal"><namePart type="given">Rudolf</namePart><namePart type="family">Fleischer</namePart><affiliation>Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong</affiliation><affiliation>E-mail: rudolf@cs.ust.hk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernard</namePart><namePart type="family">Moret</namePart><affiliation>Department of Computer Science, University of New Mexico, Farris Engineering Bldg, 87131-1386, Albuquerque, NM, USA</affiliation><affiliation>E-mail: moret@cs.unm.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Erik</namePart><namePart type="given">Meineche</namePart><namePart type="family">Schmidt</namePart><affiliation>Department of Computer Science, University of Aarhus, Bld. 540, Ny Munkegade, 8000, Aarhus C, Denmark</affiliation><affiliation>E-mail: ems@daimi.au.dk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Professional book"></genre><originInfo><copyrightDate encoding="w3cdtf">2002</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I00001">Computer Science, general</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I1701X">Numeric Computing</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="M14018">Algorithms</topic></subject><identifier type="DOI">10.1007/3-540-36383-1</identifier><identifier type="ISBN">978-3-540-00346-5</identifier><identifier type="eISBN">978-3-540-36383-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">72525</identifier><identifier type="BookID">3-540-36383-1</identifier><identifier type="BookChapterCount">11</identifier><identifier type="BookVolumeNumber">2547</identifier><identifier type="BookSequenceNumber">2547</identifier><part><date>2002</date><detail type="volume"><number>2547</number><caption>vol.</caption></detail><extent unit="pages"><start>127</start><end>138</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2002</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin></recordInfo></relatedItem><identifier type="istex">529C253E2D464E525FBE7425A7EF571C091B3AC0</identifier><identifier type="DOI">10.1007/3-540-36383-1_6</identifier><identifier type="ChapterID">6</identifier><identifier type="ChapterID">Chap6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2002</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001074 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001074 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:529C253E2D464E525FBE7425A7EF571C091B3AC0
|texte= WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
}}
| This area was generated with Dilib version V0.6.31. |  |