Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures:
Abstract: "To implement an efficient data-parallel program on a non-shared memory MIMD multicomputer, data and computations must be properly partitioned to achieve good load balance and locality of reference. Programs with irregular data reference patterns often require irregular partitions. Al...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Seattle, Wash.
1990
|
| Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
90,2,6 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "To implement an efficient data-parallel program on a non-shared memory MIMD multicomputer, data and computations must be properly partitioned to achieve good load balance and locality of reference. Programs with irregular data reference patterns often require irregular partitions. Although good partitions may be easy to determine, they can be difficult or impossible to implement in programming languages that provide only regular data distributions, such as blocked or cyclic arrays. We are developing Onyx, a programming system that provides a shared memory model of distributed data structures and extends the concept of data distribution to include irregular and dynamic distributions. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009260380 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23952582 | ||
| 035 | |a (DE-599)BVBBV009260380 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Littlefield, Richard J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| 264 | 1 | |a Seattle, Wash. |c 1990 | |
| 300 | |a 16 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,6 | |
| 520 | 3 | |a Abstract: "To implement an efficient data-parallel program on a non-shared memory MIMD multicomputer, data and computations must be properly partitioned to achieve good load balance and locality of reference. Programs with irregular data reference patterns often require irregular partitions. Although good partitions may be easy to determine, they can be difficult or impossible to implement in programming languages that provide only regular data distributions, such as blocked or cyclic arrays. We are developing Onyx, a programming system that provides a shared memory model of distributed data structures and extends the concept of data distribution to include irregular and dynamic distributions. | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing |x Distributed processing | |
| 650 | 4 | |a Multiprocessors | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 90,2,6 |w (DE-604)BV008930431 |9 90,2,6 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006162256 | ||
Datensatz im Suchindex
| _version_ | 1804123708273459200 |
|---|---|
| any_adam_object | |
| author | Littlefield, Richard J. |
| author_facet | Littlefield, Richard J. |
| author_role | aut |
| author_sort | Littlefield, Richard J. |
| author_variant | r j l rj rjl |
| building | Verbundindex |
| bvnumber | BV009260380 |
| ctrlnum | (OCoLC)23952582 (DE-599)BVBBV009260380 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01809nam a2200313 cb4500</leader><controlfield tag="001">BV009260380</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)23952582</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009260380</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">Littlefield, Richard J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures</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">16 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,6</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "To implement an efficient data-parallel program on a non-shared memory MIMD multicomputer, data and computations must be properly partitioned to achieve good load balance and locality of reference. Programs with irregular data reference patterns often require irregular partitions. Although good partitions may be easy to determine, they can be difficult or impossible to implement in programming languages that provide only regular data distributions, such as blocked or cyclic arrays. We are developing Onyx, a programming system that provides a shared memory model of distributed data structures and extends the concept of data distribution to include irregular and dynamic distributions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield><subfield code="x">Distributed processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</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,6</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">90,2,6</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006162256</subfield></datafield></record></collection> |
| id | DE-604.BV009260380 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006162256 |
| oclc_num | 23952582 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Littlefield, Richard J. Verfasser aut Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures Seattle, Wash. 1990 16 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 90,2,6 Abstract: "To implement an efficient data-parallel program on a non-shared memory MIMD multicomputer, data and computations must be properly partitioned to achieve good load balance and locality of reference. Programs with irregular data reference patterns often require irregular partitions. Although good partitions may be easy to determine, they can be difficult or impossible to implement in programming languages that provide only regular data distributions, such as blocked or cyclic arrays. We are developing Onyx, a programming system that provides a shared memory model of distributed data structures and extends the concept of data distribution to include irregular and dynamic distributions. Datenverarbeitung Electronic data processing Distributed processing Multiprocessors Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 90,2,6 (DE-604)BV008930431 90,2,6 |
| spellingShingle | Littlefield, Richard J. Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures Datenverarbeitung Electronic data processing Distributed processing Multiprocessors |
| title | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_auth | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_exact_search | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_full | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_fullStr | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_full_unstemmed | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_short | Efficient iteration in data-parallel programs with irregular and dynamically distributed data structures |
| title_sort | efficient iteration in data parallel programs with irregular and dynamically distributed data structures |
| topic | Datenverarbeitung Electronic data processing Distributed processing Multiprocessors |
| topic_facet | Datenverarbeitung Electronic data processing Distributed processing Multiprocessors |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT littlefieldrichardj efficientiterationindataparallelprogramswithirregularanddynamicallydistributeddatastructures |