Automated problem mapping: the crystal runtime system
The effective utilization of multiprocessors, particularly those with architectures that cannot support shared memory in an efficient way, is currently dependent on the ability of the user to map the problem onto the multiprocessor. In order to obtain high levels of efficiency, this mapping must dis...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New Haven, Connecticut
1987
|
| Schriftenreihe: | Yale University <New Haven, Conn.> / Department of Computer Science: Research report
510 |
| Schlagworte: | |
| Zusammenfassung: | The effective utilization of multiprocessors, particularly those with architectures that cannot support shared memory in an efficient way, is currently dependent on the ability of the user to map the problem onto the multiprocessor. In order to obtain high levels of efficiency, this mapping must distribute computational load relatively evenly between the machine's processors and must minimize the effects of interprocessor communication delay on algorithm performance. The need to explicitly designate a problem decomposition and to verify that the decomposition is both correct and has the desired performance characteristics can be a time consuming and error prone task. In cases in which the load distribution of and algorithm cannot be predicted sufficiently well in advance to allow a deterministic decomposition to be specified, it may be necessary to specify a family of problem decompositions along with a procedure for run time load management. While the development of methods for dynamically balancing loads is an active area of current research without the development of automated mapping methods, the implementation of such schemes can be particularly time consuming and difficult. A methodology will be developed that can insulate the user from the considerations required to produce efficient programs for multiprocessor machines while still enabling the user to achieve high levels of performance. Programs will be written in a very high level programming language Crystal. Keywords: Parallel processing. |
| Beschreibung: | 11 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035582703 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 090624s1987 |||| 00||| engod | ||
| 035 | |a (OCoLC)227695179 | ||
| 035 | |a (DE-599)BVBBV035582703 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Saltz, Joel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automated problem mapping |b the crystal runtime system |
| 264 | 1 | |a New Haven, Connecticut |c 1987 | |
| 300 | |a 11 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Yale University <New Haven, Conn.> / Department of Computer Science: Research report |v 510 | |
| 520 | 3 | |a The effective utilization of multiprocessors, particularly those with architectures that cannot support shared memory in an efficient way, is currently dependent on the ability of the user to map the problem onto the multiprocessor. In order to obtain high levels of efficiency, this mapping must distribute computational load relatively evenly between the machine's processors and must minimize the effects of interprocessor communication delay on algorithm performance. The need to explicitly designate a problem decomposition and to verify that the decomposition is both correct and has the desired performance characteristics can be a time consuming and error prone task. In cases in which the load distribution of and algorithm cannot be predicted sufficiently well in advance to allow a deterministic decomposition to be specified, it may be necessary to specify a family of problem decompositions along with a procedure for run time load management. While the development of methods for dynamically balancing loads is an active area of current research without the development of automated mapping methods, the implementation of such schemes can be particularly time consuming and difficult. A methodology will be developed that can insulate the user from the considerations required to produce efficient programs for multiprocessor machines while still enabling the user to achieve high levels of performance. Programs will be written in a very high level programming language Crystal. Keywords: Parallel processing. | |
| 650 | 4 | |a Crystal computer program | |
| 650 | 4 | |a Crystal programming language | |
| 650 | 4 | |a Run time(Computers) | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Automation |2 dtict | |
| 650 | 7 | |a Compilers |2 dtict | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Computer architecture |2 dtict | |
| 650 | 7 | |a Computer communications |2 dtict | |
| 650 | 7 | |a Computer program reliability |2 dtict | |
| 650 | 7 | |a Decomposition |2 dtict | |
| 650 | 7 | |a Delay |2 dtict | |
| 650 | 7 | |a Efficiency |2 dtict | |
| 650 | 7 | |a Errors |2 dtict | |
| 650 | 7 | |a High level languages |2 dtict | |
| 650 | 7 | |a High rate |2 dtict | |
| 650 | 7 | |a Load distribution |2 dtict | |
| 650 | 7 | |a Mapping |2 dtict | |
| 650 | 7 | |a Memory devices |2 dtict | |
| 650 | 7 | |a Multiprocessors |2 dtict | |
| 650 | 7 | |a Parallel processing |2 dtict | |
| 650 | 7 | |a Specifications |2 dtict | |
| 650 | 7 | |a Time sharing |2 dtict | |
| 650 | 7 | |a Time |2 dtict | |
| 700 | 1 | |a Chen, Marina C. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Research report |t Yale University <New Haven, Conn.> |v 510 |w (DE-604)BV006663362 |9 510 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017638088 | ||
Datensatz im Suchindex
| _version_ | 1804139241588916224 |
|---|---|
| any_adam_object | |
| author | Saltz, Joel Chen, Marina C. |
| author_facet | Saltz, Joel Chen, Marina C. |
| author_role | aut aut |
| author_sort | Saltz, Joel |
| author_variant | j s js m c c mc mcc |
| building | Verbundindex |
| bvnumber | BV035582703 |
| ctrlnum | (OCoLC)227695179 (DE-599)BVBBV035582703 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03512nam a2200613 cb4500</leader><controlfield tag="001">BV035582703</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090624s1987 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227695179</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035582703</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="100" ind1="1" ind2=" "><subfield code="a">Saltz, Joel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automated problem mapping</subfield><subfield code="b">the crystal runtime system</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Haven, Connecticut</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 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">Yale University <New Haven, Conn.> / Department of Computer Science: Research report</subfield><subfield code="v">510</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The effective utilization of multiprocessors, particularly those with architectures that cannot support shared memory in an efficient way, is currently dependent on the ability of the user to map the problem onto the multiprocessor. In order to obtain high levels of efficiency, this mapping must distribute computational load relatively evenly between the machine's processors and must minimize the effects of interprocessor communication delay on algorithm performance. The need to explicitly designate a problem decomposition and to verify that the decomposition is both correct and has the desired performance characteristics can be a time consuming and error prone task. In cases in which the load distribution of and algorithm cannot be predicted sufficiently well in advance to allow a deterministic decomposition to be specified, it may be necessary to specify a family of problem decompositions along with a procedure for run time load management. While the development of methods for dynamically balancing loads is an active area of current research without the development of automated mapping methods, the implementation of such schemes can be particularly time consuming and difficult. A methodology will be developed that can insulate the user from the considerations required to produce efficient programs for multiprocessor machines while still enabling the user to achieve high levels of performance. Programs will be written in a very high level programming language Crystal. Keywords: Parallel processing.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Crystal computer program</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Crystal programming language</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Run time(Computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automation</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Compilers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Systems</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer architecture</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer communications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer program reliability</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Decomposition</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Delay</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Efficiency</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Errors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">High level languages</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">High rate</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Load distribution</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mapping</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Memory devices</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Multiprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Specifications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Time sharing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Time</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Marina C.</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: Research report</subfield><subfield code="t">Yale University <New Haven, Conn.></subfield><subfield code="v">510</subfield><subfield code="w">(DE-604)BV006663362</subfield><subfield code="9">510</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017638088</subfield></datafield></record></collection> |
| id | DE-604.BV035582703 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:40:57Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017638088 |
| oclc_num | 227695179 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 11 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series2 | Yale University <New Haven, Conn.> / Department of Computer Science: Research report |
| spelling | Saltz, Joel Verfasser aut Automated problem mapping the crystal runtime system New Haven, Connecticut 1987 11 S. txt rdacontent n rdamedia nc rdacarrier Yale University <New Haven, Conn.> / Department of Computer Science: Research report 510 The effective utilization of multiprocessors, particularly those with architectures that cannot support shared memory in an efficient way, is currently dependent on the ability of the user to map the problem onto the multiprocessor. In order to obtain high levels of efficiency, this mapping must distribute computational load relatively evenly between the machine's processors and must minimize the effects of interprocessor communication delay on algorithm performance. The need to explicitly designate a problem decomposition and to verify that the decomposition is both correct and has the desired performance characteristics can be a time consuming and error prone task. In cases in which the load distribution of and algorithm cannot be predicted sufficiently well in advance to allow a deterministic decomposition to be specified, it may be necessary to specify a family of problem decompositions along with a procedure for run time load management. While the development of methods for dynamically balancing loads is an active area of current research without the development of automated mapping methods, the implementation of such schemes can be particularly time consuming and difficult. A methodology will be developed that can insulate the user from the considerations required to produce efficient programs for multiprocessor machines while still enabling the user to achieve high levels of performance. Programs will be written in a very high level programming language Crystal. Keywords: Parallel processing. Crystal computer program Crystal programming language Run time(Computers) Algorithms dtict Automation dtict Compilers dtict Computations dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Computer architecture dtict Computer communications dtict Computer program reliability dtict Decomposition dtict Delay dtict Efficiency dtict Errors dtict High level languages dtict High rate dtict Load distribution dtict Mapping dtict Memory devices dtict Multiprocessors dtict Parallel processing dtict Specifications dtict Time sharing dtict Time dtict Chen, Marina C. Verfasser aut Department of Computer Science: Research report Yale University <New Haven, Conn.> 510 (DE-604)BV006663362 510 |
| spellingShingle | Saltz, Joel Chen, Marina C. Automated problem mapping the crystal runtime system Crystal computer program Crystal programming language Run time(Computers) Algorithms dtict Automation dtict Compilers dtict Computations dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Computer architecture dtict Computer communications dtict Computer program reliability dtict Decomposition dtict Delay dtict Efficiency dtict Errors dtict High level languages dtict High rate dtict Load distribution dtict Mapping dtict Memory devices dtict Multiprocessors dtict Parallel processing dtict Specifications dtict Time sharing dtict Time dtict |
| title | Automated problem mapping the crystal runtime system |
| title_auth | Automated problem mapping the crystal runtime system |
| title_exact_search | Automated problem mapping the crystal runtime system |
| title_full | Automated problem mapping the crystal runtime system |
| title_fullStr | Automated problem mapping the crystal runtime system |
| title_full_unstemmed | Automated problem mapping the crystal runtime system |
| title_short | Automated problem mapping |
| title_sort | automated problem mapping the crystal runtime system |
| title_sub | the crystal runtime system |
| topic | Crystal computer program Crystal programming language Run time(Computers) Algorithms dtict Automation dtict Compilers dtict Computations dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer Systems scgdst Computer architecture dtict Computer communications dtict Computer program reliability dtict Decomposition dtict Delay dtict Efficiency dtict Errors dtict High level languages dtict High rate dtict Load distribution dtict Mapping dtict Memory devices dtict Multiprocessors dtict Parallel processing dtict Specifications dtict Time sharing dtict Time dtict |
| topic_facet | Crystal computer program Crystal programming language Run time(Computers) Algorithms Automation Compilers Computations Computer Hardware Computer Programming and Software Computer Systems Computer architecture Computer communications Computer program reliability Decomposition Delay Efficiency Errors High level languages High rate Load distribution Mapping Memory devices Multiprocessors Parallel processing Specifications Time sharing Time |
| volume_link | (DE-604)BV006663362 |
| work_keys_str_mv | AT saltzjoel automatedproblemmappingthecrystalruntimesystem AT chenmarinac automatedproblemmappingthecrystalruntimesystem |