Entry Nikhil:1993:PPL from ijhsc.bib
Last update: Sun Oct 15 02:21:07 MDT 2017
Top |
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{Nikhil:1993:PPL,
author = "R. S. Nikhil",
title = "The Parallel Programming Language {Id} and its
Compilation for Parallel Machines",
journal = j-INT-J-HIGH-SPEED-COMPUTING,
volume = "5",
number = "2",
pages = "171--223 (or 171--224??)",
month = jun,
year = "1993",
CODEN = "IHSCEZ",
ISSN = "0129-0533",
ISSN-L = "0129-0533",
bibdate = "Mon Feb 25 11:19:26 MST 2002",
bibsource = "ftp://ftp.ira.uka.de/bibliography/Compiler/fortran.bib;
ftp://ftp.ira.uka.de/bibliography/Compiler/FORTRAN/fortran3.bib;
ftp://ftp.ira.uka.de/bibliography/Compiler/fortran3.bib;
ftp://ftp.ira.uka.de/bibliography/Compiler/Functional.bib;
http://www.math.utah.edu/pub/tex/bib/fortran3.bib;
http://www.math.utah.edu/pub/tex/bib/ijhsc.bib;
Misc/Functional.bib; OCLC Article1st database",
abstract = "The author shows a novel compilation method from a
familiar class of languages to a familiar class of
architectures. Id is basically a non-strict functional
programming language, but it has a computation rule
different from the traditional lazy evaluation rule,
leading to enormous amounts of parallelism. Then,
instead of using graph reduction (the traditional
compilation method), he translates Id programs via two
intermediate languages: first to dataflow graphs and
then to code for an abstract machine called P-RISC. He
describes how to implement the P-RISC abstract machine
on a message-passing multicomputer and describes
optimizations at all levels. Throughout, the underlying
theme is efficient fine-grained, data-driven execution,
essential for large-scale MIMD machines. He also
remarks on the suitability of the approach for other
source languages (including FORTRAN).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Speed Computing
(IJHSC)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijhsc",
keywords = "data flow dataflow functional",
}
Related entries
- abstract,
4(4)313,
5(3)327
- all,
5(3)327
- approach,
5(4)537,
7(1)45,
7(2)303
- architecture,
1(4)563,
2(1)49-1,
4(3)179,
5(2)125,
5(4)637,
6(1)157,
6(2)343,
7(3)465,
8(3)229,
8(3)271,
9(1)41,
9(3)191,
10(3)257
- author,
11(4)253
- called,
4(4)313
- class,
5(1)1,
6(2)277,
6(3)357
- code,
4(2)71
- computation,
5(3)307,
5(3)327,
6(2)183,
6(2)325,
6(4)501,
9(3)181,
11(1)15,
11(3)129,
12(1)1
- data,
5(2)225,
6(1)139,
6(2)311,
8(1)65,
9(2)161,
9(4)311,
10(3)275
- dataflow,
5(2)125
- efficient,
4(1)1,
7(1)73,
7(1)109,
7(4)489,
9(4)359
- evaluation,
1(4)563,
2(1)49,
2(1)49-1,
2(1)85,
4(4)313,
4(4)333,
5(1)71,
5(4)537,
7(3)351
- execution,
4(3)233,
4(4)313,
5(3)327,
11(3)167
- flow,
4(1)49,
5(2)225,
9(3)237
- FORTRAN,
2(2)133
- functional,
2(1)49,
4(4)313,
5(3)327
- graph,
5(3)327,
8(3)271,
8(4)371,
10(3)327
- has,
5(3)327
- intermediate,
10(2)153
- language,
4(4)313,
5(3)327
- lazy,
4(4)313,
5(3)327
- machine,
2(1)23,
4(2)71,
4(4)313,
5(3)327,
5(4)523,
5(4)537,
6(2)277,
7(2)251,
8(1)65,
8(1)65,
9(1)13,
10(2)185,
12(1)69
- method,
2(2)143,
2(4)311,
6(1)81,
6(1)157,
7(2)161,
8(3)295,
9(1)73,
10(2)185,
10(4)361
- MIMD,
5(1)89,
5(3)403
- multicomputer,
7(1)89
- novel,
8(1)81
- optimization,
2(1)23,
3(1)63,
8(1)57,
9(2)161
- other,
2(3)265,
3(1)31,
4(2)121,
5(4)637,
6(1)139,
6(4)557,
7(3)327,
8(4)307,
9(2)101
- P-RISC,
5(2)125
- parallel,
1(4)563,
1(z)73,
2(1)1,
2(1)17,
2(2)143,
2(2)181,
2(3)239,
2(3)257,
2(3)265,
2(4)289,
2(4)351,
3(1)1,
3(1)31,
3(1)63,
4(1)23,
4(2)71,
4(2)109,
4(4)313,
5(1)51,
5(1)63,
5(3)307,
5(3)327,
5(3)413,
5(3)491,
5(4)503,
6(1)81,
6(1)101,
6(1)157,
6(2)287,
6(2)325,
6(3)375,
6(3)399,
6(4)501,
7(1)73,
7(1)145,
7(2)191,
7(2)285,
7(2)303,
7(3)365,
7(3)391,
7(4)489,
7(4)531,
7(4)547,
7(4)577,
7(4)595,
8(1)1,
8(1)65,
8(1)65,
8(3)205,
8(4)307,
8(4)319,
9(1)13,
9(1)25,
9(1)57,
9(1)73,
9(2)85,
9(2)127,
9(2)161,
9(3)223,
9(4)259,
9(4)291,
10(2)209,
10(3)257,
10(3)285,
10(4)361,
11(1)1,
11(1)15,
11(1)55,
12(1)55
- parallelism,
4(4)313,
5(2)271,
5(4)503
- program,
2(1)49,
2(2)133,
4(3)233,
4(4)313,
5(3)327,
7(2)303,
8(3)205,
10(2)153
- programming,
5(2)243,
5(3)379,
5(3)413,
5(4)595,
6(2)183,
6(2)287
- reduction,
4(4)313,
5(3)327,
11(2)93
- RISC, P-,
5(2)125
- show,
4(4)313
- two,
9(3)237,
10(3)235
- using,
5(3)327,
7(3)327,
7(3)351,
7(4)515,
8(4)347,
8(4)371,
9(1)25,
9(2)161,
9(3)191,
9(4)311,
11(1)1