Parallel substitution algorithm: theory and application
Parallel substitution algorithm (PSA) is a new model for distributed (cellular) computations. It provides a concise mapping of distributed computation processes into cellular arrays. A PSA is specified by a set of parallel substitutions operating over a cellular array. Two concepts make PSA a powerf...
Gespeichert in:
| Format: | Elektronisch E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Singapore
World Scientific Pub. Co.
c1994
|
| Schlagworte: | |
| Online-Zugang: | FHN01 Volltext |
| Zusammenfassung: | Parallel substitution algorithm (PSA) is a new model for distributed (cellular) computations. It provides a concise mapping of distributed computation processes into cellular arrays. A PSA is specified by a set of parallel substitutions operating over a cellular array. Two concepts make PSA a powerful tool for modelling cellular computations: 1) naming functions which allow the specification of any type of interactions in the computation space, 2) a context which serves to represent control of a computational process in time. The foundation of PSA theory comprises validity conditions of computations in the synchronous and asynchronous modes, space-time, space-space (2D ⇒ 3D) and global-local equivalent transformations of PSAs, composition and decomposition of PSAs and interpretation of PSAs with automata nets. On the basis of the PSA theory, a variety of tools and techniques is developed for designing algorithmic-oriented cellular VLSI and optical architectures |
| Beschreibung: | ix, 220 p. ill |
| ISBN: | 9789814354073 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044638501 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 171120s1994 |||| o||u| ||||||eng d | ||
| 020 | |a 9789814354073 |9 978-981-4354-07-3 | ||
| 024 | 7 | |a 10.1142/2369 |2 doi | |
| 035 | |a (ZDB-124-WOP)00005100 | ||
| 035 | |a (OCoLC)1012631464 | ||
| 035 | |a (DE-599)BVBBV044638501 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 | ||
| 082 | 0 | |a 004.35 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 245 | 1 | 0 | |a Parallel substitution algorithm |b theory and application |c S. Achasova ... [et al.] |
| 264 | 1 | |a Singapore |b World Scientific Pub. Co. |c c1994 | |
| 300 | |a ix, 220 p. |b ill | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Parallel substitution algorithm (PSA) is a new model for distributed (cellular) computations. It provides a concise mapping of distributed computation processes into cellular arrays. A PSA is specified by a set of parallel substitutions operating over a cellular array. Two concepts make PSA a powerful tool for modelling cellular computations: 1) naming functions which allow the specification of any type of interactions in the computation space, 2) a context which serves to represent control of a computational process in time. The foundation of PSA theory comprises validity conditions of computations in the synchronous and asynchronous modes, space-time, space-space (2D ⇒ 3D) and global-local equivalent transformations of PSAs, composition and decomposition of PSAs and interpretation of PSAs with automata nets. On the basis of the PSA theory, a variety of tools and techniques is developed for designing algorithmic-oriented cellular VLSI and optical architectures | ||
| 650 | 4 | |a Parallel algorithms | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Achasova, S. M. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9789810217778 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9810217773 |
| 856 | 4 | 0 | |u http://www.worldscientific.com/worldscibooks/10.1142/2369#t=toc |x Verlag |z URL des Erstveroeffentlichers |3 Volltext |
| 912 | |a ZDB-124-WOP | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030036475 | ||
| 966 | e | |u http://www.worldscientific.com/worldscibooks/10.1142/2369#t=toc |l FHN01 |p ZDB-124-WOP |q FHN_PDA_WOP |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178055241924608 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV044638501 |
| classification_rvk | ST 130 |
| collection | ZDB-124-WOP |
| ctrlnum | (ZDB-124-WOP)00005100 (OCoLC)1012631464 (DE-599)BVBBV044638501 |
| dewey-full | 004.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.35 |
| dewey-search | 004.35 |
| dewey-sort | 14.35 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02405nmm a2200397zc 4500</leader><controlfield tag="001">BV044638501</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171120s1994 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814354073</subfield><subfield code="9">978-981-4354-07-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/2369</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-124-WOP)00005100</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1012631464</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044638501</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.35</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel substitution algorithm</subfield><subfield code="b">theory and application</subfield><subfield code="c">S. Achasova ... [et al.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Pub. Co.</subfield><subfield code="c">c1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">ix, 220 p.</subfield><subfield code="b">ill</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Parallel substitution algorithm (PSA) is a new model for distributed (cellular) computations. It provides a concise mapping of distributed computation processes into cellular arrays. A PSA is specified by a set of parallel substitutions operating over a cellular array. Two concepts make PSA a powerful tool for modelling cellular computations: 1) naming functions which allow the specification of any type of interactions in the computation space, 2) a context which serves to represent control of a computational process in time. The foundation of PSA theory comprises validity conditions of computations in the synchronous and asynchronous modes, space-time, space-space (2D ⇒ 3D) and global-local equivalent transformations of PSAs, composition and decomposition of PSAs and interpretation of PSAs with automata nets. On the basis of the PSA theory, a variety of tools and techniques is developed for designing algorithmic-oriented cellular VLSI and optical architectures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</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">Achasova, S. M.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9789810217778</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9810217773</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/2369#t=toc</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveroeffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-124-WOP</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030036475</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/2369#t=toc</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">FHN_PDA_WOP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044638501 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:57:53Z |
| institution | BVB |
| isbn | 9789814354073 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030036475 |
| oclc_num | 1012631464 |
| open_access_boolean | |
| owner | DE-92 |
| owner_facet | DE-92 |
| physical | ix, 220 p. ill |
| psigel | ZDB-124-WOP ZDB-124-WOP FHN_PDA_WOP |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | World Scientific Pub. Co. |
| record_format | marc |
| spelling | Parallel substitution algorithm theory and application S. Achasova ... [et al.] Singapore World Scientific Pub. Co. c1994 ix, 220 p. ill txt rdacontent c rdamedia cr rdacarrier Parallel substitution algorithm (PSA) is a new model for distributed (cellular) computations. It provides a concise mapping of distributed computation processes into cellular arrays. A PSA is specified by a set of parallel substitutions operating over a cellular array. Two concepts make PSA a powerful tool for modelling cellular computations: 1) naming functions which allow the specification of any type of interactions in the computation space, 2) a context which serves to represent control of a computational process in time. The foundation of PSA theory comprises validity conditions of computations in the synchronous and asynchronous modes, space-time, space-space (2D ⇒ 3D) and global-local equivalent transformations of PSAs, composition and decomposition of PSAs and interpretation of PSAs with automata nets. On the basis of the PSA theory, a variety of tools and techniques is developed for designing algorithmic-oriented cellular VLSI and optical architectures Parallel algorithms Parallel processing (Electronic computers) Achasova, S. M. Sonstige oth Erscheint auch als Druck-Ausgabe 9789810217778 Erscheint auch als Druck-Ausgabe 9810217773 http://www.worldscientific.com/worldscibooks/10.1142/2369#t=toc Verlag URL des Erstveroeffentlichers Volltext |
| spellingShingle | Parallel substitution algorithm theory and application Parallel algorithms Parallel processing (Electronic computers) |
| title | Parallel substitution algorithm theory and application |
| title_auth | Parallel substitution algorithm theory and application |
| title_exact_search | Parallel substitution algorithm theory and application |
| title_full | Parallel substitution algorithm theory and application S. Achasova ... [et al.] |
| title_fullStr | Parallel substitution algorithm theory and application S. Achasova ... [et al.] |
| title_full_unstemmed | Parallel substitution algorithm theory and application S. Achasova ... [et al.] |
| title_short | Parallel substitution algorithm |
| title_sort | parallel substitution algorithm theory and application |
| title_sub | theory and application |
| topic | Parallel algorithms Parallel processing (Electronic computers) |
| topic_facet | Parallel algorithms Parallel processing (Electronic computers) |
| url | http://www.worldscientific.com/worldscibooks/10.1142/2369#t=toc |
| work_keys_str_mv | AT achasovasm parallelsubstitutionalgorithmtheoryandapplication |