Institut De Recherche Institut Recherche Informatique Systmes Alatoires  Home/Search
Context
Related
| irisa.fr/polylib/documen...ZPolylib.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: irisa.fr/polylib/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Polyhedra are commonly used for representing iteration domains of loop nests with unit stride: the iteration domain of a loop is associated with the set of integer points contained in a polyhedron. Z-polyhedra are natural extension of polyhedra, in the sense that they represent iteration domains of loop nests with non-unit stride (they are polyhedra intersected with integral lattices). The polyhedral library (Polylib) has been developed for computing on polyhedra, it is now widely used in the... (Update)
Active bibliography (related documents): More All
1.1: On Manipulating Z-Polyhedra - Quinton, al. (1996) (Correct)
0.3: Hardware Driven Considerations For Energy Based Applications - Memin, Risset (1999) (Correct)
0.2: Periodic Polyhedra - Meister (2004) (Correct)
Similar documents based on text: More All
0.2: Supervisory Control of Discrete Event Systems - Marchand, Gaudin (2004) (Correct)
0.2: Unknown - Institut De Recherche (Correct)
0.2: The Information Structure of Indulgent Consensus - Guerraoui, Raynal (2003) (Correct)
BibTeX entry: (Update)
@misc{ recherche-unknown,
author = "Institut De Recherche",
title = "Unknown",
url = "citeseer.ist.psu.edu/666856.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
245 The omega test: a fast and practical integer programming alg.. - Pugh - 1992
183 Some efficient solutions to the affine scheduling problem - Feautrier - 1992
54 A library for doing polyhedral operations - Wilde - 1993
48 The double description method (context) - Motzkin, Raiffa et al. - 1983
21 G'en'eration automatique de codes de transfert pour multipro.. (context) - Ancourt - 1991
21 Algorithm for discovering the set of all the solution of a l.. (context) - Chernikova - 1968
19 A note on Chernikova's algorithm - Le Verge - 1992
14 A compiler for Application-Specific Processor Arrays (context) - Teich - 1993
10 Background Memory Allocation for Multi-Dimensional Signal Pr.. (context) - Balasa - 1995
9 Code generation in the polytope model - Griebl, Lengauer et al. - 1998
8 Extension of chernikova's algorithm for solving general mixe.. (context) - Fern'andez, Quinton - 1988
6 Partitioning of processor arrays: A piecewise regular approa.. (context) - Teich, Thiele - 1993
5 Techniques de parall'elisation automatique de nids de boucle.. (context) - Darte - 1993
4 polyhedra using a canonical representation (context) - Quinton, Rajopadhye et al. - 1997
3 Hipars: a tool for automatic conversion of nested loop progr.. (context) - Held - 1994
2 Extension of the alpha language to recurrences on sparse per.. (context) - Quinton, Rajopadhye et al. - 1996
1 Technical Report (context) - Quinton, Rajopadhye et al. - 1996
1 London Mathematical Society Monographs ffi (context) - Cassels, Forms - 1978
1 Resolution and separation theormes for polyhedral convex set.. (context) - Goldman - 1956
Documents on the same site (http://www.irisa.fr/polylib/):
PolyLib: A Library for Manipulating Parameterized Polyhedra - Loechner (1999) (Correct)
A note on Chernikova's Algorithm - Le Verge July (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC