WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms
Identifieur interne :
000C76 ( PascalFrancis/Corpus );
précédent :
000C75;
suivant :
000C77
WWW.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.
RBID : Pascal:03-0183701
Descripteurs français
English descriptors
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.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
A01 | 01 | 1 | | @0 0302-9743 |
---|
A05 | | | | @2 2547 |
---|
A08 | 01 | 1 | ENG | @1 WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms |
---|
A09 | 01 | 1 | ENG | @1 Experimental algorithmics : from algorithm design to robust and efficient software : Dagstuhl, September 2000 |
---|
A11 | 01 | 1 | | @1 MEINEL (Christoph) |
---|
A11 | 02 | 1 | | @1 SACK (Harald) |
---|
A11 | 03 | 1 | | @1 WAGNER (Arno) |
---|
A12 | 01 | 1 | | @1 FLEISCHER (Rudolf) @9 ed. |
---|
A12 | 02 | 1 | | @1 MORET (Bernard) @9 ed. |
---|
A12 | 03 | 1 | | @1 MEINECHE SCHMIDT (Erik) @9 ed. |
---|
A14 | 01 | | | @1 University of Trier, Dept. of Computer Science @2 Trier @3 DEU @Z 1 aut. @Z 2 aut. |
---|
A14 | 02 | | | @1 Institute TIK, ETH Zürich, Gloriastr. 35 @2 8092 Zuerich @3 CHE @Z 3 aut. |
---|
A20 | | | | @1 127-138 |
---|
A21 | | | | @1 2002 |
---|
A23 | 01 | | | @0 ENG |
---|
A26 | 01 | | | @0 3-540-00346-0 |
---|
A43 | 01 | | | @1 INIST @2 16343 @5 354000108493890060 |
---|
A44 | | | | @0 0000 @1 © 2003 INIST-CNRS. All rights reserved. |
---|
A45 | | | | @0 18 ref. |
---|
A47 | 01 | 1 | | @0 03-0183701 |
---|
A60 | | | | @1 P @2 C |
---|
A61 | | | | @0 A |
---|
A64 | 01 | 1 | | @0 Lecture notes in computer science |
---|
A66 | 01 | | | @0 DEU |
---|
C01 | 01 | | ENG | @0 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. |
---|
C02 | 01 | X | | @0 001D02A05 |
---|
C02 | 02 | X | | @0 001D03F06B |
---|
C03 | 01 | X | FRE | @0 Internet @5 01 |
---|
C03 | 01 | X | ENG | @0 Internet @5 01 |
---|
C03 | 01 | X | SPA | @0 Internet @5 01 |
---|
C03 | 02 | X | FRE | @0 Site Web @5 02 |
---|
C03 | 02 | X | ENG | @0 Web site @5 02 |
---|
C03 | 02 | X | SPA | @0 Sitio Web @5 02 |
---|
C03 | 03 | X | FRE | @0 Diagramme binaire décision @5 03 |
---|
C03 | 03 | X | ENG | @0 Binary decision diagram @5 03 |
---|
C03 | 03 | X | SPA | @0 Diagrama binaria decisión @5 03 |
---|
C03 | 04 | X | FRE | @0 Structure donnée @5 04 |
---|
C03 | 04 | X | ENG | @0 Data structure @5 04 |
---|
C03 | 04 | X | SPA | @0 Estructura datos @5 04 |
---|
C03 | 05 | X | FRE | @0 Conception assistée @5 05 |
---|
C03 | 05 | X | ENG | @0 Computer aided design @5 05 |
---|
C03 | 05 | X | SPA | @0 Concepción asistida @5 05 |
---|
C03 | 06 | X | FRE | @0 Conception intégrée @5 06 |
---|
C03 | 06 | X | ENG | @0 Integrated design @5 06 |
---|
C03 | 06 | X | SPA | @0 Concepción integrada @5 06 |
---|
C03 | 07 | X | FRE | @0 Circuit intégré @5 07 |
---|
C03 | 07 | X | ENG | @0 Integrated circuit @5 07 |
---|
C03 | 07 | X | SPA | @0 Circuito integrado @5 07 |
---|
C03 | 08 | X | FRE | @0 Circuit numérique @5 08 |
---|
C03 | 08 | X | ENG | @0 Digital circuit @5 08 |
---|
C03 | 08 | X | SPA | @0 Circuito numérico @5 08 |
---|
N21 | | | | @1 104 |
---|
N82 | | | | @1 PSI |
---|
|
pR |
A30 | 01 | 1 | ENG | @1 Schloss Dagstuhl seminar on experimental algorithmics @2 1 @3 Dagstuhl DEU @4 2000-09 |
---|
|
Format Inist (serveur)
NO : | PASCAL 03-0183701 INIST |
ET : | WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms |
AU : | MEINEL (Christoph); SACK (Harald); WAGNER (Arno); FLEISCHER (Rudolf); MORET (Bernard); MEINECHE SCHMIDT (Erik) |
AF : | University of Trier, Dept. of Computer Science/Trier/Allemagne (1 aut., 2 aut.); Institute TIK, ETH Zürich, Gloriastr. 35/8092 Zuerich/Suisse (3 aut.) |
DT : | Publication en série; Congrès; Niveau analytique |
SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2547; Pp. 127-138; Bibl. 18 ref. |
LA : | Anglais |
EA : | 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. |
CC : | 001D02A05; 001D03F06B |
FD : | Internet; Site Web; Diagramme binaire décision; Structure donnée; Conception assistée; Conception intégrée; Circuit intégré; Circuit numérique |
ED : | Internet; Web site; Binary decision diagram; Data structure; Computer aided design; Integrated design; Integrated circuit; Digital circuit |
SD : | Internet; Sitio Web; Diagrama binaria decisión; Estructura datos; Concepción asistida; Concepción integrada; Circuito integrado; Circuito numérico |
LO : | INIST-16343.354000108493890060 |
ID : | 03-0183701 |
Links to Exploration step
Pascal:03-0183701
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>University of Trier, Dept. of Computer Science</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name>
<affiliation><inist:fA14 i1="01"><s1>University of Trier, Dept. of Computer Science</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Wagner, Arno" sort="Wagner, Arno" uniqKey="Wagner A" first="Arno" last="Wagner">Arno Wagner</name>
<affiliation><inist:fA14 i1="02"><s1>Institute TIK, ETH Zürich, Gloriastr. 35</s1>
<s2>8092 Zuerich</s2>
<s3>CHE</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0183701</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0183701 INIST</idno>
<idno type="RBID">Pascal:03-0183701</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C76</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>University of Trier, Dept. of Computer Science</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Sack, Harald" sort="Sack, Harald" uniqKey="Sack H" first="Harald" last="Sack">Harald Sack</name>
<affiliation><inist:fA14 i1="01"><s1>University of Trier, Dept. of Computer Science</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Wagner, Arno" sort="Wagner, Arno" uniqKey="Wagner A" first="Arno" last="Wagner">Arno Wagner</name>
<affiliation><inist:fA14 i1="02"><s1>Institute TIK, ETH Zürich, Gloriastr. 35</s1>
<s2>8092 Zuerich</s2>
<s3>CHE</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2002">2002</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Binary decision diagram</term>
<term>Computer aided design</term>
<term>Data structure</term>
<term>Digital circuit</term>
<term>Integrated circuit</term>
<term>Integrated design</term>
<term>Internet</term>
<term>Web site</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Internet</term>
<term>Site Web</term>
<term>Diagramme binaire décision</term>
<term>Structure donnée</term>
<term>Conception assistée</term>
<term>Conception intégrée</term>
<term>Circuit intégré</term>
<term>Circuit numérique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2547</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Experimental algorithmics : from algorithm design to robust and efficient software : Dagstuhl, September 2000</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>MEINEL (Christoph)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SACK (Harald)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>WAGNER (Arno)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>FLEISCHER (Rudolf)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>MORET (Bernard)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>MEINECHE SCHMIDT (Erik)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>University of Trier, Dept. of Computer Science</s1>
<s2>Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Institute TIK, ETH Zürich, Gloriastr. 35</s1>
<s2>8092 Zuerich</s2>
<s3>CHE</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>127-138</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-00346-0</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108493890060</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>18 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>03-0183701</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D03F06B</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Internet</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Internet</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Internet</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Site Web</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Web site</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Sitio Web</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Diagramme binaire décision</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Binary decision diagram</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Diagrama binaria decisión</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Structure donnée</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Data structure</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Estructura datos</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Conception assistée</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Computer aided design</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Concepción asistida</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Conception intégrée</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Integrated design</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Concepción integrada</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Circuit intégré</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Integrated circuit</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Circuito integrado</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Circuit numérique</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Digital circuit</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Circuito numérico</s0>
<s5>08</s5>
</fC03>
<fN21><s1>104</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Schloss Dagstuhl seminar on experimental algorithmics</s1>
<s2>1</s2>
<s3>Dagstuhl DEU</s3>
<s4>2000-09</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 03-0183701 INIST</NO>
<ET>WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms</ET>
<AU>MEINEL (Christoph); SACK (Harald); WAGNER (Arno); FLEISCHER (Rudolf); MORET (Bernard); MEINECHE SCHMIDT (Erik)</AU>
<AF>University of Trier, Dept. of Computer Science/Trier/Allemagne (1 aut., 2 aut.); Institute TIK, ETH Zürich, Gloriastr. 35/8092 Zuerich/Suisse (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2547; Pp. 127-138; Bibl. 18 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02A05; 001D03F06B</CC>
<FD>Internet; Site Web; Diagramme binaire décision; Structure donnée; Conception assistée; Conception intégrée; Circuit intégré; Circuit numérique</FD>
<ED>Internet; Web site; Binary decision diagram; Data structure; Computer aided design; Integrated design; Integrated circuit; Digital circuit</ED>
<SD>Internet; Sitio Web; Diagrama binaria decisión; Estructura datos; Concepción asistida; Concepción integrada; Circuito integrado; Circuito numérico</SD>
<LO>INIST-16343.354000108493890060</LO>
<ID>03-0183701</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C76 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C76 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:03-0183701
|texte= WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms
}}
| This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024 | ![](Common/icons/LogoDilib.gif) |