scientific article; zbMATH DE number 3936481
[For the entire collection see Zbl 0547.00056.] This paper presents a solution to the problem of vectorizing loops whose step may be other than 1. The author assumes that statements within the loop reference elements of a one-dimensional array and the indices have the form \(m\times i+n\), where m and n are constants and i is the loop control variable. She discusses the problem assuming that in one cycle of the loop some elements of the array get their new values calculated from values of some other elements of the same array. Executions of the loop body for two or more values of i in parallel one with another are only possible when: (a) no element of the array is used in more than one such executions, (b) if an element is assigned a new value in one of the executions, it may not be used in another, (c) an element may not be used before it is assigned its new value. As the solution the author proposes to consider certain compressed form of the execution graph of the loop. The graph nodes represent the loop statements and edges are marked with distances between statements in terms of differences of index values of the elements involved. The graph shows partial order in which statements may be executed and, consequently, paths through the graph that are independent of each other, i.e. sequences that may be performed in parallel.
- The parallel computing of the fixed point of a cyclic operator
- Parallel information-based complexity
- Parallel-algorithm communication operations generated by uniform dependences
- scientific article; zbMATH DE number 3845030
- Parallel complexity of the regular code problem
- On Synchronous Parallel Computations with Independent Probabilistic Choice
- Exact and approximate operator parallelism
- On the communication complexity of parallel computation
- The operator-valued parallelism
- scientific article; zbMATH DE number 1372681
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707366)