Using the parallel complexity of programs to improve compaction
نویسنده
چکیده
This paper focuses on the compaction of tail-recursive programs | arbitrary programs with condi-tionals, loops and function calls appearing in terminal position | for ne-grain parallel machines like VLIW or super-scalars. An iterative compaction method based on instruction move-up and fold/unfold transformations is studied. In order to speed-up compaction and produce shorter schedules, we propose to use some information about the parallel complexity of expressions. This information is used on the y during the com-paction process to decide whether to unfold a function or not.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملFine Grain Parallelisation of Functional Programs for VLIW or Super-scalar Architectures
This paper presents a compaction method of functional programs (eg, ML programs) for super-scalars or VLIW architectures. It is a generalisation of the Percolation scheduling system 1] and Perfect Pipelining 2]. It is described by a set of program transformations respecting data-dependences. Instead of managing a control-ow based representation of programs, the compaction is directly applied to...
متن کاملNumerical study of soil dynamic compaction using ABAQUS model
One of the most important methods of soil compaction is dynamic compaction, which is one of the oldest and economical methods of soil improvement up to great depths. This method is applied due to its many benefits, including its economic procedure to correct many kinds of soil. One of the most important issues that affect soil improvement methods is being economic. The three main method...
متن کاملLow Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System
Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...
متن کامل