Loop Structures Optimization and Reordering for Efficient Parallel Processing
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.15, No. 1)Publication Date: 2016-01-15
Authors : Alexandru Vancea; Monica Ciaca; Mihai Avornicului;
Page : 6379-6393
Keywords : ;
Abstract
The problem of choosing an optimal sequence of transformations, leading to the most efficient parallel version of a program remains an open question. Related to this, compilers of the moment only manage to incorporate a set of heuristic decisions. This article treats the transformation of the program, addressing and analyzing the range of transformations of loop structures, that we consider most appropriate today. We tried to exemplify these transformations in case of groups of companies.?
Other Latest Articles
- Web Personalization With Web Usage Mining Technics and Association Rules
- Voltage Flicker Parameters Estimation UsingShuffled Frog Leaping Algorithm (SFLA) andImperialistic Competitive Algorithm (ICA)
- Predicting Machine Translation Comprehension with a Neural Network
- Economic Dispatch Optimization Using Imperialist Competitive Algorithm and compare with PSO algorithm result
- A MEDIATING EFFECT OF DONGLE AND BROADBAND ON THE RELATIONSHIP BETWEEN USERS FACTORS AND CONNECTION IN LIBYA
Last modified: 2016-06-29 15:50:12