Integrated Support for Task and Data Parallelism
Identifieur interne : 001127 ( Main/Exploration ); précédent : 001126; suivant : 001128Integrated Support for Task and Data Parallelism
Auteurs : Mani Chandy ; Lan Foster ; Ken Kennedy ; Charles Koelbel ; Chau-Wen TsengSource :
- International Journal of High Performance Computing Applications [ 1094-3420 ] ; 1994-06.
English descriptors
- Teeft :
- Appropriate ports, Argonne, Array, Array section, Basic approach, Best performance, Chandy, Code places, Communication channels, Compilation process, Compilation system, Compiler, Compiler analysis, Compiler optimizations, Compiler support, Compiler technology, Computation, Computation partition, Computational load, Computer science, Concurrent computations, Data decomposition, Data decomposition specifications, Data distribution, Data movement, Data parallelism, Data structures, Dataparallel, Exchange data, Explicit coordination, Explicit message, Extrinsic, Extrinsic procedure, Extrinsic procedure facility, Extrinsic procedures, Federal hpcc program, Fluid dynamics, Fortran, Full programming system, High performance, High performance fortran, High performance fortran forum, Hiranandani, Hpfcall, Implementation issues, Implicit parallelism, Individual tasks, Interface, Interprocedural analysis, Irregular computations, Iwarp compiler, Language extensions, Language features, Large data structure, Large data structures, Linear algebra, Machine mapping, Machine resources, Machines corporation, Major advantage, Mapping decisions, Memory allocation, Memory architectures, Mimd machines, More detail, Optimization, Overlap areas, Parallel architectures, Parallel computation, Parallel computer, Parallel computers, Parallel languages, Parallel loops, Parallel machines, Parallel processing, Parallel programming, Parallel programs, Parallel research, Parallelism, Physical processor, Port arrays, Port variables, Preliminary experiences show, Problem size, Proc, Procedure boundaries, Processcall dynamics, Processes hpfcall hpfcall endprocesses, Processor, Professor kennedy, Program language design, Programmer, Programming, Programming model, Programming models, Programming paradigm, Prototype, Prototype compiler, Prototype fortran, Redistribution operations, Remote procedure, Research scientist, Resource management, Rice fortran, Rice university, Runtime, Scientific applications, Specification, Standards institute, Submachine annotation, Synchronization, Syracuse university, Task parallelism, Task parallelism exploits, Tseng, Unstructured forms, Version edition, Virtual computer, Virtual processors, York university, Zima.
Abstract
We present an overview of research at the Center for Research on Parallel Computation designed to provide an efficient, portable programming model for scientific applications possessing both task and data parallelism. Fortran M programs exploit task parallelism by provid ing language extensions for user-defined process man agement and typed communication channels. A com bination of compiler and run-time system support en sures modularity, safety, portability, and efficiency. Fortran D and High Performance Fortran programs ex ploit data parallelism by providing language exten sions for user-defined data decomposition specifica tions, parallel loops, and parallel-array operations.
Url:
DOI: 10.1177/109434209400800202
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000463
- to stream Istex, to step Curation: 000438
- to stream Istex, to step Checkpoint: 000F04
- to stream Main, to step Merge: 001129
- to stream Main, to step Curation: 001127
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Integrated Support for Task and Data Parallelism</title><author wicri:is="90%"><name sortKey="Chandy, Mani" sort="Chandy, Mani" uniqKey="Chandy M" first="Mani" last="Chandy">Mani Chandy</name></author><author wicri:is="90%"><name sortKey="Foster, Lan" sort="Foster, Lan" uniqKey="Foster L" first="Lan" last="Foster">Lan Foster</name></author><author wicri:is="90%"><name sortKey="Kennedy, Ken" sort="Kennedy, Ken" uniqKey="Kennedy K" first="Ken" last="Kennedy">Ken Kennedy</name></author><author wicri:is="90%"><name sortKey="Koelbel, Charles" sort="Koelbel, Charles" uniqKey="Koelbel C" first="Charles" last="Koelbel">Charles Koelbel</name></author><author wicri:is="90%"><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2CFE246E2C63F27C620D6740C53826EB4660DD66</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1177/109434209400800202</idno><idno type="url">https://api.istex.fr/document/2CFE246E2C63F27C620D6740C53826EB4660DD66/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000463</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000463</idno><idno type="wicri:Area/Istex/Curation">000438</idno><idno type="wicri:Area/Istex/Checkpoint">000F04</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F04</idno><idno type="wicri:doubleKey">1094-3420:1994:Chandy M:integrated:support:for</idno><idno type="wicri:Area/Main/Merge">001129</idno><idno type="wicri:Area/Main/Curation">001127</idno><idno type="wicri:Area/Main/Exploration">001127</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Integrated Support for Task and Data Parallelism</title><author wicri:is="90%"><name sortKey="Chandy, Mani" sort="Chandy, Mani" uniqKey="Chandy M" first="Mani" last="Chandy">Mani Chandy</name><affiliation><wicri:noCountry code="subField">CALIFORNIA</wicri:noCountry></affiliation></author><author wicri:is="90%"><name sortKey="Foster, Lan" sort="Foster, Lan" uniqKey="Foster L" first="Lan" last="Foster">Lan Foster</name><affiliation><wicri:noCountry code="subField">ILLINOIS</wicri:noCountry></affiliation></author><author wicri:is="90%"><name sortKey="Kennedy, Ken" sort="Kennedy, Ken" uniqKey="Kennedy K" first="Ken" last="Kennedy">Ken Kennedy</name><affiliation><wicri:noCountry code="subField">TEXAS</wicri:noCountry></affiliation></author><author wicri:is="90%"><name sortKey="Koelbel, Charles" sort="Koelbel, Charles" uniqKey="Koelbel C" first="Charles" last="Koelbel">Charles Koelbel</name><affiliation><wicri:noCountry code="subField">TEXAS</wicri:noCountry></affiliation></author><author wicri:is="90%"><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name><affiliation><wicri:noCountry code="subField">TEXAS</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="j">International Journal of High Performance Computing Applications</title><idno type="ISSN">1094-3420</idno><idno type="eISSN">1741-2846</idno><imprint><publisher>Sage Publications</publisher><pubPlace>Sage CA: Thousand Oaks, CA</pubPlace><date type="published" when="1994-06">1994-06</date><biblScope unit="volume">8</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="80">80</biblScope><biblScope unit="page" to="98">98</biblScope></imprint><idno type="ISSN">1094-3420</idno></series><idno type="istex">2CFE246E2C63F27C620D6740C53826EB4660DD66</idno><idno type="DOI">10.1177/109434209400800202</idno><idno type="ArticleID">10.1177_109434209400800202</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1094-3420</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Appropriate ports</term><term>Argonne</term><term>Array</term><term>Array section</term><term>Basic approach</term><term>Best performance</term><term>Chandy</term><term>Code places</term><term>Communication channels</term><term>Compilation process</term><term>Compilation system</term><term>Compiler</term><term>Compiler analysis</term><term>Compiler optimizations</term><term>Compiler support</term><term>Compiler technology</term><term>Computation</term><term>Computation partition</term><term>Computational load</term><term>Computer science</term><term>Concurrent computations</term><term>Data decomposition</term><term>Data decomposition specifications</term><term>Data distribution</term><term>Data movement</term><term>Data parallelism</term><term>Data structures</term><term>Dataparallel</term><term>Exchange data</term><term>Explicit coordination</term><term>Explicit message</term><term>Extrinsic</term><term>Extrinsic procedure</term><term>Extrinsic procedure facility</term><term>Extrinsic procedures</term><term>Federal hpcc program</term><term>Fluid dynamics</term><term>Fortran</term><term>Full programming system</term><term>High performance</term><term>High performance fortran</term><term>High performance fortran forum</term><term>Hiranandani</term><term>Hpfcall</term><term>Implementation issues</term><term>Implicit parallelism</term><term>Individual tasks</term><term>Interface</term><term>Interprocedural analysis</term><term>Irregular computations</term><term>Iwarp compiler</term><term>Language extensions</term><term>Language features</term><term>Large data structure</term><term>Large data structures</term><term>Linear algebra</term><term>Machine mapping</term><term>Machine resources</term><term>Machines corporation</term><term>Major advantage</term><term>Mapping decisions</term><term>Memory allocation</term><term>Memory architectures</term><term>Mimd machines</term><term>More detail</term><term>Optimization</term><term>Overlap areas</term><term>Parallel architectures</term><term>Parallel computation</term><term>Parallel computer</term><term>Parallel computers</term><term>Parallel languages</term><term>Parallel loops</term><term>Parallel machines</term><term>Parallel processing</term><term>Parallel programming</term><term>Parallel programs</term><term>Parallel research</term><term>Parallelism</term><term>Physical processor</term><term>Port arrays</term><term>Port variables</term><term>Preliminary experiences show</term><term>Problem size</term><term>Proc</term><term>Procedure boundaries</term><term>Processcall dynamics</term><term>Processes hpfcall hpfcall endprocesses</term><term>Processor</term><term>Professor kennedy</term><term>Program language design</term><term>Programmer</term><term>Programming</term><term>Programming model</term><term>Programming models</term><term>Programming paradigm</term><term>Prototype</term><term>Prototype compiler</term><term>Prototype fortran</term><term>Redistribution operations</term><term>Remote procedure</term><term>Research scientist</term><term>Resource management</term><term>Rice fortran</term><term>Rice university</term><term>Runtime</term><term>Scientific applications</term><term>Specification</term><term>Standards institute</term><term>Submachine annotation</term><term>Synchronization</term><term>Syracuse university</term><term>Task parallelism</term><term>Task parallelism exploits</term><term>Tseng</term><term>Unstructured forms</term><term>Version edition</term><term>Virtual computer</term><term>Virtual processors</term><term>York university</term><term>Zima</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We present an overview of research at the Center for Research on Parallel Computation designed to provide an efficient, portable programming model for scientific applications possessing both task and data parallelism. Fortran M programs exploit task parallelism by provid ing language extensions for user-defined process man agement and typed communication channels. A com bination of compiler and run-time system support en sures modularity, safety, portability, and efficiency. Fortran D and High Performance Fortran programs ex ploit data parallelism by providing language exten sions for user-defined data decomposition specifica tions, parallel loops, and parallel-array operations.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Chandy, Mani" sort="Chandy, Mani" uniqKey="Chandy M" first="Mani" last="Chandy">Mani Chandy</name><name sortKey="Foster, Lan" sort="Foster, Lan" uniqKey="Foster L" first="Lan" last="Foster">Lan Foster</name><name sortKey="Kennedy, Ken" sort="Kennedy, Ken" uniqKey="Kennedy K" first="Ken" last="Kennedy">Ken Kennedy</name><name sortKey="Koelbel, Charles" sort="Koelbel, Charles" uniqKey="Koelbel C" first="Charles" last="Koelbel">Charles Koelbel</name><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001127 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001127 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2CFE246E2C63F27C620D6740C53826EB4660DD66
|texte= Integrated Support for Task and Data Parallelism
}}
| This area was generated with Dilib version V0.6.33. |  |