Entry Dhamdhere:1990:ULA from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
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{Dhamdhere:1990:ULA,
author = "D. M. Dhamdhere",
title = "A usually linear algorithm for register assignment
using edge placement of load and store instructions",
journal = j-COMP-LANGS,
volume = "15",
number = "2",
pages = "83--94",
month = "????",
year = "1990",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Indian Inst of Technology",
affiliationaddress = "Bombay, India",
classcodes = "C6150J (Operating systems); C6150C (Compilers,
interpreters and other processors); C4240 (Programming
and algorithm theory); C1180 (Optimisation
techniques)",
classification = "722; 723",
corpsource = "Comput. Sci. and Eng., Indian Inst. of Technol.,
Bombay, India",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "assignment; bidirectional data flow dependencies; code
placement; compilers; complexity bound; computational
complexity; Computer Operating Systems; Computer
Programming--Algorithms; Data Flow Dependencies; edge
placement; load instructions; loop structures;
optimisation; profitability; program compilers; Program
Compilers; program optimization; programming theory;
register; Register Assignment Algorithms; single entry;
single entry-single exit control structures; storage
allocation; store instructions; usually linear
algorithm",
treatment = "P Practical",
}
Related entries
- Algorithms, Programming-,
14(2)93,
14(2)99,
14(2)109,
14(2)125,
14(3)181,
14(4)239,
14(4)255,
14(4)263,
15(2)109,
16(3)235
- allocation,
6(1)47,
6(3)115,
12(3)145,
13(2)75,
15(2)109,
16(2)179,
19(2)135,
21(2)101,
21(2)113,
22(2)51,
22(4)237,
24(1)33,
35(4)406
- assignment,
1(4)287,
3(2)135,
4(3)187,
13(2)75,
22(1)1,
35(2)173
- bidirectional,
8(2)69,
29(1)15
- bound,
40(3)155
- complexity,
3(3)163,
7(2)61,
7(3)103,
7(3)147,
9(3)133,
9(3)203,
10(3)211,
13(1)23,
13(3)109,
14(1)11,
14(2)125,
15(1)27,
17(4)251,
17(4)269,
19(2)135,
19(3)169,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)177,
20(4)239,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(2)113,
24(1)33
- computational,
1(1)17,
2(1)27,
7(3)147,
10(1)43,
10(3)211,
11(1)39,
13(1)13,
13(3)109,
14(1)11,
14(1)53,
14(2)125,
14(4)225,
15(1)1,
15(1)27,
15(4)251,
16(2)113,
16(2)147,
17(4)251,
17(4)269,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(2)135,
19(3)157,
19(3)169,
20(1)1,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)151,
20(3)177,
20(4)213,
20(4)239,
20(4)253,
20(4)267,
21(1)17,
21(1)49,
21(2)67,
21(2)101,
21(2)113,
22(2)51,
22(2)115,
22(4)225,
23(1)1,
23(1)25,
23(2)61,
23(2)87,
23(2)121,
24(1)33,
33(1)1,
35(4)406,
39(4)163,
54(z)95
- control,
1(1)3,
3(3)163,
4(3)155,
5(3)141,
6(3)131,
7(2)89,
8(1)1,
8(1)15,
8(2)61,
9(1)1,
9(3)133,
9(3)183,
10(2)75,
10(3)179,
11(3)143,
12(1)39,
13(3)109,
14(1)1,
14(3)153,
14(4)255,
15(2)109,
15(3)141,
16(1)39,
16(2)147,
16(3)197,
17(4)269,
18(4)217,
19(1)51,
20(1)53,
20(2)117,
21(1)17,
22(1)15,
22(4)259,
23(2)87,
24(4)229,
39(3)67,
39(3)109,
45(z)80,
45(z)161,
47(z)44
- dependency,
36(3)250,
53(z)27
- Dhamdhere, D. M.,
8(2)69,
13(2)75,
15(3)127
- edge,
5(2)115
- entry,
15(1)27,
17(4)269,
22(4)225,
22(4)259
- flow,
1(2)161,
1(3)197,
3(1)1,
3(3)163,
4(3)155,
5(3)141,
7(1)41,
7(2)53,
8(1)27,
8(2)69,
9(2)97,
9(3)203,
10(1)37,
10(2)91,
13(2)75,
13(3)109,
19(2)105,
21(1)49,
21(3)165,
28(1)3,
29(1)15,
35(1)63,
50(z)82,
54(z)273
- instruction,
9(3)149,
10(2)147,
11(1)1,
13(2)75,
15(3)127,
19(3)169,
21(1)49,
21(2)101,
21(3)191,
24(1)33
- linear,
12(1)1,
13(3)109,
20(1)43,
20(2)89,
20(4)239,
21(1)49,
21(2)113
- load,
21(1)49
- loop,
8(2)69,
14(2)125,
19(2)119,
19(2)135,
20(3)193,
35(1)80,
41(z)21,
45(z)80
- operating,
2(4)117,
3(2)75,
3(3)163,
3(4)227,
3(4)241,
4(1)17,
4(2)71,
5(3)131,
5(3)141,
6(1)47,
6(3)139,
8(2)51,
8(2)61,
9(2)97,
9(3)149,
10(1)37,
10(2)127,
10(2)147,
10(3)165,
10(3)225,
11(2)85,
11(2)105,
12(1)9,
12(1)21,
12(1)47,
13(2)65,
13(2)75,
13(2)95,
14(1)1,
14(1)11,
14(1)25,
14(3)193,
14(3)205,
15(1)27,
15(3)127,
15(3)141,
15(3)163,
15(3)177,
15(4)193,
15(4)205,
16(1)81,
16(3)209,
17(4)213,
18(2)137,
20(2)69,
20(2)117,
21(1)17,
22(2)51
- optimisation,
1(2)161,
1(3)197,
1(3)233,
1(4)321,
6(1)19,
7(2)53,
8(2)69,
10(3)211,
11(2)105,
13(2)75,
14(3)193,
16(2)179,
19(1)41,
19(2)91,
47(z)131
- optimization,
1(2)161,
3(3)163,
5(1)29,
6(1)19,
8(2)69,
11(2)105,
14(2)63,
14(3)193,
15(1)27,
16(1)81,
19(1)41,
19(2)91,
19(2)105,
19(3)205,
21(2)113,
22(2)115,
24(1)33,
47(z)189,
54(z)119
- placement,
13(2)75
- Programming--Algorithms,
14(2)93,
14(2)99,
14(2)109,
14(2)125,
14(3)181,
14(4)239,
14(4)255,
14(4)263,
15(2)109,
16(3)235
- register,
6(1)47,
13(2)75,
15(1)27,
19(2)135,
19(3)169,
21(1)49,
21(2)101,
21(2)113,
24(1)33,
36(3)250
- single,
1(2)105,
16(3)209,
21(1)17,
33(3)179,
35(2)173
- storage,
1(1)17,
8(1)15,
10(2)127,
12(3)145,
13(1)13,
13(2)75,
15(1)27,
15(2)109,
16(2)129,
16(2)179,
19(2)135,
20(1)53,
20(3)135,
20(3)177,
20(4)253,
20(4)267,
21(2)101,
21(2)113,
22(2)115,
24(1)33
- store,
20(1)53
- using,
3(4)241,
4(3)171,
5(2)115,
9(1)25,
12(1)47,
13(2)75,
13(3)109,
14(4)263,
15(3)127,
27(1)19,
30(1)49,
30(1)63,
31(3)199,
34(2)66,
35(4)422,
36(4)352,
39(1)25,
41(z)1,
44(z)89,
45(z)1,
45(z)16,
46(z)44,
48(z)89,
50(z)1,
53(z)1,
54(z)20,
54(z)71,
54(z)119,
54(z)199