Last update: Fri Mar 2 02:06:23 MST 2018
Top |
Symbols |
Numbers |
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{Foster:1994:TPH,
author = "Ian Foster",
title = "Task Parallelism and High-Performance Languages",
journal = j-IEEE-PAR-DIST-TECH,
volume = "2",
number = "3",
pages = "27--36",
month = "Fall",
year = "1994",
CODEN = "IPDTEX",
DOI = "https://doi.org/10.1109/M-PDT.1994.329794",
ISSN = "1063-6552 (print), 1558-1861 (electronic)",
ISSN-L = "1063-6552",
bibdate = "Fri Apr 11 07:24:28 MDT 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/ieeepardisttech.bib",
abstract = "High Performance Fortran currently lacks support for
explicit task parallelism. This article explains why
task parallelism is important, and describes one
candidate task-parallel model: the Fortran M extensions
to Fortran 77.",
acknowledgement = ack-nhfb,
affiliation = "Argonne Natl Lab",
classification = "722.4; 723.1; 723.1.1; 723.2; 903.3; 921.6; C6110P
(Parallel programming); C6140D (High level languages);
C6150N (Distributed systems)",
corpsource = "Argonne Nat. Lab., IL, USA",
journalabr = "IEEE Parallel Distrib Technol",
keywords = "Algorithms; candidate task-parallel model; Data
processing; FORTRAN; Fortran; Fortran (programming
language); Fortran 77; Fortran M; High; High
Performance Fortran; high performance languages;
Information use; M extensions; Multiprogramming;
parallel languages; Parallel processing systems;
parallel programming; Performance Fortran; Program
compilers; Program debugging; scheduling; Task
parallelism; task parallelism",
treatment = "P Practical",
}
Related entries
- algorithm,
1(3)12,
1(3)51,
1(3)62,
1(3)81,
1(3)83,
1(4)23,
2(1)9,
2(1)51,
2(1)64,
2(2)17,
2(2)30,
2(2)37,
2(2)62,
2(3)37,
2(3)59,
2(4)32,
2(4)49,
2(4)61,
2(4)73,
3(1)4,
3(1)25,
3(1)61,
3(1)75,
3(2)40,
3(3)63,
3(4)3,
4(1)25,
4(2)15,
4(2)41,
4(2)49,
4(2)63,
4(3)15,
4(3)45,
4(4)36,
4(4)50
- article,
2(3)59,
4(1)3,
4(2)3,
4(3)4,
4(4)11
- C6110P,
1(2)62,
1(3)22,
1(3)51,
1(3)85,
1(4)23,
1(4)32,
2(1)9,
2(1)26,
2(1)32,
2(1)40,
2(1)64,
2(2)8,
2(2)17,
2(2)30,
2(2)50,
2(3)5,
2(3)8,
2(3)16,
2(3)37,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)73,
2(3)76,
2(4)20,
2(4)73,
3(1)4,
3(1)12,
3(1)25,
3(1)37,
3(1)75,
3(2)52,
3(4)3,
3(4)21,
3(4)44,
3(4)72,
4(1)57,
4(2)15,
4(2)26,
4(2)63,
4(2)89,
4(3)15,
4(3)36,
4(4)36,
4(4)50
- C6140D,
1(1)25,
1(2)21,
1(2)49,
1(3)22,
2(1)32,
2(1)64,
2(3)16,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)74,
2(3)75,
2(3)76,
3(1)4,
3(1)12,
4(1)57,
4(3)36
- C6150N,
1(2)62,
1(3)62,
1(3)71,
1(3)85,
1(4)41,
2(1)26,
2(1)64,
2(2)30,
2(2)50,
2(2)57,
2(2)62,
2(4)20,
2(4)32,
2(4)49,
2(4)61,
2(4)73,
3(1)25,
3(1)61,
3(1)75,
3(2)14,
3(2)22,
3(2)52,
3(4)12,
3(4)21,
3(4)44,
3(4)61,
4(1)25,
4(1)57,
4(2)15,
4(2)41,
4(2)89,
4(3)7,
4(3)15,
4(3)25,
4(3)45,
4(4)12
- compiler,
1(1)43,
2(1)32,
2(1)64,
2(3)8,
2(3)13,
2(3)16,
2(3)37,
2(3)48,
2(3)71,
2(3)72,
2(3)73,
2(3)74,
2(3)75,
2(3)76,
3(1)12,
3(1)25,
3(1)75,
4(1)57,
4(2)26,
4(4)23,
4(4)36,
4(4)50
- debugging,
1(3)85,
1(4)32,
2(1)40,
2(2)50,
2(2)62,
2(3)37,
2(3)48,
3(1)4,
3(1)75,
3(4)21,
3(4)61,
3(4)72,
4(1)57,
4(2)89
- explicit,
1(3)22
- FORTRAN,
1(1)25,
2(3)16,
2(3)59,
2(3)71,
2(3)72,
2(3)74,
2(3)75,
2(3)76,
3(1)4,
3(1)12,
4(1)57
- Fortran,
1(1)25,
2(1)26,
2(3)13,
2(3)16,
2(3)37,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)73,
2(3)74,
2(3)75,
2(3)76,
3(1)4,
3(1)12,
4(1)57
- Foster, Ian,
3(2)2
- high,
1(1)25,
1(2)21,
1(2)33,
1(2)49,
1(3)22,
2(1)32,
2(1)64,
2(2)5,
2(3)7,
2(3)13,
2(3)16,
2(3)37,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)74,
2(3)75,
2(3)76,
2(4)20,
3(1)4,
3(1)12,
3(2)29,
3(2)40,
3(3)33,
3(4)14,
4(1)57,
4(2)41,
4(2)49,
4(2)63,
4(3)7,
4(3)36,
4(4)12,
4(4)36
- High-Performance,
2(2)5,
2(3)37,
3(2)2,
3(2)29
- information,
1(2)16,
1(3)82,
2(3)10,
2(4)32,
2(4)73,
3(1)61,
3(4)12,
4(1)6,
4(3)60,
4(4)4,
4(4)12,
4(4)65,
4(4)z-1
- language,
1(1)6,
1(1)25,
1(2)3,
1(2)21,
1(2)49,
1(3)22,
2(1)32,
2(1)64,
2(2)37,
2(3)13,
2(3)16,
2(3)37,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)74,
2(3)75,
2(3)76,
2(4)9,
3(1)4,
3(1)12,
3(1)37,
3(1)75,
3(2)52,
3(3)50,
3(4)14,
4(1)6,
4(1)57,
4(2)26,
4(2)49,
4(3)36
- level,
1(1)25,
1(2)21,
1(2)49,
1(3)22,
2(1)32,
2(1)64,
2(3)16,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)74,
2(3)75,
2(3)76,
2(4)20,
3(1)4,
3(1)12,
3(3)4,
3(4)14,
3(4)34,
4(1)57,
4(2)49,
4(2)89,
4(3)36
- model,
1(1)25,
1(2)3,
1(2)33,
1(3)85,
1(4)16,
2(1)26,
2(1)40,
2(2)17,
2(2)37,
2(2)57,
2(4)9,
2(4)32,
2(4)61,
3(1)37,
3(2)14,
3(2)22,
3(4)12,
3(4)14,
3(4)44,
4(2)26,
4(2)63,
4(2)89,
4(3)25,
4(3)36,
4(4)50
- multiprogramming,
2(3)16,
2(3)37,
2(3)48,
2(3)59,
3(1)25,
3(1)51,
4(2)41
- parallel, task-,
2(3)16
- parallelism,
1(2)33,
1(3)22,
1(3)85,
2(1)64,
2(2)17,
2(3)5,
2(3)16,
2(3)37,
2(3)73,
2(3)74,
3(4)3,
4(2)49
- Performance, High-,
2(2)5,
2(3)37,
3(2)2,
3(2)29
- scheduling,
1(2)62,
1(3)81,
2(1)40,
2(1)64,
2(4)20,
2(4)32,
2(4)49,
3(2)29,
3(3)4,
4(2)41
- support,
1(2)21,
1(2)33,
1(2)49,
1(2)62,
1(3)85,
1(4)16,
2(1)40,
2(2)50,
2(3)48,
2(3)59,
2(3)71,
2(3)73,
2(4)9,
2(4)73,
3(1)12,
3(1)25,
3(1)37,
3(1)75,
3(2)22,
3(2)40,
3(2)52,
3(4)21,
3(4)44,
3(4)72,
4(3)36
- task,
1(2)62,
2(3)16,
2(4)32,
2(4)49,
3(1)37
- task-parallel,
2(3)16
- use,
2(2)37,
2(2)62,
2(3)37,
2(3)48,
2(4)20,
4(4)8
- why,
2(3)5,
2(3)7