Last update: Wed Sep 26 02:10:27 MDT 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
@InProceedings{Yang:1991:FSS,
author = "T. Yang and A. Gerasoulis",
title = "A fast static scheduling algorithm for {DAGs} on an
unbounded number of processors",
crossref = "IEEE:1991:PSA",
pages = "633--642",
year = "1991",
bibdate = "Wed Apr 15 16:28:01 MDT 1998",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C6110P (Parallel
programming); C6150N (Distributed systems)",
corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
NJ, USA",
keywords = "coarse tree graphs; communication overhead; completely
connected processors; computational complexity; DAG;
DAGs; directed acyclic task graphs; directed graphs;
dominant sequences clustering; fork; heuristic
algorithm; join; parallel algorithms; parallel
programming; parallel time; scheduling; static
scheduling algorithm",
sponsororg = "IEEE; ACM",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- algorithm,
0(0)xxiii--917,
0(0)4,
0(0)56,
0(0)101,
0(0)122,
0(0)139,
0(0)187,
0(0)197,
0(0)218,
0(0)294,
0(0)316,
0(0)462,
0(0)502,
0(0)512,
0(0)578,
0(0)600,
0(0)654,
0(0)678,
0(0)702,
0(0)712,
0(0)722,
0(0)732,
0(0)742,
0(0)754,
0(0)764,
0(0)786,
0(0)842,
0(0)854,
0(0)866
- C1160,
0(0)380,
0(0)400
- C4240P,
0(0)197,
0(0)462,
0(0)578,
0(0)600,
0(0)712,
0(0)722,
0(0)732,
0(0)742,
0(0)754,
0(0)764,
0(0)786,
0(0)842,
0(0)854,
0(0)866
- C6110P,
0(0)xxiii--917,
0(0)24,
0(0)36,
0(0)111,
0(0)122,
0(0)197,
0(0)208,
0(0)218,
0(0)264,
0(0)273,
0(0)283,
0(0)412,
0(0)424,
0(0)435,
0(0)472,
0(0)481,
0(0)491,
0(0)502,
0(0)544,
0(0)610,
0(0)620,
0(0)678,
0(0)679,
0(0)712,
0(0)786,
0(0)796,
0(0)818,
0(0)842,
0(0)854,
0(0)900
- C6150N,
0(0)101,
0(0)512,
0(0)522,
0(0)541,
0(0)554,
0(0)567,
0(0)644,
0(0)682,
0(0)900
- combinatorial,
0(0)xxiii--917,
0(0)380,
0(0)400
- communication,
0(0)86,
0(0)101,
0(0)316,
0(0)435,
0(0)644,
0(0)742,
0(0)842,
0(0)866
- complexity,
0(0)4,
0(0)187,
0(0)197,
0(0)294,
0(0)512,
0(0)732,
0(0)742,
0(0)754
- computational,
0(0)4,
0(0)68,
0(0)158,
0(0)166,
0(0)187,
0(0)197,
0(0)230,
0(0)242,
0(0)294,
0(0)304,
0(0)462,
0(0)512,
0(0)541,
0(0)732,
0(0)742,
0(0)754
- connected,
0(0)764,
0(0)776
- directed,
0(0)380
- distributed,
0(0)xxiii--917,
0(0)101,
0(0)273,
0(0)512,
0(0)522,
0(0)541,
0(0)554,
0(0)567,
0(0)600,
0(0)644,
0(0)682,
0(0)830,
0(0)842,
0(0)866,
0(0)900
- fast,
0(0)4,
0(0)56,
0(0)166,
0(0)446,
0(0)754
- graph,
0(0)380,
0(0)502,
0(0)722
- heuristic,
0(0)512
- mathematics,
0(0)130,
0(0)380,
0(0)400,
0(0)588
- number,
0(0)xxiii--917,
0(0)534,
0(0)732
- overhead,
0(0)24,
0(0)481,
0(0)664,
0(0)742,
0(0)776
- processor,
0(0)xxiii--917,
0(0)14,
0(0)86,
0(0)101,
0(0)111,
0(0)208,
0(0)230,
0(0)328,
0(0)338,
0(0)424,
0(0)502,
0(0)544,
0(0)578,
0(0)610,
0(0)620,
0(0)682,
0(0)692,
0(0)702,
0(0)742,
0(0)764,
0(0)796,
0(0)806,
0(0)842,
0(0)854,
0(0)900
- scheduling,
0(0)502,
0(0)610,
0(0)866
- sequence,
0(0)139,
0(0)316,
0(0)453
- static,
0(0)462,
0(0)610,
0(0)806,
0(0)842
- system,
0(0)xxiii--917,
0(0)4,
0(0)24,
0(0)36,
0(0)46,
0(0)56,
0(0)68,
0(0)86,
0(0)101,
0(0)122,
0(0)139,
0(0)150,
0(0)158,
0(0)166,
0(0)176,
0(0)187,
0(0)197,
0(0)230,
0(0)304,
0(0)316,
0(0)328,
0(0)338,
0(0)358,
0(0)400,
0(0)412,
0(0)424,
0(0)446,
0(0)472,
0(0)481,
0(0)491,
0(0)502,
0(0)512,
0(0)522,
0(0)540,
0(0)541,
0(0)554,
0(0)567,
0(0)578,
0(0)588,
0(0)610,
0(0)644,
0(0)664,
0(0)677,
0(0)678,
0(0)682,
0(0)722,
0(0)796,
0(0)806,
0(0)818,
0(0)830,
0(0)866,
0(0)878,
0(0)900
- task,
0(0)502,
0(0)830
- theory,
0(0)4,
0(0)158,
0(0)166,
0(0)187,
0(0)197,
0(0)230,
0(0)242,
0(0)294,
0(0)304,
0(0)462,
0(0)512,
0(0)578,
0(0)600,
0(0)644,
0(0)654,
0(0)702,
0(0)712,
0(0)722,
0(0)732,
0(0)742,
0(0)754,
0(0)764,
0(0)786,
0(0)806,
0(0)830,
0(0)842,
0(0)854,
0(0)866
- time,
0(0)4,
0(0)101,
0(0)370,
0(0)481,
0(0)502,
0(0)610,
0(0)644,
0(0)677,
0(0)682,
0(0)742,
0(0)754,
0(0)830,
0(0)842
- tree,
0(0)400,
0(0)522,
0(0)722