The UTFLA: uniformization of non-uniform iteration spaces in two-level perfect nested loops using SFLA

Mahjoub, Shabnam; Vojoudi, Hakimeh

doi:10.1007/s11227-016-1725-8

Cited by 4 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it still suffered from the problem of high runtime and lack of practicality. In [38], which uses the approach based on FLA, three effective factors in the problem of fixed coefficients were considered, greatly limiting the final results. In addition, experiments and evaluations have been performed on limited data sets that are only parallel to a maximum of two known vectors.…”

Section: Related Workmentioning

confidence: 99%

“…In fact, the volume of the area enclosed between these three vectors and the spheres with a radius equal to 1 remains constant by changing the coordinate system and the rotation of the vectors so that one of the vectors coincides on the zaxis. After the rotation of the three original vectors, new vectors are obtained which, instead of cartesian coordinates, their spherical coordinates can be used to calculate DCS using Equations ( 8) to (10) [38]. The vector that matched the z-axis after rotation (𝑣 2 ) has 𝜑 = 0.…”

Section: Figure 6 Values Of Vectors In Spherical Coordinates After Ro...mentioning

confidence: 99%

“…The direction of vectors has been considered low 2D UTFLA [38] -Variety in the number of optimal results obtained -Optimal DCS -…”

Section: -Lack Of Attention To Three Important Input Parameters -mentioning

confidence: 99%

“…So far, little work has been done on the uniformization of two-and three-dimensional iteration spaces in a separate manner [24], [38]. But the problem is that for a 2D space, the size of the dependence cone is proportional to the size of the angle between the BDVS, while in a 3D space, it is proportional to the volume enclosed between the BDVS, and the same mechanism cannot therefore be used for uniformization of both types of loops.…”

mentioning

confidence: 99%

See 3 more Smart Citations

A New Combination Method for Improving Parallelism in Two and Three Level Perfect Nested Loops

et al. 2022

Self Cite

View full text Add to dashboard Cite

The growth of software techniques for implementing applications must go hand in hand with the growth of computer system hardware in the design of multi-core and multi-processor systems; otherwise, we cannot expect to be able to use maximum hardware capacities. One of the most important and challenging techniques for running applications is to run them in parallel with a focus on loop parallelism to reduce execution time. On the other hand, in recent years, many algorithms have been working on volumetric data, i.e., three-dimensional spaces; therefore, parallelization must be possible for all types of two-dimensional and three-dimensional loops. Uniformization is an important part of loop parallelism, and also the present paper's focus. The proposed algorithm in the present paper performed uniformization with a combination of the frog leaping algorithm and the fuzzy system for two-and three-dimensional loops on a wide range of input dependence vectors and achieved a considerable variety of results in the desired time. The results of this study can be used to facilitate the development of parallel codes.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Figure 6 Values Of Vectors In Spherical Coordinates After Ro...mentioning

confidence: 99%

“…The direction of vectors has been considered low 2D UTFLA [38] -Variety in the number of optimal results obtained -Optimal DCS -…”

Section: -Lack Of Attention To Three Important Input Parameters -mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

A New Combination Method for Improving Parallelism in Two and Three Level Perfect Nested Loops

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are two different approaches to the parallelisation of nested loops. In the first approach, the non-uniform iteration space is transformed into a uniform one [18,20,[43][44][45], after which the parallelisation method is used. In fact, in the data dependency analysis step, if the loops do not have a uniform structure, it is not possible to use common and simple methods such as Wavefront to run them in parallel.…”

Section: Related Workmentioning

confidence: 99%

TLP: Towards three‐level loop parallelisation

Mahjoub

Golsorkhtabaramiri

Amiri

2022

IET Computers & Digital Tech

View full text Add to dashboard Cite

Due to the design of computer systems in the multi‐core and/or multi‐processor form, it is possible to use the maximum capacity of processors to run an application with the least time consumed through parallelisation. This is the responsibility of parallel compilers, which perform parallelisation in several steps by distributing iterations between different processors and executing them simultaneously to achieve lower runtime. The present paper focuses on the uniformisation of three‐level perfect nested loops as an important step in parallelisation and proposes a method called Towards Three‐Level Loop Parallelisation (TLP) that uses a combination of a Frog Leaping Algorithm and Fuzzy to achieve optimal results because in recent years, many algorithms have worked on volumetric data, that is, three‐dimensional spaces. Results of the implementation of the TLP algorithm in comparison with existing methods lead to a wide variety of optimal results at desired times, with minimum cone size resulting from the vectors. Besides, the maximum number of input dependence vectors is decomposed by this algorithm. These results can accelerate the process of generating parallel codes and facilitate their development for High‐Performance Computing purposes.

show abstract