Entry Yu:1997:STT from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Yu:1997:STT,
author = "Xiangdong Yu and Moti Yung",
title = "Scheduling task-trees with additive scales on
parallel\slash distributed machines",
journal = j-THEOR-COMP-SCI,
volume = "181",
number = "2",
pages = "357--378",
day = "30",
month = jul,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=181&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=181&issue=2&aid=2482",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C5220P (Parallel
architecture); C6150N (Distributed systems software)",
conflocation = "Xi'an, China; 24-26 Aug. 1995",
conftitle = "First Annual International Computing and Combinatorics
Conference",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "additive scales; computational complexity; distributed
machines; divide-and-conquer algorithms; parallel
architectures; parallel machines; processor scheduling;
scheduling; task-tree; task-trees",
pubcountry = "Netherlands",
sponsororg = "Nat. Natural Sci. Found.; Xi'an Jiaotong Univ.;
Chinese Acad. Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- additive,
154(2)349,
157(1)91,
174(1)157,
197(1)248-1,
224(1)157
- and-conquer, divide-,
162(2)283
- architecture,
140(2)333,
143(2)335,
162(2)245,
162(2)351,
169(1)39,
178(1)265,
182(1)171,
186(1)171,
191(1)245,
196(1)181,
197(1)57
- C5220P,
140(2)333,
162(2)245,
162(2)351,
178(1)265,
182(1)171,
186(1)171,
196(1)181
- C6150N,
149(2)299,
151(1)195,
162(2)297,
162(2)323,
162(2)341,
172(1)1,
173(1)49,
173(1)209,
178(1)119,
178(1)265,
182(1)159,
195(2)291,
196(1)45
- conquer, divide-and-,
162(2)283
- distributed,
139(1)163,
143(1)73,
144(1)101,
145(1)271,
147(1)1,
149(1)151,
149(2)299,
151(1)195,
153(1)245,
156(1)99,
162(2)245,
162(2)297,
162(2)323,
162(2)341,
169(2)123,
170(1)47,
172(1)1,
173(1)49,
173(1)209,
175(2)393,
177(2)459,
178(1)119,
178(1)265,
179(1)353,
180(1)341,
181(1)195,
182(1)159,
185(2)259,
186(1)199,
189(1)179,
190(2)363,
193(1)97,
194(1)241,
194(1)245,
194(1)246,
194(1)248-1,
195(2)227,
195(2)291,
196(1)45,
196(1)109,
196(1)259,
196(1)289,
203(2)225,
216(1)213,
220(1)31,
227(1)185
- divide-and-conquer,
162(2)283
- processor,
140(2)333,
141(1)1,
146(1)69,
146(1)109,
147(1)1,
147(1)69,
147(1)249,
154(2)225,
155(1)141,
155(2)349,
155(2)411,
162(2)225,
162(2)323,
162(2)341,
168(1)121,
169(1)39,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
179(1)251,
179(1)381,
181(2)379,
183(2)281,
186(1)171,
188(1)221,
190(2)211,
196(1)347
- scheduling,
144(1)277,
145(1)329,
147(1)1,
162(2)225,
162(2)323,
162(2)341,
164(1)73,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
183(2)281,
191(1)205,
196(1)347,
196(1)395,
215(1)137,
215(1)209,
220(1)157
- software,
139(1)275,
140(1)139,
149(2)299,
155(2)439,
162(2)297,
162(2)323,
162(2)341,
170(1)245,
172(1)1,
173(1)49,
173(1)209,
173(2)311,
173(2)445,
178(1)119,
178(1)265,
179(1)273,
181(1)45,
182(1)159,
185(2)393,
187(1)123,
187(1)221,
187(1)z,
189(1)109,
189(1)239,
192(2)201,
192(2)287,
192(2)315,
194(1)242-1,
194(1)243,
194(1)z,
195(2)291,
196(1)45,
196(1)241,
196(1)289
- Yung, Moti,
186(1)199