Loading...
Please wait, while we are loading the content...
Similar Documents
Supporting Irregular and Dynamic Computations in Data-Parallel Languages (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Dekeyser, Jean-Luc Marquet, Philippe |
| Description | Data-parallel languages support a single instruction flow; the parallelism is expressed at the instruction level. Actually, data-parallel languages have chosen arrays to support the parallelism. This regular data structure allows a natural development of regular parallel algorithms. The implementation of irregular algorithms necessitates a programming effort to project the irregular data structures onto regular structures. In this article we present the different techniques used to manage the irregularity in data-parallel languages. Each of them will be illustrated with standard or experimental data-parallel language constructions. 1 Irregularity and data-parallelism First observe that data-parallelism and task parallelism programming models are derived directly from SIMD and MIMD execution models. The first trace of data parallelism is seen in the first supercomputers such as the Cray 1 or the Cyber 205 that provided a pipelined parallel execution model. The access to contiguous or r... |
| File Format | |
| Language | English |
| Publisher Date | 1996-01-01 |
| Publisher Institution | In The Data Parallel Programming Model |
| Access Restriction | Open |
| Subject Keyword | Regular Parallel Algorithm Irregular Algorithm Data-parallelism First Data Parallelism Dynamic Computation Mimd Execution Model Regular Data Structure Regular Structure Data-parallel Language Irregular Data Structure Programming Effort Different Technique Natural Development Pipelined Parallel Execution Model First Supercomputer Instruction Level Single Instruction Flow Experimental Data-parallel Language Construction First Trace Task Parallelism |
| Content Type | Text |
| Resource Type | Article |
