Entry Runger:1994:POS 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{Runger:1994:POS,
author = "Gudula R{\"u}nger and Kurt Sieber",
title = "A process oriented semantics of the {PRAM-language
FORK}",
journal = j-COMP-LANGS,
volume = "20",
number = "4",
pages = "253--265",
month = nov,
year = "1994",
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 = "Universit{\"a}t des Saarlandes",
affiliationaddress = "Saarbr{\"u}cken, Ger",
classcodes = "C6140D (High level languages); C4210L (Formal
languages and computational linguistics); C4240P
(Parallel programming and algorithm theory)",
classification = "721.1; 722.1; 723.1; 723.1.1",
corpsource = "FB 14-Informatik, Saarlandes Univ., Saarbrucken,
Germany",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Algorithms; asynchronous execution; Asynchronous
execution; computational linguistics; Computational
linguistics; computations; Computer architecture;
Computer programming languages; Concurrent read
concurrent write (CRCW); constructs; CRCW PRAM model;
creation; denotational interleaving semantics;
Denotational semantics; dynamic process; dynamic
process deletion; efficient PRAM code; FORK; fork
(programming language); FORK parallel language; group
concept; high abstraction level; interleaving rules;
languages; parallel; parallel algorithms; Parallel
languages; Parallel random access machines (pram);
parallelism; Pascal (programming language); PASCAL-like
language; PRAM algorithm; process oriented semantics;
Process oriented semantics; program; Random access
storage; runtimes; scalable; Scalable shared memory
model; shared memory access; shared memory model;
shared memory systems; synchronous; synchronous
execution; Synchronous execution; theoretically
predicted; trace-based; Traces",
treatment = "T Theoretical or Mathematical",
}
Related entries
- abstraction,
2(3)61,
2(4)135,
2(4)149,
4(3)139,
6(3)131,
6(3)139,
8(3)125,
9(1)1,
10(1)1,
10(1)37,
10(3)211,
11(3)143,
12(2)69,
12(2)109,
13(3)109,
14(2)83,
14(3)137,
15(1)1,
15(3)141,
15(4)251,
17(1)19,
17(3)157,
25(3)165,
30(3)139,
47(z)2,
47(z)62
- access,
6(3)131,
15(2)65,
20(2)117,
20(4)267,
32(4)185,
39(3)109,
53(z)143
- architecture,
4(1)29,
4(1)49,
8(1)27,
9(2)97,
18(1)17,
19(3)185,
20(3)135,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(3)165,
22(4)237,
23(2)121,
24(3)125,
27(1)3,
40(2)53,
41(z)21,
42(z)22,
54(z)71
- asynchronous,
15(3)163
- based, trace-,
51(z)22
- computation,
1(2)121,
3(3)163,
4(1)17,
9(3)133,
10(2)147,
11(3)143,
12(1)1,
12(2)109,
15(3)141,
16(2)179,
16(3)197,
19(1)1,
20(1)1,
20(1)25,
22(2)95,
23(2)161,
28(2)181,
33(3)82,
34(4)184,
35(3)217,
40(1)19
- 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(2)83,
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)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
- concept,
17(1)19,
21(2)67,
23(2)121,
31(3)183,
44(z)299,
45(z)299,
48(z)1
- concurrent,
2(3)75,
5(3)163,
8(2)61,
9(3)183,
14(1)1,
14(4)255,
14(4)263,
15(3)153,
15(3)163,
16(1)5,
17(4)213,
17(4)269,
18(3)153,
18(3)185,
19(1)51,
19(3)185,
21(3)147,
22(1)15,
22(4)193,
22(4)237,
22(4)259,
23(1)1,
23(1)43,
23(2)87,
24(4)245,
25(3)119,
35(3)293,
44(z)319,
45(z)319,
47(z)170
- construct,
1(4)287,
7(1)11,
9(3)193,
12(1)47,
14(3)153,
16(1)5,
16(3)259,
18(2)77,
18(2)105,
20(4)213,
21(1)17,
26(2)67,
38(4)300
- denotational,
11(2)85,
13(1)31,
19(1)19,
19(3)157
- dynamic,
4(3)187,
6(3)115,
9(3)149,
14(3)165,
15(1)1,
15(1)55,
16(1)39,
16(1)65,
18(2)105,
18(3)197,
20(1)43,
20(3)135,
22(4)259,
24(1)33,
25(4)211,
28(2)181,
28(3)237,
31(2)71,
35(1)21,
35(1)48,
35(1)63,
35(3)241,
35(3)252,
35(3)306,
36(2)158,
51(z)71,
51(z)90,
52(z)1,
53(z)73
- efficient,
10(3)211,
14(1)11,
15(3)127,
16(1)81,
17(4)241,
19(1)41,
22(4)225,
23(2)87,
34(4)170,
35(2)196,
35(3)217,
46(z)91,
46(z)167
- execution,
1(1)17,
9(3)183,
12(2)95,
14(1)1,
14(4)263,
16(1)65,
18(1)17,
18(3)197,
19(1)41,
19(3)185,
19(4)235,
20(1)53,
22(2)115,
22(2)143,
22(2)165,
22(2)181,
22(4)193,
23(2)87,
25(3)119,
36(2)158,
40(3)155,
43(z)116,
44(z)48,
53(z)121,
54(z)406
- linguistic,
3(3)181,
10(1)43,
11(1)39,
14(1)53,
14(4)225,
15(1)1,
15(4)251,
16(2)147,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(3)157,
20(1)1,
20(2)101,
20(4)213,
20(4)239,
21(1)17,
21(2)67,
22(2)51,
22(4)225,
23(1)1,
23(1)25,
23(2)61,
23(2)87,
23(2)121,
35(1)80,
38(1)61
- machine,
1(1)17,
1(2)121,
2(1)27,
2(3)75,
3(1)1,
3(1)53,
3(2)95,
4(2)83,
5(2)103,
6(1)47,
6(2)67,
6(3)131,
9(3)149,
10(2)127,
10(3)189,
15(3)127,
16(1)81,
16(2)129,
17(1)1,
18(1)17,
18(2)137,
19(3)205,
19(4)235,
20(1)25,
20(3)135,
20(4)267,
22(1)27,
22(2)165,
23(2)87,
23(2)121,
54(z)297,
54(z)544
- memory,
6(3)115,
9(3)149,
16(2)179,
18(2)125,
20(3)135,
20(3)151,
22(2)115,
22(4)205,
22(4)259,
28(3)237,
31(1)35,
35(1)21,
36(2)158,
37(4)168,
40(3)137,
41(z)21,
44(z)342,
45(z)342,
47(z)62,
53(z)121
- oriented,
1(1)61,
1(2)161,
1(3)197,
1(3)255,
1(4)277,
1(4)321,
2(1)1,
2(3)47,
2(3)75,
3(2)75,
3(2)95,
3(3)145,
3(3)181,
3(3)193,
4(1)17,
4(2)71,
4(3)187,
5(2)65,
7(3)125,
8(3)95,
10(2)91,
15(1)55,
15(2)95,
15(4)225,
16(1)39,
17(1)1,
17(4)213,
18(2)105,
18(3)153,
18(3)169,
19(1)19,
19(2)65,
19(2)79,
20(2)69,
21(2)67,
21(2)81,
21(3)129,
21(3)147,
21(3)165,
22(1)15,
22(2)165,
22(4)237,
23(1)25,
23(2)121,
35(3)277,
46(z)106
- parallelism,
1(2)151,
18(3)185,
19(2)119,
20(1)1,
22(2)165,
22(2)181,
26(1)27,
36(3)288
- Pascal,
3(4)227,
4(2)93,
4(3)155,
5(3)131,
8(3)125,
9(2)71,
9(2)97,
10(3)165,
14(1)53,
14(4)225,
15(4)193,
15(4)251,
16(2)147,
17(1)67,
18(4)217,
18(4)273,
19(4)247,
20(1)53,
20(4)239,
32(1)2
- PRAM,
20(4)267
- process,
1(2)151,
2(3)75,
5(3)163,
7(1)11,
7(3)125,
8(2)51,
9(2)107,
9(3)183,
10(3)179,
11(3)155,
12(1)27,
12(2)109,
13(1)31,
14(1)1,
16(3)209,
17(3)199,
18(4)273,
19(1)51,
20(2)127,
20(4)213,
21(1)39,
23(1)1,
23(1)43,
23(2)87,
27(1)39,
33(3)111,
38(4)279,
39(3)67,
50(z)159,
54(z)156,
54(z)451
- random,
20(2)127,
20(4)267,
21(2)113
- rule,
3(2)127,
5(1)37,
5(2)77,
7(2)61,
7(2)89,
10(2)147,
11(2)85,
12(2)123,
12(3)173,
14(2)63,
14(2)125,
15(1)27,
15(3)127,
16(3)259,
18(4)251,
20(4)213,
21(3)165,
22(1)27,
22(2)95,
28(3)273,
36(3)268,
47(z)19,
51(z)102
- runtime,
12(3)145,
19(3)205,
22(4)237,
32(2)125,
33(2)60,
34(2)46,
45(z)191
- scalable,
40(1)19,
54(z)358
- shared,
16(2)129,
20(3)135,
20(3)151,
22(2)95,
22(4)205,
22(4)259,
28(4)327
- storage,
1(1)17,
8(1)15,
10(2)127,
12(3)145,
13(1)13,
13(2)75,
15(1)27,
15(2)83,
15(2)109,
16(2)129,
16(2)179,
19(2)135,
20(1)53,
20(3)135,
20(3)177,
20(4)267,
21(2)101,
21(2)113,
22(2)115,
24(1)33
- synchronous,
12(1)27,
15(3)163,
23(1)1,
27(1)61
- theoretically,
1(2)161,
1(3)197
- trace-based,
51(z)22