Chores: enhanced run-time support for shared-memory parallel computing
Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propo...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Seattle, Wash.
1991
|
| Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
91,8,5 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the clusters of a large-scale non-uniform memory access machine We argue that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism. These benefits are achieved within a single, simple conceptual model that almost entirely relieves the programmer and compiler from concerns of granularity, scheduling, and enforcement of synchronization constraints. Performance measurements are presented for an implementation of chores on a Sequent Symmetry multiprocessor. |
| Beschreibung: | 27 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015560 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)26945351 | ||
| 035 | |a (DE-599)BVBBV009015560 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Eager, Derek L. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Chores |b enhanced run-time support for shared-memory parallel computing |c Derek L. Eager and John Zahorjan |
| 264 | 1 | |a Seattle, Wash. |c 1991 | |
| 300 | |a 27 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 91,8,5 | |
| 520 | 3 | |a Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the clusters of a large-scale non-uniform memory access machine | |
| 520 | 3 | |a We argue that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism. These benefits are achieved within a single, simple conceptual model that almost entirely relieves the programmer and compiler from concerns of granularity, scheduling, and enforcement of synchronization constraints. Performance measurements are presented for an implementation of chores on a Sequent Symmetry multiprocessor. | |
| 650 | 4 | |a Multiprocessors | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 700 | 1 | |a Zahorjan, John |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 91,8,5 |w (DE-604)BV008930431 |9 91,8,5 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961135 | ||
Datensatz im Suchindex
| _version_ | 1804123364853284864 |
|---|---|
| any_adam_object | |
| author | Eager, Derek L. Zahorjan, John |
| author_facet | Eager, Derek L. Zahorjan, John |
| author_role | aut aut |
| author_sort | Eager, Derek L. |
| author_variant | d l e dl dle j z jz |
| building | Verbundindex |
| bvnumber | BV009015560 |
| ctrlnum | (OCoLC)26945351 (DE-599)BVBBV009015560 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02274nam a2200325 cb4500</leader><controlfield tag="001">BV009015560</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26945351</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015560</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">Eager, Derek L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Chores</subfield><subfield code="b">enhanced run-time support for shared-memory parallel computing</subfield><subfield code="c">Derek L. Eager and John Zahorjan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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">91,8,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the clusters of a large-scale non-uniform memory access machine</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We argue that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism. These benefits are achieved within a single, simple conceptual model that almost entirely relieves the programmer and compiler from concerns of granularity, scheduling, and enforcement of synchronization constraints. Performance measurements are presented for an implementation of chores on a Sequent Symmetry multiprocessor.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zahorjan, John</subfield><subfield code="e">Verfasser</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">University of Washington <Seattle, Wash.></subfield><subfield code="v">91,8,5</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">91,8,5</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961135</subfield></datafield></record></collection> |
| id | DE-604.BV009015560 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961135 |
| oclc_num | 26945351 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 27 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Eager, Derek L. Verfasser aut Chores enhanced run-time support for shared-memory parallel computing Derek L. Eager and John Zahorjan Seattle, Wash. 1991 27 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 91,8,5 Abstract: "Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers. In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the clusters of a large-scale non-uniform memory access machine We argue that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism. These benefits are achieved within a single, simple conceptual model that almost entirely relieves the programmer and compiler from concerns of granularity, scheduling, and enforcement of synchronization constraints. Performance measurements are presented for an implementation of chores on a Sequent Symmetry multiprocessor. Multiprocessors Parallel programming (Computer science) Zahorjan, John Verfasser aut Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 91,8,5 (DE-604)BV008930431 91,8,5 |
| spellingShingle | Eager, Derek L. Zahorjan, John Chores enhanced run-time support for shared-memory parallel computing Multiprocessors Parallel programming (Computer science) |
| title | Chores enhanced run-time support for shared-memory parallel computing |
| title_auth | Chores enhanced run-time support for shared-memory parallel computing |
| title_exact_search | Chores enhanced run-time support for shared-memory parallel computing |
| title_full | Chores enhanced run-time support for shared-memory parallel computing Derek L. Eager and John Zahorjan |
| title_fullStr | Chores enhanced run-time support for shared-memory parallel computing Derek L. Eager and John Zahorjan |
| title_full_unstemmed | Chores enhanced run-time support for shared-memory parallel computing Derek L. Eager and John Zahorjan |
| title_short | Chores |
| title_sort | chores enhanced run time support for shared memory parallel computing |
| title_sub | enhanced run-time support for shared-memory parallel computing |
| topic | Multiprocessors Parallel programming (Computer science) |
| topic_facet | Multiprocessors Parallel programming (Computer science) |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT eagerderekl choresenhancedruntimesupportforsharedmemoryparallelcomputing AT zahorjanjohn choresenhancedruntimesupportforsharedmemoryparallelcomputing |