Results 1  10
of
222
Load Balancing Hybrid Programming Models for SMP Clusters and Fully Permutable Loops
"... 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 p ..."
Abstract
 Add to MetaCart
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
Load Balancing Hybrid Programming Models for SMP Clusters and FullyPermutable Loops
"... Abstract 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 becausemost existing m ..."
Abstract
 Add to MetaCart
Abstract 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 becausemost existing
Permutations and the Loop
, 2008
"... We consider the oneloop twopoint function for multitrace operators in the U(2) sector of N = 4 supersymmetric YangMills 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 ClebschGordan operators constructed in [1] ..."
Abstract
 Add to MetaCart
We consider the oneloop twopoint function for multitrace operators in the U(2) sector of N = 4 supersymmetric YangMills 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 ClebschGordan operators constructed in [1
Compiler Optimizations for Improving Data Locality
 IN PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS
, 1994
"... In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effective when programs exhibit data locality. In this paper, we present compiler optimizations to improve data locality base ..."
Abstract

Cited by 220 (17 self)
 Add to MetaCart
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
Gloops and permutation groups
 J. Algebra
, 1999
"... Abstract A Gloop is a loop which is isomorphic to all its loop isotopes. We apply some theorems about permutation groups to get information about Gloops. In particular, we study Gloops of order pq, where p! q are primes and p (q \Gamma 1). In the case p = 3, the only Gloop of order 3q is the gr ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract A Gloop is a loop which is isomorphic to all its loop isotopes. We apply some theorems about permutation groups to get information about Gloops. In particular, we study Gloops of order pq, where p! q are primes and p (q \Gamma 1). In the case p = 3, the only Gloop of order 3q
An Analysis of Loop Permutation on the HP PARISC
, 1995
"... 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 consi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
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
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling
, 1996
"... Tiling is a technique used for exploiting mediumgrain 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 advantag ..."
Abstract

Cited by 39 (10 self)
 Add to MetaCart
Tiling is a technique used for exploiting mediumgrain 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
Nonunimodular Transformations of Nested Loops
 IN PROC. SUPERCOMPUTING 92
, 1992
"... 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 nes ..."
Abstract

Cited by 46 (12 self)
 Add to MetaCart
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
unknown title
"... A loop transversal in a sharply 2transitive permutation loop Eugene Kuznetsov Abstract. The wellknown theorem of M.Hall about the description of a finite sharply 2transitive permutation group is generalized for the case of permutation loops. It is shown that the identity permutation with the set ..."
Abstract
 Add to MetaCart
A loop transversal in a sharply 2transitive permutation loop Eugene Kuznetsov Abstract. The wellknown theorem of M.Hall about the description of a finite sharply 2transitive permutation group is generalized for the case of permutation loops. It is shown that the identity permutation with the set
A Singular Loop Transformation Framework Based on Nonsingular Matrices
, 1992
"... In this paper, we discuss a loop transformation framework that is based on integer nonsingular 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 is mo ..."
Abstract

Cited by 130 (8 self)
 Add to MetaCart
In this paper, we discuss a loop transformation framework that is based on integer nonsingular 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
Results 1  10
of
222