Displaying similar documents to “Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs”

Loop profiling tool for hpc code inspection as an efficient method of FPGA based acceleration

Marcin Pietroń, Paweł Russek, Kazimierz Wiatr (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper presents research on FPGA based acceleration of HPC applications. The most important goal is to extract a code that can be sped up. A major drawback is the lack of a tool which could do it. HPC applications usually consist of a huge amount of a complex source code. This is one of the reasons why the process of acceleration should be as automated as possible. Another reason is to make use of HLLs (High Level Languages) such as Mitrion-C (Mohl, 2006). HLLs were invented to make...

A-loops close to code loops are groups

Aleš Drápal (2000)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let Q be a diassociative A-loop which is centrally nilpotent of class 2 and which is not a group. Then the factor over the centre cannot be an elementary abelian 2-group.

Combinatorial aspects of code loops

Petr Vojtěchovský (2000)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction...

Some remarks on simple Bol loops

Gábor P. Nagy (2008)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper we make some remarks on simple Bol loops which were motivated by questions at the LOOPS'07 conference. We also list some open problems on simple loops.

Regular permutation sets and loops

Rita Capodaglio (2003)

Bollettino dell'Unione Matematica Italiana

Similarity:

Two suitable composition laws are defined in a regular permutation set in order to find new characterizations of some important classes of loops.