This paper emphasizes on load balancing issues associated with hybrid programming models for the parallelization of fully permutable nested loops onto SMP clusters. Hybrid parallel programming models usually suffer from intrinsic load imbalance between threads, mainly because most existing message

Abstract This paper emphasizes on load balancing issues associ-ated with hybrid programming models for the parallelization of fully permutable nested loops onto SMP clusters.Hybrid parallel programming models usually suffer from intrinsic load imbalance between threads, mainly becausemost existing

We consider the one-loop two-point function for multi-trace operators in the U(2) sector of N = 4 supersymmetric Yang-Mills at finite N. We derive an expression for it in terms of U(N) and Sn+1 group theory data, where n is the length of the operators. The Clebsch-Gordan operators constructed in [1

basedon a simple yet accurate cost model. The model computes both temporal and spatial reuse of cache lines to find desirable loop organizations. The cost model drives the application of compound transformations consisting of loop permutation, loop fusion, loop distribution, and loop reversal. We

Abstract A G-loop is a loop which is isomorphic to all its loop isotopes. We apply some theorems about permutation groups to get information about G-loops. In particular, we study G-loops of order pq, where p! q are primes and p- (q \Gamma 1). In the case p = 3, the only G-loop of order 3q

this report, we present an experiment with compiler optimizations to improve data locality based on a simple cost model [14]. The model computes both temporal and spatial reuse of cache lines to find desirable loop permutations. The cost model drives the application of compound transformations

Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take

This paper presents a linear algebraic approach to modeling loop transformations. The approach unifies apparently unrelated recent developments in supercompiler technology. Specifically we show the relationship between the dependence abstraction called dependence cones, and fully permutable loop

A loop transversal in a sharply 2-transitive permutation loop Eugene Kuznetsov Abstract. The well-known theorem of M.Hall about the description of a finite sharply 2-transitive permutation group is generalized for the case of permutation loops. It is shown that the identity permutation with the set

In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations included in this framework are called -transformations and include permutation, skewing and reversal, as well as a transformation called loop scaling. This framework