Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem:
Abstract: "In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of size n, we obtain an execution time T(n) = 3n-1 using A(n) = n²/4 + O(n) processors for Gaussian elimination,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English French |
| Published: |
Lyon
1990
|
| Series: | Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP
1990,9 |
| Subjects: | |
| Summary: | Abstract: "In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of size n, we obtain an execution time T(n) = 3n-1 using A(n) = n²/4 + O(n) processors for Gaussian elimination, and T(n) = 5n-2 and A(n) = n³/3 + O(n) for the APP." |
| Physical Description: | 19 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010678405 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960325s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24333020 | ||
| 035 | |a (DE-599)BVBBV010678405 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng |a fre | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Benaini, Abdelhamid |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem |c Abdelhamid Benaini ; Yves Robert |
| 264 | 1 | |a Lyon |c 1990 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |v 1990,9 | |
| 520 | 3 | |a Abstract: "In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of size n, we obtain an execution time T(n) = 3n-1 using A(n) = n²/4 + O(n) processors for Gaussian elimination, and T(n) = 5n-2 and A(n) = n³/3 + O(n) for the APP." | |
| 650 | 4 | |a Gaussian processes | |
| 650 | 4 | |a Systolic array circuits | |
| 700 | 1 | |a Robert, Yves |e Verfasser |4 aut | |
| 830 | 0 | |a Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |v 1990,9 |w (DE-604)BV010675085 |9 1990,9 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007126736 | ||
Record in the Search Index
| _version_ | 1804125155833675776 |
|---|---|
| any_adam_object | |
| author | Benaini, Abdelhamid Robert, Yves |
| author_facet | Benaini, Abdelhamid Robert, Yves |
| author_role | aut aut |
| author_sort | Benaini, Abdelhamid |
| author_variant | a b ab y r yr |
| building | Verbundindex |
| bvnumber | BV010678405 |
| ctrlnum | (OCoLC)24333020 (DE-599)BVBBV010678405 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01430nam a2200313 cb4500</leader><controlfield tag="001">BV010678405</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960325s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24333020</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010678405</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield><subfield code="a">fre</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Benaini, Abdelhamid</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem</subfield><subfield code="c">Abdelhamid Benaini ; Yves Robert</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Lyon</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP</subfield><subfield code="v">1990,9</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of size n, we obtain an execution time T(n) = 3n-1 using A(n) = n²/4 + O(n) processors for Gaussian elimination, and T(n) = 5n-2 and A(n) = n³/3 + O(n) for the APP."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gaussian processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systolic array circuits</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Robert, Yves</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP</subfield><subfield code="v">1990,9</subfield><subfield code="w">(DE-604)BV010675085</subfield><subfield code="9">1990,9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007126736</subfield></datafield></record></collection> |
| id | DE-604.BV010678405 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:57:04Z |
| institution | BVB |
| language | English French |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007126736 |
| oclc_num | 24333020 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |
| series2 | Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP |
| spelling | Benaini, Abdelhamid Verfasser aut Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem Abdelhamid Benaini ; Yves Robert Lyon 1990 19 S. txt rdacontent n rdamedia nc rdacarrier Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP 1990,9 Abstract: "In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of size n, we obtain an execution time T(n) = 3n-1 using A(n) = n²/4 + O(n) processors for Gaussian elimination, and T(n) = 5n-2 and A(n) = n³/3 + O(n) for the APP." Gaussian processes Systolic array circuits Robert, Yves Verfasser aut Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP 1990,9 (DE-604)BV010675085 1990,9 |
| spellingShingle | Benaini, Abdelhamid Robert, Yves Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem Laboratoire d'Informatique du Parallélisme <Lyon>: Rapports de recherche du LIP Gaussian processes Systolic array circuits |
| title | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem |
| title_auth | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem |
| title_exact_search | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem |
| title_full | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem Abdelhamid Benaini ; Yves Robert |
| title_fullStr | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem Abdelhamid Benaini ; Yves Robert |
| title_full_unstemmed | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem Abdelhamid Benaini ; Yves Robert |
| title_short | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic Path problem |
| title_sort | spacetime minimal systolic arrays for gaussian elimination and the algebraic path problem |
| topic | Gaussian processes Systolic array circuits |
| topic_facet | Gaussian processes Systolic array circuits |
| volume_link | (DE-604)BV010675085 |
| work_keys_str_mv | AT benainiabdelhamid spacetimeminimalsystolicarraysforgaussianeliminationandthealgebraicpathproblem AT robertyves spacetimeminimalsystolicarraysforgaussianeliminationandthealgebraicpathproblem |