Simulating neural networks on SIMD mesh and pyramid machines:
Abstract: "This report describes two possible implementations of neural network simulations on SIMD computers. The first implementation uses an n by n processor mesh to perform each convergence iteration of an n-node fully-connected network in O(n) steps. The second implementation assigns one n...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Seattle, Wash.
1990
|
| Series: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
90,2,1 |
| Subjects: | |
| Summary: | Abstract: "This report describes two possible implementations of neural network simulations on SIMD computers. The first implementation uses an n by n processor mesh to perform each convergence iteration of an n-node fully-connected network in O(n) steps. The second implementation assigns one network node to each processing element of the SIMD machine and so allows simulation of much larger networks on machines of arbitrary connection architecture. The penalty, however, is O(nlog n) steps per convergence iteration." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009260354 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23952547 | ||
| 035 | |a (DE-599)BVBBV009260354 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Moore, Charles G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Simulating neural networks on SIMD mesh and pyramid machines |
| 264 | 1 | |a Seattle, Wash. |c 1990 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 90,2,1 | |
| 520 | 3 | |a Abstract: "This report describes two possible implementations of neural network simulations on SIMD computers. The first implementation uses an n by n processor mesh to perform each convergence iteration of an n-node fully-connected network in O(n) steps. The second implementation assigns one network node to each processing element of the SIMD machine and so allows simulation of much larger networks on machines of arbitrary connection architecture. The penalty, however, is O(nlog n) steps per convergence iteration." | |
| 650 | 4 | |a Neural circuitry |x Computer simulation | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 90,2,1 |w (DE-604)BV008930431 |9 90,2,1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006162230 | ||
Record in the Search Index
| _version_ | 1804123708213690368 |
|---|---|
| any_adam_object | |
| author | Moore, Charles G. |
| author_facet | Moore, Charles G. |
| author_role | aut |
| author_sort | Moore, Charles G. |
| author_variant | c g m cg cgm |
| building | Verbundindex |
| bvnumber | BV009260354 |
| ctrlnum | (OCoLC)23952547 (DE-599)BVBBV009260354 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01499nam a2200289 cb4500</leader><controlfield tag="001">BV009260354</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23952547</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009260354</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moore, Charles G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Simulating neural networks on SIMD mesh and pyramid machines</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">90,2,1</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This report describes two possible implementations of neural network simulations on SIMD computers. The first implementation uses an n by n processor mesh to perform each convergence iteration of an n-node fully-connected network in O(n) steps. The second implementation assigns one network node to each processing element of the SIMD machine and so allows simulation of much larger networks on machines of arbitrary connection architecture. The penalty, however, is O(nlog n) steps per convergence iteration."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neural circuitry</subfield><subfield code="x">Computer simulation</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">90,2,1</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">90,2,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006162230</subfield></datafield></record></collection> |
| id | DE-604.BV009260354 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006162230 |
| oclc_num | 23952547 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 13 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Moore, Charles G. Verfasser aut Simulating neural networks on SIMD mesh and pyramid machines Seattle, Wash. 1990 13 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 90,2,1 Abstract: "This report describes two possible implementations of neural network simulations on SIMD computers. The first implementation uses an n by n processor mesh to perform each convergence iteration of an n-node fully-connected network in O(n) steps. The second implementation assigns one network node to each processing element of the SIMD machine and so allows simulation of much larger networks on machines of arbitrary connection architecture. The penalty, however, is O(nlog n) steps per convergence iteration." Neural circuitry Computer simulation Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 90,2,1 (DE-604)BV008930431 90,2,1 |
| spellingShingle | Moore, Charles G. Simulating neural networks on SIMD mesh and pyramid machines Neural circuitry Computer simulation |
| title | Simulating neural networks on SIMD mesh and pyramid machines |
| title_auth | Simulating neural networks on SIMD mesh and pyramid machines |
| title_exact_search | Simulating neural networks on SIMD mesh and pyramid machines |
| title_full | Simulating neural networks on SIMD mesh and pyramid machines |
| title_fullStr | Simulating neural networks on SIMD mesh and pyramid machines |
| title_full_unstemmed | Simulating neural networks on SIMD mesh and pyramid machines |
| title_short | Simulating neural networks on SIMD mesh and pyramid machines |
| title_sort | simulating neural networks on simd mesh and pyramid machines |
| topic | Neural circuitry Computer simulation |
| topic_facet | Neural circuitry Computer simulation |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT moorecharlesg simulatingneuralnetworksonsimdmeshandpyramidmachines |