Discussion of parallel algorithms:
In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the stu...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
759 |
| Schlagworte: | |
| Zusammenfassung: | In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the study and development of parallel algorithms. In this paper we present a survey of deterministic parallel algorithms for a class of computational problems. Both graph-theoretic and non graph-theoretic problems are considered and the parallel algorithms presented are motivated by identifying some common paradigms. |
| Beschreibung: | 67 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594724 | ||
| 003 | DE-604 | ||
| 005 | 19970310 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)15729315 | ||
| 035 | |a (DE-599)BVBBV010594724 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 516f |2 stub | ||
| 100 | 1 | |a Moitra, Abha |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Discussion of parallel algorithms |c Abha Moitra ; S. Sitharama Iyengar |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 67 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 759 | |
| 520 | 3 | |a In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the study and development of parallel algorithms. In this paper we present a survey of deterministic parallel algorithms for a class of computational problems. Both graph-theoretic and non graph-theoretic problems are considered and the parallel algorithms presented are motivated by identifying some common paradigms. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Iyengar, S. S. |d 1947- |e Verfasser |0 (DE-588)121802485 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 759 |w (DE-604)BV006185504 |9 759 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007065297 | ||
Datensatz im Suchindex
| _version_ | 1804125066018947072 |
|---|---|
| any_adam_object | |
| author | Moitra, Abha Iyengar, S. S. 1947- |
| author_GND | (DE-588)121802485 |
| author_facet | Moitra, Abha Iyengar, S. S. 1947- |
| author_role | aut aut |
| author_sort | Moitra, Abha |
| author_variant | a m am s s i ss ssi |
| building | Verbundindex |
| bvnumber | BV010594724 |
| classification_tum | DAT 516f |
| ctrlnum | (OCoLC)15729315 (DE-599)BVBBV010594724 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01731nam a2200337 cb4500</leader><controlfield tag="001">BV010594724</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970310 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15729315</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594724</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></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moitra, Abha</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discussion of parallel algorithms</subfield><subfield code="c">Abha Moitra ; S. Sitharama Iyengar</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">67 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">759</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the study and development of parallel algorithms. In this paper we present a survey of deterministic parallel algorithms for a class of computational problems. Both graph-theoretic and non graph-theoretic problems are considered and the parallel algorithms presented are motivated by identifying some common paradigms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Iyengar, S. S.</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121802485</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">759</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">759</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065297</subfield></datafield></record></collection> |
| id | DE-604.BV010594724 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065297 |
| oclc_num | 15729315 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 67 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Moitra, Abha Verfasser aut Discussion of parallel algorithms Abha Moitra ; S. Sitharama Iyengar Ithaca, New York 1986 67 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 759 In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the study and development of parallel algorithms. In this paper we present a survey of deterministic parallel algorithms for a class of computational problems. Both graph-theoretic and non graph-theoretic problems are considered and the parallel algorithms presented are motivated by identifying some common paradigms. Algorithms Graph theory Parallel processing (Electronic computers) Iyengar, S. S. 1947- Verfasser (DE-588)121802485 aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 759 (DE-604)BV006185504 759 |
| spellingShingle | Moitra, Abha Iyengar, S. S. 1947- Discussion of parallel algorithms Algorithms Graph theory Parallel processing (Electronic computers) |
| title | Discussion of parallel algorithms |
| title_auth | Discussion of parallel algorithms |
| title_exact_search | Discussion of parallel algorithms |
| title_full | Discussion of parallel algorithms Abha Moitra ; S. Sitharama Iyengar |
| title_fullStr | Discussion of parallel algorithms Abha Moitra ; S. Sitharama Iyengar |
| title_full_unstemmed | Discussion of parallel algorithms Abha Moitra ; S. Sitharama Iyengar |
| title_short | Discussion of parallel algorithms |
| title_sort | discussion of parallel algorithms |
| topic | Algorithms Graph theory Parallel processing (Electronic computers) |
| topic_facet | Algorithms Graph theory Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT moitraabha discussionofparallelalgorithms AT iyengarss discussionofparallelalgorithms |