Last update: Thu Apr 12 03:37:15 MDT 2012
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Sarkar:1992:GFI,
author = "Vivek Sarkar and Radhika Thekkath",
title = "A general framework for iteration-reordering loop
transformations",
journal = j-SIGPLAN,
volume = "27",
number = "7",
pages = "175--187",
month = jul,
year = "1992",
CODEN = "SINODQ",
ISBN = "0-89791-475-9",
ISBN-13 = "978-0-89791-475-8",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
ISSN-L = "0362-1340",
LCCN = "QA76.7.S53 1992",
bibdate = "Sun Dec 14 09:16:22 MST 2003",
bibsource = "Compendex database; http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p175-sarkar/",
abstract = "This paper describes a general framework for
representing iteration-reordering transformations.
These transformations can be both matrix-based and
non-matrix-based. Transformations are defined by rules
for mapping dependence vectors, rules for mapping loop
bound expressions, and rules for creating new
initialization statements. The framework is extensible,
and can be used to represent any iteration-reordering
transformation. Mapping rules for several common
transformations are included in the paper.",
acknowledgement = ack-nhfb,
affiliation = "IBM Palo ALto Scientific Cent",
affiliationaddress = "Palo Alto, CA, USA",
annote = "Published as part of the Proceedings of PLDI'92.",
classification = "723.1",
conference = "Proceedings of the ACM SIGPLAN '92 Conference on
Programming Language Design and Implementation",
conferenceyear = "1992",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer programming; Iteration reordering
transformations; Mapping rules; Program compilers",
meetingaddress = "San Francisco, CA, USA",
meetingdate = "Jun 17--19 1992",
meetingdate2 = "06/17--19/92",
sponsor = "ACM",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs.",
}
Related entries
- any,
25(4)73,
25(6)92,
27(7)82,
27(7)116,
27(7)200,
27(7)224,
27(7)273,
27(7)311,
28(3)69,
28(3)177,
28(3)359,
28(3)367,
28(6)177,
28(6)197,
28(8)90,
29(11)232,
29(11)242,
30(6)67,
30(6)186,
30(6)196,
30(6)218,
30(11)41,
30(11)134,
33(7)1
- both,
25(1)59,
25(6)9,
25(6)85-1,
25(6)102,
25(6)112,
26(4)28,
26(7)83,
27(5)z,
27(7)82,
27(7)94,
27(7)212,
27(7)249,
27(7)283,
27(10)452,
28(3)231,
28(3)299,
28(3)353,
28(3)357,
28(6)26,
28(6)177,
28(6)248,
28(7)13,
28(7)23,
28(7)54-1,
28(7)112,
28(7)129,
29(6)1,
29(6)290,
29(6)302,
29(8)59,
29(8)119,
29(11)2,
29(11)38,
29(11)61,
29(11)98,
29(11)110,
29(11)122,
29(11)171,
29(11)183,
29(11)252,
29(11)274,
29(11)308,
30(2)25,
30(3)50,
30(6)56,
30(6)67,
30(6)93,
30(6)130,
30(6)186,
30(6)205,
30(6)279,
30(8)29,
30(8)68,
30(8)102,
30(8)156,
30(8)179,
30(8)207,
30(11)20-1,
31(5)108
- bound,
25(6)66,
25(6)272,
25(6)272-1,
25(6)296,
28(6)100,
28(6)258,
28(7)129,
28(7)208,
28(8)90,
29(11)76-1,
30(8)58,
30(8)92,
30(8)207,
30(11)1,
30(11)7,
30(11)70,
30(11)88,
30(11)99,
32(8)176,
33(5)249
- common,
26(8)60,
27(4)27,
27(7)55,
27(7)188-1,
27(9)262,
28(3)231,
28(3)299,
28(3)353,
28(6)147,
28(6)197,
28(7)44,
28(7)92,
28(8)19,
29(6)1,
29(6)49,
29(6)196,
29(11)132-1,
30(3)35,
30(6)315,
31(12)52,
33(2)18,
33(2)18-1,
33(9)103
- creating,
29(6)159,
30(10)370,
30(10)370-1,
31(10)18,
32(2)16
- defined,
28(1)72,
28(2)21,
28(3)333,
28(3)345,
28(3)347,
28(7)23,
29(8)35,
29(8)119,
29(11)122,
29(11)319,
30(3)35,
30(3)83,
30(6)218,
30(11)50
- expression,
25(6)283,
25(7)59,
26(1)85,
27(4)55,
27(7)162,
28(1)68,
28(2)21,
28(3)359,
28(3)361,
28(5)49,
29(6)159,
29(8)1,
29(9)9,
30(6)47,
30(6)233,
30(8)92,
30(8)112,
33(5)1,
33(9)77
- extensible,
25(6)283,
26(11)247,
27(7)1,
27(7)82,
28(3)357,
28(12)96,
29(1)13,
29(10)191,
29(12)38,
30(8)68,
31(5)160
- included,
28(3)299,
28(12)169
- initialization,
33(10)310
- iteration,
17(9)18,
25(6)189,
25(6)311,
27(7)188-1,
27(7)283,
28(3)355,
28(6)68,
28(6)300,
28(7)83,
29(6)36,
29(6)121,
29(9)51,
30(1)20,
30(6)218,
30(8)1,
30(11)134,
34(9)102,
34(11)73
- mapping,
26(7)21,
27(7)1,
28(1)72,
28(7)92,
29(10)176,
29(11)171,
30(3)62,
30(6)79-1,
30(6)139,
30(6)205,
30(8)134,
30(11)60,
32(5)171,
32(7)168,
33(7)19,
33(11)24
- PLDI'92.,
27(7)1,
27(7)12,
27(7)22,
27(7)32,
27(7)44,
27(7)55,
27(7)68,
27(7)82,
27(7)94,
27(7)106,
27(7)116,
27(7)128,
27(7)140,
27(7)152,
27(7)162,
27(7)188-1,
27(7)200,
27(7)212,
27(7)224,
27(7)235,
27(7)249,
27(7)261,
27(7)273,
27(7)283,
27(7)300,
27(7)311,
27(7)322,
27(7)331,
27(7)341
- reordering,
25(6)322,
29(6)36,
29(6)159,
29(11)183,
29(11)242,
33(5)130
- represent,
25(6)234,
25(6)337,
28(6)237,
29(6)230,
30(3)35,
30(6)139,
30(8)48
- representing,
25(6)66,
25(6)234,
29(10)403,
30(3)62,
30(3)119,
30(7)45,
30(11)31,
31(5)99,
34(9)183
- rule,
6(4)111,
25(6)9,
26(2)64,
26(9)274,
27(11)27,
28(7)119,
29(9)44,
29(9)72,
30(10)235,
30(10)235-1,
31(1)44,
32(10)77,
33(2)65
- Sarkar, Vivek,
25(6)322,
25(6)337,
33(10)296,
33(10)296-1,
33(11)46
- several,
25(4)20,
25(4)59,
25(6)9,
25(6)246,
25(6)283,
25(10)237,
27(7)68,
27(7)212,
27(9)274,
28(3)1,
28(3)351,
28(6)90,
28(6)126,
28(6)207-1,
28(6)278,
28(7)112,
28(7)218,
29(6)73,
29(8)59,
29(11)12,
29(11)25,
29(11)38,
29(11)76-1,
29(11)110,
29(11)242,
29(11)252,
30(3)23,
30(3)50,
30(3)62,
30(6)67,
30(6)116,
30(6)315,
30(8)1,
30(8)48,
30(8)80-1,
30(8)144,
30(8)179,
30(11)1,
30(11)79,
30(11)88,
30(11)146-1,
33(2)65,
33(7)51,
33(7)75,
33(7)83,
33(11)252,
33(11)295
- statement,
25(6)78,
25(6)246,
25(6)311,
26(6)145,
27(7)82,
27(7)322,
27(8)83,
28(2)21,
28(3)361,
28(6)13,
28(7)129,
28(7)169,
28(11)13,
29(2)33,
29(6)73,
29(6)135,
29(6)302,
29(8)59,
30(6)258,
32(1)59,
33(7)27
- Thekkath, Radhika,
29(11)328
- vector,
25(6)283,
25(8)53,
26(4)154,
28(7)102,
28(7)119,
28(7)119-1,
29(2)13,
29(4)31,
29(6)266