id	sid	tid	token	lemma	pos
ap-490	1	1	ap03_6.vp	ap03_6.vp	NOUN
ap-490	1	2	1	1	NUM
ap-490	1	3	introduction	introduction	NOUN
ap-490	1	4	efficient	efficient	ADJ
ap-490	1	5	scheduling	scheduling	NOUN
ap-490	1	6	of	of	ADP
ap-490	1	7	computationally	computationally	ADV
ap-490	1	8	intensive	intensive	ADJ
ap-490	1	9	programs	program	NOUN
ap-490	1	10	is	be	AUX
ap-490	1	11	one	one	NUM
ap-490	1	12	of	of	ADP
ap-490	1	13	the	the	DET
ap-490	1	14	most	most	ADV
ap-490	1	15	essential	essential	ADJ
ap-490	1	16	and	and	CCONJ
ap-490	1	17	most	most	ADV
ap-490	1	18	difficult	difficult	ADJ
ap-490	1	19	issues	issue	NOUN
ap-490	1	20	to	to	PART
ap-490	1	21	achieve	achieve	VERB
ap-490	1	22	high	high	ADJ
ap-490	1	23	performance	performance	NOUN
ap-490	1	24	in	in	ADP
ap-490	1	25	a	a	DET
ap-490	1	26	homogeneous	homogeneous	ADJ
ap-490	1	27	computing	computing	NOUN
ap-490	1	28	environment	environment	NOUN
ap-490	2	1	[	[	X
ap-490	2	2	1	1	NUM
ap-490	2	3	]	]	PUNCT
ap-490	2	4	.	.	PUNCT
ap-490	3	1	when	when	SCONJ
ap-490	3	2	the	the	DET
ap-490	3	3	characteristics	characteristic	NOUN
ap-490	3	4	of	of	ADP
ap-490	3	5	an	an	DET
ap-490	3	6	application	application	NOUN
ap-490	3	7	are	be	AUX
ap-490	3	8	known	know	VERB
ap-490	3	9	a	a	DET
ap-490	3	10	priori	priori	ADV
ap-490	3	11	,	,	PUNCT
ap-490	3	12	including	include	VERB
ap-490	3	13	tasks	task	NOUN
ap-490	3	14	execution	execution	NOUN
ap-490	3	15	time	time	NOUN
ap-490	3	16	,	,	PUNCT
ap-490	3	17	data	data	NOUN
ap-490	3	18	size	size	NOUN
ap-490	3	19	of	of	ADP
ap-490	3	20	communication	communication	NOUN
ap-490	3	21	between	between	ADP
ap-490	3	22	tasks	task	NOUN
ap-490	3	23	,	,	PUNCT
ap-490	3	24	and	and	CCONJ
ap-490	3	25	task	task	NOUN
ap-490	3	26	dependencies	dependency	NOUN
ap-490	3	27	,	,	PUNCT
ap-490	3	28	the	the	DET
ap-490	3	29	application	application	NOUN
ap-490	3	30	is	be	AUX
ap-490	3	31	represented	represent	VERB
ap-490	3	32	by	by	ADP
ap-490	3	33	a	a	DET
ap-490	3	34	static	static	ADJ
ap-490	3	35	model	model	NOUN
ap-490	3	36	[	[	X
ap-490	3	37	2	2	NUM
ap-490	3	38	]	]	PUNCT
ap-490	3	39	.	.	PUNCT
ap-490	4	1	in	in	ADP
ap-490	4	2	the	the	DET
ap-490	4	3	static	static	ADJ
ap-490	4	4	model	model	NOUN
ap-490	4	5	,	,	PUNCT
ap-490	4	6	the	the	DET
ap-490	4	7	application	application	NOUN
ap-490	4	8	is	be	AUX
ap-490	4	9	represented	represent	VERB
ap-490	4	10	by	by	ADP
ap-490	4	11	a	a	DET
ap-490	4	12	directed	direct	VERB
ap-490	4	13	acyclic	acyclic	ADJ
ap-490	4	14	graph	graph	NOUN
ap-490	4	15	(	(	PUNCT
ap-490	4	16	dag	dag	PROPN
ap-490	4	17	)	)	PUNCT
ap-490	4	18	in	in	ADP
ap-490	4	19	which	which	PRON
ap-490	4	20	the	the	DET
ap-490	4	21	nodes	node	NOUN
ap-490	4	22	represent	represent	VERB
ap-490	4	23	the	the	DET
ap-490	4	24	application	application	NOUN
ap-490	4	25	tasks	task	NOUN
ap-490	4	26	and	and	CCONJ
ap-490	4	27	the	the	DET
ap-490	4	28	edges	edge	NOUN
ap-490	4	29	represent	represent	VERB
ap-490	4	30	intertask	intertask	ADJ
ap-490	4	31	data	datum	NOUN
ap-490	4	32	dependencies	dependency	NOUN
ap-490	4	33	.	.	PUNCT
ap-490	5	1	each	each	DET
ap-490	5	2	node	node	NOUN
ap-490	5	3	is	be	AUX
ap-490	5	4	labeled	label	VERB
ap-490	5	5	by	by	ADP
ap-490	5	6	the	the	DET
ap-490	5	7	computation	computation	NOUN
ap-490	5	8	cost	cost	NOUN
ap-490	5	9	(	(	PUNCT
ap-490	5	10	expected	expect	VERB
ap-490	5	11	computation	computation	NOUN
ap-490	5	12	time	time	NOUN
ap-490	5	13	)	)	PUNCT
ap-490	5	14	of	of	ADP
ap-490	5	15	the	the	DET
ap-490	5	16	task	task	NOUN
ap-490	5	17	and	and	CCONJ
ap-490	5	18	each	each	DET
ap-490	5	19	edge	edge	NOUN
ap-490	5	20	is	be	AUX
ap-490	5	21	labeled	label	VERB
ap-490	5	22	by	by	ADP
ap-490	5	23	the	the	DET
ap-490	5	24	communication	communication	NOUN
ap-490	5	25	cost	cost	NOUN
ap-490	5	26	(	(	PUNCT
ap-490	5	27	expected	expect	VERB
ap-490	5	28	communication	communication	NOUN
ap-490	5	29	time	time	NOUN
ap-490	5	30	)	)	PUNCT
ap-490	5	31	between	between	ADP
ap-490	5	32	tasks	task	NOUN
ap-490	6	1	[	[	X
ap-490	6	2	3	3	NUM
ap-490	6	3	,	,	PUNCT
ap-490	6	4	4	4	NUM
ap-490	6	5	,	,	PUNCT
ap-490	6	6	5	5	NUM
ap-490	6	7	,	,	PUNCT
ap-490	6	8	6	6	NUM
ap-490	6	9	,	,	PUNCT
ap-490	6	10	7	7	NUM
ap-490	6	11	]	]	PUNCT
ap-490	6	12	.	.	PUNCT
ap-490	7	1	the	the	DET
ap-490	7	2	objective	objective	NOUN
ap-490	7	3	of	of	ADP
ap-490	7	4	scheduling	scheduling	NOUN
ap-490	7	5	is	be	AUX
ap-490	7	6	to	to	PART
ap-490	7	7	map	map	VERB
ap-490	7	8	the	the	DET
ap-490	7	9	tasks	task	NOUN
ap-490	7	10	onto	onto	ADP
ap-490	7	11	the	the	DET
ap-490	7	12	processors	processor	NOUN
ap-490	7	13	(	(	PUNCT
ap-490	7	14	machines	machine	NOUN
ap-490	7	15	)	)	PUNCT
ap-490	7	16	and	and	CCONJ
ap-490	7	17	order	order	VERB
ap-490	7	18	their	their	PRON
ap-490	7	19	execution	execution	NOUN
ap-490	7	20	so	so	SCONJ
ap-490	7	21	the	the	PRON
ap-490	7	22	that	that	SCONJ
ap-490	7	23	task	task	NOUN
ap-490	7	24	dependencies	dependency	NOUN
ap-490	7	25	are	be	AUX
ap-490	7	26	satisfied	satisfied	ADJ
ap-490	7	27	and	and	CCONJ
ap-490	7	28	minimum	minimum	ADJ
ap-490	7	29	overall	overall	ADJ
ap-490	7	30	scheduling	scheduling	NOUN
ap-490	7	31	length	length	NOUN
ap-490	7	32	(	(	PUNCT
ap-490	7	33	makespan	makespan	ADV
ap-490	7	34	)	)	PUNCT
ap-490	7	35	is	be	AUX
ap-490	7	36	achieved	achieve	VERB
ap-490	7	37	.	.	PUNCT
ap-490	8	1	finding	find	VERB
ap-490	8	2	an	an	DET
ap-490	8	3	optimal	optimal	ADJ
ap-490	8	4	solution	solution	NOUN
ap-490	8	5	for	for	ADP
ap-490	8	6	the	the	DET
ap-490	8	7	scheduling	scheduling	NOUN
ap-490	8	8	problem	problem	NOUN
ap-490	8	9	is	be	AUX
ap-490	8	10	np	np	INTJ
ap-490	8	11	-	-	ADJ
ap-490	8	12	complete	complete	ADJ
ap-490	8	13	[	[	X
ap-490	8	14	3	3	NUM
ap-490	8	15	,	,	PUNCT
ap-490	8	16	4	4	NUM
ap-490	8	17	,	,	PUNCT
ap-490	8	18	5	5	NUM
ap-490	8	19	,	,	PUNCT
ap-490	8	20	6	6	NUM
ap-490	8	21	,	,	PUNCT
ap-490	8	22	7	7	NUM
ap-490	8	23	]	]	PUNCT
ap-490	8	24	.	.	PUNCT
ap-490	9	1	therefore	therefore	ADV
ap-490	9	2	,	,	PUNCT
ap-490	9	3	it	it	PRON
ap-490	9	4	is	be	AUX
ap-490	9	5	necessary	necessary	ADJ
ap-490	9	6	to	to	PART
ap-490	9	7	have	have	VERB
ap-490	9	8	heuristics	heuristic	NOUN
ap-490	9	9	to	to	PART
ap-490	9	10	find	find	VERB
ap-490	9	11	the	the	DET
ap-490	9	12	best	good	ADJ
ap-490	9	13	scheduling	scheduling	NOUN
ap-490	9	14	rather	rather	ADV
ap-490	9	15	than	than	ADP
ap-490	9	16	evaluate	evaluate	VERB
ap-490	9	17	all	all	DET
ap-490	9	18	possible	possible	ADJ
ap-490	9	19	scheduling	scheduling	NOUN
ap-490	9	20	combinations	combination	NOUN
ap-490	9	21	.	.	PUNCT
ap-490	10	1	most	most	ADJ
ap-490	10	2	scheduling	scheduling	NOUN
ap-490	10	3	heuristics	heuristic	NOUN
ap-490	10	4	algorithms	algorithm	NOUN
ap-490	10	5	are	be	AUX
ap-490	10	6	based	base	VERB
ap-490	10	7	on	on	ADP
ap-490	10	8	list	list	NOUN
ap-490	10	9	-	-	PUNCT
ap-490	10	10	scheduling	scheduling	NOUN
ap-490	10	11	[	[	X
ap-490	10	12	2	2	NUM
ap-490	10	13	,	,	PUNCT
ap-490	10	14	3	3	NUM
ap-490	10	15	,	,	PUNCT
ap-490	10	16	4	4	NUM
ap-490	10	17	,	,	PUNCT
ap-490	10	18	7	7	NUM
ap-490	10	19	]	]	PUNCT
ap-490	10	20	.	.	PUNCT
ap-490	11	1	list	list	NOUN
ap-490	11	2	-	-	PUNCT
ap-490	11	3	scheduling	scheduling	NOUN
ap-490	11	4	consists	consist	NOUN
ap-490	11	5	of	of	ADP
ap-490	11	6	two	two	NUM
ap-490	11	7	phases	phase	NOUN
ap-490	11	8	:	:	PUNCT
ap-490	11	9	a	a	DET
ap-490	11	10	task	task	NOUN
ap-490	11	11	prioritizing	prioritize	VERB
ap-490	11	12	phase	phase	NOUN
ap-490	11	13	,	,	PUNCT
ap-490	11	14	where	where	SCONJ
ap-490	11	15	a	a	DET
ap-490	11	16	priority	priority	NOUN
ap-490	11	17	is	be	AUX
ap-490	11	18	computed	compute	VERB
ap-490	11	19	and	and	CCONJ
ap-490	11	20	assigned	assign	VERB
ap-490	11	21	to	to	ADP
ap-490	11	22	each	each	DET
ap-490	11	23	node	node	NOUN
ap-490	11	24	of	of	ADP
ap-490	11	25	the	the	DET
ap-490	11	26	dag	dag	PROPN
ap-490	11	27	,	,	PUNCT
ap-490	11	28	and	and	CCONJ
ap-490	11	29	a	a	DET
ap-490	11	30	processor	processor	NOUN
ap-490	11	31	selection	selection	NOUN
ap-490	11	32	phase	phase	NOUN
ap-490	11	33	,	,	PUNCT
ap-490	11	34	where	where	SCONJ
ap-490	11	35	each	each	DET
ap-490	11	36	task	task	NOUN
ap-490	11	37	(	(	PUNCT
ap-490	11	38	in	in	ADP
ap-490	11	39	order	order	NOUN
ap-490	11	40	of	of	ADP
ap-490	11	41	its	its	PRON
ap-490	11	42	priority	priority	NOUN
ap-490	11	43	)	)	PUNCT
ap-490	11	44	is	be	AUX
ap-490	11	45	assigned	assign	VERB
ap-490	11	46	a	a	DET
ap-490	11	47	processor	processor	NOUN
ap-490	11	48	that	that	PRON
ap-490	11	49	minimizes	minimize	VERB
ap-490	11	50	a	a	DET
ap-490	11	51	suitable	suitable	ADJ
ap-490	11	52	cost	cost	NOUN
ap-490	11	53	function	function	NOUN
ap-490	11	54	.	.	PUNCT
ap-490	12	1	the	the	DET
ap-490	12	2	scheduling	scheduling	NOUN
ap-490	12	3	heuristic	heuristic	NOUN
ap-490	12	4	is	be	AUX
ap-490	12	5	called	call	VERB
ap-490	12	6	static	static	ADJ
ap-490	12	7	if	if	SCONJ
ap-490	12	8	the	the	DET
ap-490	12	9	processor	processor	NOUN
ap-490	12	10	selection	selection	NOUN
ap-490	12	11	phase	phase	NOUN
ap-490	12	12	starts	start	VERB
ap-490	12	13	after	after	ADP
ap-490	12	14	completion	completion	NOUN
ap-490	12	15	of	of	ADP
ap-490	12	16	the	the	DET
ap-490	12	17	task	task	NOUN
ap-490	12	18	prioritizing	prioritize	VERB
ap-490	12	19	phase	phase	NOUN
ap-490	12	20	[	[	X
ap-490	12	21	2	2	NUM
ap-490	12	22	,	,	PUNCT
ap-490	12	23	8	8	NUM
ap-490	12	24	]	]	PUNCT
ap-490	12	25	and	and	CCONJ
ap-490	12	26	it	it	PRON
ap-490	12	27	is	be	AUX
ap-490	12	28	called	call	VERB
ap-490	12	29	dynamic	dynamic	ADJ
ap-490	12	30	if	if	SCONJ
ap-490	12	31	the	the	DET
ap-490	12	32	two	two	NUM
ap-490	12	33	phases	phase	NOUN
ap-490	12	34	are	be	AUX
ap-490	12	35	interleaved	interleave	VERB
ap-490	13	1	[	[	X
ap-490	13	2	9	9	NUM
ap-490	13	3	,	,	PUNCT
ap-490	13	4	10	10	NUM
ap-490	13	5	]	]	PUNCT
ap-490	13	6	.	.	PUNCT
ap-490	14	1	this	this	DET
ap-490	14	2	paper	paper	NOUN
ap-490	14	3	presents	present	VERB
ap-490	14	4	the	the	DET
ap-490	14	5	characteristics	characteristic	NOUN
ap-490	14	6	of	of	ADP
ap-490	14	7	the	the	DET
ap-490	14	8	two	two	NUM
ap-490	14	9	main	main	ADJ
ap-490	14	10	static	static	NOUN
ap-490	14	11	and	and	CCONJ
ap-490	14	12	the	the	DET
ap-490	14	13	two	two	NUM
ap-490	14	14	main	main	ADJ
ap-490	14	15	dynamic	dynamic	ADJ
ap-490	14	16	list	list	NOUN
ap-490	14	17	-	-	PUNCT
ap-490	14	18	scheduling	scheduling	NOUN
ap-490	14	19	algorithms	algorithm	NOUN
ap-490	14	20	.	.	PUNCT
ap-490	15	1	it	it	PRON
ap-490	15	2	also	also	ADV
ap-490	15	3	compares	compare	VERB
ap-490	15	4	their	their	PRON
ap-490	15	5	performance	performance	NOUN
ap-490	15	6	over	over	ADP
ap-490	15	7	a	a	DET
ap-490	15	8	90k	90k	NUM
ap-490	15	9	variant	variant	ADJ
ap-490	15	10	random	random	ADJ
ap-490	15	11	graph	graph	NOUN
ap-490	15	12	.	.	PUNCT
ap-490	16	1	the	the	DET
ap-490	16	2	remainder	remainder	NOUN
ap-490	16	3	of	of	ADP
ap-490	16	4	this	this	DET
ap-490	16	5	paper	paper	NOUN
ap-490	16	6	is	be	AUX
ap-490	16	7	organized	organize	VERB
ap-490	16	8	as	as	SCONJ
ap-490	16	9	follows	follow	VERB
ap-490	16	10	.	.	PUNCT
ap-490	17	1	the	the	DET
ap-490	17	2	next	next	ADJ
ap-490	17	3	section	section	NOUN
ap-490	17	4	defines	define	VERB
ap-490	17	5	the	the	DET
ap-490	17	6	static	static	ADJ
ap-490	17	7	task	task	NOUN
ap-490	17	8	-	-	PUNCT
ap-490	17	9	scheduling	scheduling	NOUN
ap-490	17	10	problem	problem	NOUN
ap-490	17	11	and	and	CCONJ
ap-490	17	12	gives	give	VERB
ap-490	17	13	the	the	DET
ap-490	17	14	background	background	NOUN
ap-490	17	15	of	of	ADP
ap-490	17	16	the	the	DET
ap-490	17	17	problem	problem	NOUN
ap-490	17	18	including	include	VERB
ap-490	17	19	some	some	DET
ap-490	17	20	definitions	definition	NOUN
ap-490	17	21	and	and	CCONJ
ap-490	17	22	parameters	parameter	NOUN
ap-490	17	23	used	use	VERB
ap-490	17	24	in	in	ADP
ap-490	17	25	the	the	DET
ap-490	17	26	algorithms	algorithm	NOUN
ap-490	17	27	.	.	PUNCT
ap-490	18	1	section	section	NOUN
ap-490	18	2	3	3	NUM
ap-490	18	3	presents	present	VERB
ap-490	18	4	a	a	DET
ap-490	18	5	brief	brief	ADJ
ap-490	18	6	review	review	NOUN
ap-490	18	7	of	of	ADP
ap-490	18	8	the	the	DET
ap-490	18	9	examined	examine	VERB
ap-490	18	10	algorithms	algorithm	NOUN
ap-490	18	11	.	.	PUNCT
ap-490	19	1	section	section	NOUN
ap-490	19	2	4	4	NUM
ap-490	19	3	,	,	PUNCT
ap-490	19	4	presents	present	VERB
ap-490	19	5	a	a	DET
ap-490	19	6	performance	performance	NOUN
ap-490	19	7	comparison	comparison	NOUN
ap-490	19	8	of	of	ADP
ap-490	19	9	the	the	DET
ap-490	19	10	reviewed	review	VERB
ap-490	19	11	algorithm	algorithm	NOUN
ap-490	19	12	.	.	PUNCT
ap-490	20	1	section	section	NOUN
ap-490	20	2	5	5	NUM
ap-490	20	3	provides	provide	VERB
ap-490	20	4	the	the	DET
ap-490	20	5	conclusion	conclusion	NOUN
ap-490	20	6	.	.	PUNCT
ap-490	21	1	2	2	NUM
ap-490	21	2	task	task	NOUN
ap-490	21	3	scheduling	scheduling	NOUN
ap-490	21	4	problem	problem	NOUN
ap-490	21	5	this	this	DET
ap-490	21	6	section	section	NOUN
ap-490	21	7	presents	present	VERB
ap-490	21	8	the	the	DET
ap-490	21	9	application	application	NOUN
ap-490	21	10	model	model	NOUN
ap-490	21	11	used	use	VERB
ap-490	21	12	for	for	ADP
ap-490	21	13	static	static	ADJ
ap-490	21	14	task	task	NOUN
ap-490	21	15	scheduling	scheduling	NOUN
ap-490	21	16	and	and	CCONJ
ap-490	21	17	the	the	DET
ap-490	21	18	homogeneous	homogeneous	ADJ
ap-490	21	19	computing	computing	NOUN
ap-490	21	20	environments	environment	NOUN
ap-490	21	21	model	model	NOUN
ap-490	21	22	that	that	SCONJ
ap-490	21	23	they	they	PRON
ap-490	21	24	will	will	AUX
ap-490	21	25	be	be	AUX
ap-490	21	26	used	use	VERB
ap-490	21	27	for	for	ADP
ap-490	21	28	the	the	DET
ap-490	21	29	surveyed	survey	VERB
ap-490	21	30	algorithms	algorithm	NOUN
ap-490	21	31	.	.	PUNCT
ap-490	22	1	the	the	DET
ap-490	22	2	application	application	NOUN
ap-490	22	3	can	can	AUX
ap-490	22	4	be	be	AUX
ap-490	22	5	represented	represent	VERB
ap-490	22	6	by	by	ADP
ap-490	22	7	a	a	DET
ap-490	22	8	directed	direct	VERB
ap-490	22	9	acyclic	acyclic	ADJ
ap-490	22	10	graph	graph	NOUN
ap-490	22	11	g(v	g(v	PROPN
ap-490	22	12	,	,	PUNCT
ap-490	22	13	e	e	NOUN
ap-490	22	14	,	,	PUNCT
ap-490	22	15	c	c	X
ap-490	22	16	,	,	PUNCT
ap-490	22	17	w	w	NOUN
ap-490	22	18	)	)	PUNCT
ap-490	22	19	where	where	SCONJ
ap-490	22	20	:	:	PUNCT
ap-490	22	21	v	v	NOUN
ap-490	22	22	is	be	AUX
ap-490	22	23	the	the	DET
ap-490	22	24	set	set	NOUN
ap-490	22	25	of	of	ADP
ap-490	22	26	v	v	NOUN
ap-490	22	27	nodes	node	NOUN
ap-490	22	28	,	,	PUNCT
ap-490	22	29	and	and	CCONJ
ap-490	22	30	each	each	DET
ap-490	22	31	node	node	NOUN
ap-490	22	32	v	v	PROPN
ap-490	22	33	vi	vi	PROPN
ap-490	22	34	�	�	PROPN
ap-490	22	35	represents	represent	VERB
ap-490	22	36	an	an	DET
ap-490	22	37	application	application	NOUN
ap-490	22	38	task	task	NOUN
ap-490	22	39	,	,	PUNCT
ap-490	22	40	which	which	PRON
ap-490	22	41	is	be	AUX
ap-490	22	42	a	a	DET
ap-490	22	43	sequence	sequence	NOUN
ap-490	22	44	of	of	ADP
ap-490	22	45	instructions	instruction	NOUN
ap-490	22	46	that	that	PRON
ap-490	22	47	must	must	AUX
ap-490	22	48	be	be	AUX
ap-490	22	49	executed	execute	VERB
ap-490	22	50	serially	serially	ADV
ap-490	22	51	on	on	ADP
ap-490	22	52	the	the	DET
ap-490	22	53	same	same	ADJ
ap-490	22	54	processor	processor	NOUN
ap-490	22	55	,	,	PUNCT
ap-490	22	56	w	w	PROPN
ap-490	22	57	is	be	AUX
ap-490	22	58	the	the	DET
ap-490	22	59	set	set	NOUN
ap-490	22	60	of	of	ADP
ap-490	22	61	computation	computation	NOUN
ap-490	22	62	costs	cost	NOUN
ap-490	22	63	,	,	PUNCT
ap-490	22	64	where	where	SCONJ
ap-490	22	65	w	w	PROPN
ap-490	22	66	wi	wi	PROPN
ap-490	22	67	�	�	PROPN
ap-490	22	68	is	be	AUX
ap-490	22	69	the	the	DET
ap-490	22	70	execution	execution	NOUN
ap-490	22	71	time	time	NOUN
ap-490	22	72	of	of	ADP
ap-490	22	73	task	task	PROPN
ap-490	22	74	vi	vi	PROPN
ap-490	22	75	,	,	PUNCT
ap-490	22	76	e	e	X
ap-490	22	77	is	be	AUX
ap-490	22	78	the	the	DET
ap-490	22	79	set	set	NOUN
ap-490	22	80	of	of	ADP
ap-490	22	81	communication	communication	NOUN
ap-490	22	82	edges	edge	NOUN
ap-490	22	83	.	.	PUNCT
ap-490	23	1	the	the	DET
ap-490	23	2	directed	direct	VERB
ap-490	23	3	edge	edge	NOUN
ap-490	23	4	ei	ei	PROPN
ap-490	23	5	,	,	PUNCT
ap-490	23	6	j	j	PROPN
ap-490	23	7	joins	join	VERB
ap-490	23	8	nodes	node	NOUN
ap-490	23	9	vi	vi	PROPN
ap-490	23	10	and	and	CCONJ
ap-490	23	11	vj	vj	ADP
ap-490	23	12	,	,	PUNCT
ap-490	23	13	where	where	SCONJ
ap-490	23	14	node	node	PROPN
ap-490	23	15	vi	vi	PROPN
ap-490	23	16	is	be	AUX
ap-490	23	17	called	call	VERB
ap-490	23	18	the	the	DET
ap-490	23	19	parent	parent	NOUN
ap-490	23	20	node	node	NOUN
ap-490	23	21	and	and	CCONJ
ap-490	23	22	node	node	PROPN
ap-490	23	23	vj	vj	PROPN
ap-490	23	24	is	be	AUX
ap-490	23	25	called	call	VERB
ap-490	23	26	the	the	DET
ap-490	23	27	child	child	NOUN
ap-490	23	28	node	node	NOUN
ap-490	23	29	.	.	PUNCT
ap-490	24	1	this	this	PRON
ap-490	24	2	also	also	ADV
ap-490	24	3	implies	imply	VERB
ap-490	24	4	that	that	SCONJ
ap-490	24	5	vj	vj	PROPN
ap-490	24	6	can	can	AUX
ap-490	24	7	not	not	PART
ap-490	24	8	start	start	VERB
ap-490	24	9	until	until	ADP
ap-490	24	10	vi	vi	NOUN
ap-490	24	11	finishes	finish	NOUN
ap-490	24	12	and	and	CCONJ
ap-490	24	13	sends	send	VERB
ap-490	24	14	its	its	PRON
ap-490	24	15	data	datum	NOUN
ap-490	24	16	to	to	ADP
ap-490	24	17	vj	vj	PROPN
ap-490	24	18	.	.	PUNCT
ap-490	25	1	c	c	PROPN
ap-490	25	2	is	be	AUX
ap-490	25	3	the	the	DET
ap-490	25	4	set	set	NOUN
ap-490	25	5	of	of	ADP
ap-490	25	6	communication	communication	NOUN
ap-490	25	7	costs	cost	NOUN
ap-490	25	8	,	,	PUNCT
ap-490	25	9	and	and	CCONJ
ap-490	25	10	the	the	DET
ap-490	25	11	edge	edge	NOUN
ap-490	25	12	ei	ei	PROPN
ap-490	25	13	,	,	PUNCT
ap-490	25	14	j	j	PROPN
ap-490	25	15	has	have	VERB
ap-490	25	16	a	a	DET
ap-490	25	17	communication	communication	NOUN
ap-490	25	18	cost	cost	NOUN
ap-490	25	19	c	c	PROPN
ap-490	25	20	ci	ci	PROPN
ap-490	25	21	j	j	PROPN
ap-490	25	22	,	,	PUNCT
ap-490	25	23	�	�	PROPN
ap-490	25	24	.	.	PUNCT
ap-490	26	1	a	a	DET
ap-490	26	2	task	task	NOUN
ap-490	26	3	without	without	ADP
ap-490	26	4	any	any	DET
ap-490	26	5	parent	parent	NOUN
ap-490	26	6	is	be	AUX
ap-490	26	7	called	call	VERB
ap-490	26	8	an	an	DET
ap-490	26	9	entry	entry	NOUN
ap-490	26	10	task	task	NOUN
ap-490	26	11	and	and	CCONJ
ap-490	26	12	a	a	DET
ap-490	26	13	task	task	NOUN
ap-490	26	14	without	without	ADP
ap-490	26	15	any	any	DET
ap-490	26	16	child	child	NOUN
ap-490	26	17	is	be	AUX
ap-490	26	18	called	call	VERB
ap-490	26	19	an	an	DET
ap-490	26	20	exit	exit	NOUN
ap-490	26	21	task	task	NOUN
ap-490	26	22	.	.	PUNCT
ap-490	27	1	if	if	SCONJ
ap-490	27	2	there	there	PRON
ap-490	27	3	is	be	VERB
ap-490	27	4	more	more	ADJ
ap-490	27	5	than	than	ADP
ap-490	27	6	one	one	NUM
ap-490	27	7	exit	exit	NOUN
ap-490	27	8	(	(	PUNCT
ap-490	27	9	entry	entry	NOUN
ap-490	27	10	)	)	PUNCT
ap-490	27	11	task	task	NOUN
ap-490	27	12	,	,	PUNCT
ap-490	27	13	they	they	PRON
ap-490	27	14	may	may	AUX
ap-490	27	15	be	be	AUX
ap-490	27	16	connected	connect	VERB
ap-490	27	17	to	to	ADP
ap-490	27	18	a	a	DET
ap-490	27	19	zero	zero	NUM
ap-490	27	20	-	-	PUNCT
ap-490	27	21	cost	cost	NOUN
ap-490	27	22	pseudo	pseudo	NOUN
ap-490	27	23	exit	exit	NOUN
ap-490	27	24	(	(	PUNCT
ap-490	27	25	entry	entry	NOUN
ap-490	27	26	)	)	PUNCT
ap-490	27	27	task	task	NOUN
ap-490	27	28	with	with	ADP
ap-490	27	29	zero	zero	NUM
ap-490	27	30	-	-	PUNCT
ap-490	27	31	cost	cost	NOUN
ap-490	27	32	edges	edge	NOUN
ap-490	27	33	,	,	PUNCT
ap-490	27	34	which	which	PRON
ap-490	27	35	do	do	AUX
ap-490	27	36	not	not	PART
ap-490	27	37	affect	affect	VERB
ap-490	27	38	the	the	DET
ap-490	27	39	schedule	schedule	NOUN
ap-490	27	40	.	.	PUNCT
ap-490	28	1	the	the	DET
ap-490	28	2	homogeneous	homogeneous	ADJ
ap-490	28	3	computing	computing	NOUN
ap-490	28	4	environment	environment	NOUN
ap-490	28	5	model	model	NOUN
ap-490	28	6	is	be	AUX
ap-490	28	7	a	a	DET
ap-490	28	8	set	set	NOUN
ap-490	28	9	p	p	NOUN
ap-490	28	10	of	of	ADP
ap-490	28	11	p	p	NOUN
ap-490	28	12	identical	identical	ADJ
ap-490	28	13	processors	processor	NOUN
ap-490	28	14	connected	connect	VERB
ap-490	28	15	in	in	ADP
ap-490	28	16	a	a	DET
ap-490	28	17	fully	fully	ADV
ap-490	28	18	connected	connect	VERB
ap-490	28	19	graph	graph	NOUN
ap-490	28	20	.	.	PUNCT
ap-490	29	1	it	it	PRON
ap-490	29	2	is	be	AUX
ap-490	29	3	also	also	ADV
ap-490	29	4	assumed	assume	VERB
ap-490	29	5	that	that	SCONJ
ap-490	29	6	:	:	PUNCT
ap-490	29	7	�	�	PROPN
ap-490	29	8	any	any	DET
ap-490	29	9	processor	processor	NOUN
ap-490	29	10	can	can	AUX
ap-490	29	11	execute	execute	VERB
ap-490	29	12	the	the	DET
ap-490	29	13	task	task	NOUN
ap-490	29	14	and	and	CCONJ
ap-490	29	15	communicate	communicate	VERB
ap-490	29	16	with	with	ADP
ap-490	29	17	other	other	ADJ
ap-490	29	18	processors	processor	NOUN
ap-490	29	19	at	at	ADP
ap-490	29	20	the	the	DET
ap-490	29	21	same	same	ADJ
ap-490	29	22	time	time	NOUN
ap-490	29	23	,	,	PUNCT
ap-490	29	24	�	�	PROPN
ap-490	29	25	once	once	SCONJ
ap-490	29	26	a	a	DET
ap-490	29	27	processor	processor	NOUN
ap-490	29	28	has	have	AUX
ap-490	29	29	started	start	VERB
ap-490	29	30	task	task	NOUN
ap-490	29	31	execution	execution	NOUN
ap-490	29	32	,	,	PUNCT
ap-490	29	33	it	it	PRON
ap-490	29	34	continues	continue	VERB
ap-490	29	35	without	without	ADP
ap-490	29	36	interruption	interruption	NOUN
ap-490	29	37	,	,	PUNCT
ap-490	29	38	and	and	CCONJ
ap-490	29	39	on	on	ADP
ap-490	29	40	completing	complete	VERB
ap-490	29	41	the	the	DET
ap-490	29	42	execution	execution	NOUN
ap-490	29	43	it	it	PRON
ap-490	29	44	sends	send	VERB
ap-490	29	45	immediately	immediately	ADV
ap-490	29	46	the	the	DET
ap-490	29	47	output	output	NOUN
ap-490	29	48	data	datum	NOUN
ap-490	29	49	to	to	ADP
ap-490	29	50	all	all	DET
ap-490	29	51	children	child	NOUN
ap-490	29	52	tasks	task	NOUN
ap-490	29	53	in	in	ADP
ap-490	29	54	parallel	parallel	NOUN
ap-490	29	55	.	.	PUNCT
ap-490	30	1	16	16	NUM
ap-490	31	1	©	©	PROPN
ap-490	31	2	czech	czech	PROPN
ap-490	31	3	technical	technical	PROPN
ap-490	31	4	university	university	PROPN
ap-490	31	5	publishing	publishing	NOUN
ap-490	31	6	house	house	NOUN
ap-490	31	7	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-490	31	8	acta	acta	PROPN
ap-490	31	9	polytechnica	polytechnica	PROPN
ap-490	31	10	vol	vol	NOUN
ap-490	31	11	.	.	PUNCT
ap-490	32	1	43	43	NUM
ap-490	32	2	no	no	NOUN
ap-490	32	3	.	.	PUNCT
ap-490	33	1	6/2003	6/2003	NUM
ap-490	33	2	static	static	ADJ
ap-490	33	3	vs.	vs.	ADP
ap-490	33	4	dynamic	dynamic	ADJ
ap-490	33	5	list	list	NOUN
ap-490	33	6	-	-	PUNCT
ap-490	33	7	scheduling	scheduling	NOUN
ap-490	33	8	performance	performance	NOUN
ap-490	33	9	comparison	comparison	NOUN
ap-490	33	10	t.	t.	PROPN
ap-490	33	11	hagras	hagras	PROPN
ap-490	33	12	,	,	PUNCT
ap-490	33	13	j.	j.	PROPN
ap-490	33	14	janeček	janeček	PROPN
ap-490	33	15	the	the	DET
ap-490	33	16	problem	problem	NOUN
ap-490	33	17	of	of	ADP
ap-490	33	18	efficient	efficient	ADJ
ap-490	33	19	task	task	NOUN
ap-490	33	20	scheduling	scheduling	NOUN
ap-490	33	21	is	be	AUX
ap-490	33	22	one	one	NUM
ap-490	33	23	of	of	ADP
ap-490	33	24	the	the	DET
ap-490	33	25	most	most	ADV
ap-490	33	26	important	important	ADJ
ap-490	33	27	and	and	CCONJ
ap-490	33	28	most	most	ADV
ap-490	33	29	difficult	difficult	ADJ
ap-490	33	30	issues	issue	NOUN
ap-490	33	31	in	in	ADP
ap-490	33	32	homogeneous	homogeneous	ADJ
ap-490	33	33	computing	computing	NOUN
ap-490	33	34	environments	environment	NOUN
ap-490	33	35	.	.	PUNCT
ap-490	34	1	finding	find	VERB
ap-490	34	2	an	an	DET
ap-490	34	3	optimal	optimal	ADJ
ap-490	34	4	solution	solution	NOUN
ap-490	34	5	for	for	ADP
ap-490	34	6	a	a	DET
ap-490	34	7	scheduling	scheduling	NOUN
ap-490	34	8	problem	problem	NOUN
ap-490	34	9	is	be	AUX
ap-490	34	10	np	np	NOUN
ap-490	34	11	-	-	PUNCT
ap-490	34	12	complete	complete	ADJ
ap-490	34	13	.	.	PUNCT
ap-490	35	1	therefore	therefore	ADV
ap-490	35	2	,	,	PUNCT
ap-490	35	3	it	it	PRON
ap-490	35	4	is	be	AUX
ap-490	35	5	necessary	necessary	ADJ
ap-490	35	6	to	to	PART
ap-490	35	7	have	have	VERB
ap-490	35	8	heuristics	heuristic	NOUN
ap-490	35	9	to	to	PART
ap-490	35	10	find	find	VERB
ap-490	35	11	a	a	DET
ap-490	35	12	reasonably	reasonably	ADV
ap-490	35	13	good	good	ADJ
ap-490	35	14	schedule	schedule	NOUN
ap-490	35	15	rather	rather	ADV
ap-490	35	16	than	than	ADP
ap-490	35	17	evaluate	evaluate	VERB
ap-490	35	18	all	all	DET
ap-490	35	19	possible	possible	ADJ
ap-490	35	20	schedules	schedule	NOUN
ap-490	35	21	.	.	PUNCT
ap-490	36	1	list	list	NOUN
ap-490	36	2	-	-	PUNCT
ap-490	36	3	scheduling	scheduling	NOUN
ap-490	36	4	is	be	AUX
ap-490	36	5	generally	generally	ADV
ap-490	36	6	accepted	accept	VERB
ap-490	36	7	as	as	ADP
ap-490	36	8	an	an	DET
ap-490	36	9	attractive	attractive	ADJ
ap-490	36	10	approach	approach	NOUN
ap-490	36	11	,	,	PUNCT
ap-490	36	12	since	since	SCONJ
ap-490	36	13	it	it	PRON
ap-490	36	14	pairs	pair	VERB
ap-490	36	15	low	low	ADJ
ap-490	36	16	complexity	complexity	NOUN
ap-490	36	17	with	with	ADP
ap-490	36	18	good	good	ADJ
ap-490	36	19	results	result	NOUN
ap-490	36	20	.	.	PUNCT
ap-490	37	1	list	list	NOUN
ap-490	37	2	-	-	PUNCT
ap-490	37	3	scheduling	schedule	VERB
ap-490	37	4	algorithms	algorithm	NOUN
ap-490	37	5	schedule	schedule	NOUN
ap-490	37	6	tasks	task	NOUN
ap-490	37	7	in	in	ADP
ap-490	37	8	order	order	NOUN
ap-490	37	9	of	of	ADP
ap-490	37	10	priority	priority	NOUN
ap-490	37	11	.	.	PUNCT
ap-490	38	1	this	this	DET
ap-490	38	2	priority	priority	NOUN
ap-490	38	3	can	can	AUX
ap-490	38	4	be	be	AUX
ap-490	38	5	computed	compute	VERB
ap-490	38	6	either	either	CCONJ
ap-490	38	7	statically	statically	ADV
ap-490	38	8	(	(	PUNCT
ap-490	38	9	before	before	ADP
ap-490	38	10	scheduling	scheduling	NOUN
ap-490	38	11	)	)	PUNCT
ap-490	38	12	or	or	CCONJ
ap-490	38	13	dynamically	dynamically	ADV
ap-490	38	14	(	(	PUNCT
ap-490	38	15	during	during	ADP
ap-490	38	16	scheduling	scheduling	NOUN
ap-490	38	17	)	)	PUNCT
ap-490	38	18	.	.	PUNCT
ap-490	39	1	this	this	DET
ap-490	39	2	paper	paper	NOUN
ap-490	39	3	presents	present	VERB
ap-490	39	4	the	the	DET
ap-490	39	5	characteristics	characteristic	NOUN
ap-490	39	6	of	of	ADP
ap-490	39	7	the	the	DET
ap-490	39	8	two	two	NUM
ap-490	39	9	main	main	ADJ
ap-490	39	10	static	static	NOUN
ap-490	39	11	and	and	CCONJ
ap-490	39	12	the	the	DET
ap-490	39	13	two	two	NUM
ap-490	39	14	main	main	ADJ
ap-490	39	15	dynamic	dynamic	ADJ
ap-490	39	16	list	list	NOUN
ap-490	39	17	-	-	PUNCT
ap-490	39	18	scheduling	scheduling	NOUN
ap-490	39	19	algorithms	algorithm	NOUN
ap-490	39	20	.	.	PUNCT
ap-490	40	1	it	it	PRON
ap-490	40	2	also	also	ADV
ap-490	40	3	compares	compare	VERB
ap-490	40	4	their	their	PRON
ap-490	40	5	performance	performance	NOUN
ap-490	40	6	in	in	ADP
ap-490	40	7	dealing	deal	VERB
ap-490	40	8	with	with	ADP
ap-490	40	9	random	random	ADJ
ap-490	40	10	generated	generate	VERB
ap-490	40	11	graphs	graph	NOUN
ap-490	40	12	with	with	ADP
ap-490	40	13	various	various	ADJ
ap-490	40	14	characteristics	characteristic	NOUN
ap-490	40	15	.	.	PUNCT
ap-490	41	1	keywords	keyword	NOUN
ap-490	41	2	:	:	PUNCT
ap-490	41	3	list	list	NOUN
ap-490	41	4	scheduling	scheduling	NOUN
ap-490	41	5	,	,	PUNCT
ap-490	41	6	compile	compile	NOUN
ap-490	41	7	time	time	NOUN
ap-490	41	8	scheduling	scheduling	NOUN
ap-490	41	9	,	,	PUNCT
ap-490	41	10	task	task	NOUN
ap-490	41	11	graph	graph	NOUN
ap-490	41	12	scheduling	scheduling	NOUN
ap-490	41	13	,	,	PUNCT
ap-490	41	14	homogeneous	homogeneous	ADJ
ap-490	41	15	computing	computing	NOUN
ap-490	41	16	.	.	PUNCT
ap-490	42	1	the	the	DET
ap-490	42	2	communication	communication	NOUN
ap-490	42	3	cost	cost	NOUN
ap-490	42	4	ci	ci	PROPN
ap-490	42	5	,	,	PUNCT
ap-490	42	6	j	j	PROPN
ap-490	42	7	for	for	ADP
ap-490	42	8	transferring	transfer	VERB
ap-490	42	9	data	datum	NOUN
ap-490	42	10	from	from	ADP
ap-490	42	11	task	task	PROPN
ap-490	42	12	vi	vi	PROPN
ap-490	42	13	(	(	PUNCT
ap-490	42	14	scheduled	schedule	VERB
ap-490	42	15	on	on	ADP
ap-490	42	16	pm	pm	NOUN
ap-490	42	17	)	)	PUNCT
ap-490	42	18	to	to	ADP
ap-490	42	19	task	task	PROPN
ap-490	42	20	vj	vj	PROPN
ap-490	42	21	(	(	PUNCT
ap-490	42	22	scheduled	schedule	VERB
ap-490	42	23	on	on	ADP
ap-490	42	24	pn	pn	PROPN
ap-490	42	25	)	)	PUNCT
ap-490	42	26	,	,	PUNCT
ap-490	42	27	is	be	AUX
ap-490	42	28	defined	define	VERB
ap-490	42	29	as	as	ADP
ap-490	42	30	:	:	PUNCT
ap-490	42	31	c	c	PROPN
ap-490	42	32	s	s	PROPN
ap-490	42	33	ri	ri	PROPN
ap-490	42	34	j	j	PROPN
ap-490	42	35	i	i	PROPN
ap-490	42	36	j	j	PROPN
ap-490	42	37	,	,	PUNCT
ap-490	42	38	,	,	PUNCT
ap-490	42	39	�	�	PROPN
ap-490	42	40	�	�	PROPN
ap-490	42	41	�	�	PROPN
ap-490	42	42	�	�	PROPN
ap-490	42	43	,	,	PUNCT
ap-490	42	44	where	where	SCONJ
ap-490	42	45	s	s	NOUN
ap-490	42	46	is	be	AUX
ap-490	42	47	the	the	DET
ap-490	42	48	cost	cost	NOUN
ap-490	42	49	of	of	ADP
ap-490	42	50	starting	start	VERB
ap-490	42	51	communication	communication	NOUN
ap-490	42	52	between	between	ADP
ap-490	42	53	processors	processor	NOUN
ap-490	42	54	(	(	PUNCT
ap-490	42	55	in	in	ADP
ap-490	42	56	secs	sec	NOUN
ap-490	42	57	)	)	PUNCT
ap-490	42	58	,	,	PUNCT
ap-490	42	59	�	�	PROPN
ap-490	42	60	i	i	PROPN
ap-490	42	61	,	,	PUNCT
ap-490	42	62	j	j	PROPN
ap-490	42	63	is	be	AUX
ap-490	42	64	the	the	DET
ap-490	42	65	amount	amount	NOUN
ap-490	42	66	of	of	ADP
ap-490	42	67	data	datum	NOUN
ap-490	42	68	transmitted	transmit	VERB
ap-490	42	69	from	from	ADP
ap-490	42	70	task	task	NOUN
ap-490	42	71	vi	vi	PROPN
ap-490	42	72	to	to	ADP
ap-490	42	73	task	task	PROPN
ap-490	42	74	vj	vj	PROPN
ap-490	42	75	(	(	PUNCT
ap-490	42	76	in	in	ADP
ap-490	42	77	bytes	byte	NOUN
ap-490	42	78	)	)	PUNCT
ap-490	42	79	,	,	PUNCT
ap-490	42	80	r	r	NOUN
ap-490	42	81	is	be	AUX
ap-490	42	82	the	the	DET
ap-490	42	83	cost	cost	NOUN
ap-490	42	84	of	of	ADP
ap-490	42	85	communication	communication	NOUN
ap-490	42	86	per	per	ADP
ap-490	42	87	transferred	transfer	VERB
ap-490	42	88	byte	byte	NOUN
ap-490	42	89	(	(	PUNCT
ap-490	42	90	in	in	ADP
ap-490	42	91	sec	sec	PROPN
ap-490	42	92	/	/	SYM
ap-490	42	93	byte	byte	NOUN
ap-490	42	94	)	)	PUNCT
ap-490	42	95	.	.	PUNCT
ap-490	43	1	it	it	PRON
ap-490	43	2	is	be	AUX
ap-490	43	3	assumed	assume	VERB
ap-490	43	4	that	that	SCONJ
ap-490	43	5	startup	startup	NOUN
ap-490	43	6	cost	cost	NOUN
ap-490	43	7	s	s	PART
ap-490	43	8	is	be	AUX
ap-490	43	9	negligible	negligible	ADJ
ap-490	43	10	and	and	CCONJ
ap-490	43	11	the	the	DET
ap-490	43	12	unit	unit	NOUN
ap-490	43	13	cost	cost	NOUN
ap-490	43	14	r	r	NOUN
ap-490	43	15	is	be	AUX
ap-490	43	16	the	the	DET
ap-490	43	17	same	same	ADJ
ap-490	43	18	for	for	ADP
ap-490	43	19	any	any	DET
ap-490	43	20	two	two	NUM
ap-490	43	21	processors	processor	NOUN
ap-490	43	22	,	,	PUNCT
ap-490	43	23	so	so	SCONJ
ap-490	43	24	that	that	SCONJ
ap-490	43	25	the	the	DET
ap-490	43	26	communication	communication	NOUN
ap-490	43	27	cost	cost	NOUN
ap-490	43	28	for	for	ADP
ap-490	43	29	any	any	DET
ap-490	43	30	two	two	NUM
ap-490	43	31	tasks	task	NOUN
ap-490	43	32	is	be	AUX
ap-490	43	33	a	a	DET
ap-490	43	34	function	function	NOUN
ap-490	43	35	of	of	ADP
ap-490	43	36	the	the	DET
ap-490	43	37	amount	amount	NOUN
ap-490	43	38	of	of	ADP
ap-490	43	39	transferred	transfer	VERB
ap-490	43	40	data	datum	NOUN
ap-490	43	41	only	only	ADV
ap-490	43	42	.	.	PUNCT
ap-490	44	1	2.1	2.1	NUM
ap-490	44	2	basic	basic	ADJ
ap-490	44	3	scheduling	scheduling	NOUN
ap-490	44	4	attributes	attribute	VERB
ap-490	44	5	the	the	DET
ap-490	44	6	frequently	frequently	ADV
ap-490	44	7	used	use	VERB
ap-490	44	8	attributes	attribute	NOUN
ap-490	44	9	for	for	ADP
ap-490	44	10	assigning	assign	VERB
ap-490	44	11	priority	priority	NOUN
ap-490	44	12	in	in	ADP
ap-490	44	13	list	list	NOUN
ap-490	44	14	-	-	PUNCT
ap-490	44	15	scheduling	scheduling	NOUN
ap-490	44	16	are	be	AUX
ap-490	44	17	t	t	PROPN
ap-490	44	18	�	�	PROPN
ap-490	44	19	level	level	NOUN
ap-490	44	20	(	(	PUNCT
ap-490	44	21	top	top	ADJ
ap-490	44	22	level	level	NOUN
ap-490	44	23	)	)	PUNCT
ap-490	44	24	and	and	CCONJ
ap-490	44	25	b	b	X
ap-490	44	26	�	�	PROPN
ap-490	44	27	level	level	NOUN
ap-490	44	28	(	(	PUNCT
ap-490	44	29	bottom	bottom	ADJ
ap-490	44	30	level	level	NOUN
ap-490	44	31	)	)	PUNCT
ap-490	44	32	.	.	PUNCT
ap-490	45	1	the	the	DET
ap-490	45	2	t	t	PROPN
ap-490	45	3	�	�	PROPN
ap-490	45	4	level	level	NOUN
ap-490	45	5	of	of	ADP
ap-490	45	6	node	node	PROPN
ap-490	45	7	vi	vi	PROPN
ap-490	45	8	is	be	AUX
ap-490	45	9	the	the	DET
ap-490	45	10	length	length	NOUN
ap-490	45	11	of	of	ADP
ap-490	45	12	the	the	DET
ap-490	45	13	longest	long	ADJ
ap-490	45	14	path	path	NOUN
ap-490	45	15	from	from	ADP
ap-490	45	16	the	the	DET
ap-490	45	17	entry	entry	NOUN
ap-490	45	18	node	node	NOUN
ap-490	45	19	to	to	ADP
ap-490	45	20	vi	vi	PROPN
ap-490	45	21	(	(	PUNCT
ap-490	45	22	excluding	exclude	VERB
ap-490	45	23	vi	vi	NOUN
ap-490	45	24	)	)	PUNCT
ap-490	45	25	.	.	PUNCT
ap-490	46	1	here	here	ADV
ap-490	46	2	,	,	PUNCT
ap-490	46	3	the	the	DET
ap-490	46	4	length	length	NOUN
ap-490	46	5	of	of	ADP
ap-490	46	6	the	the	DET
ap-490	46	7	path	path	NOUN
ap-490	46	8	is	be	AUX
ap-490	46	9	the	the	DET
ap-490	46	10	sum	sum	NOUN
ap-490	46	11	of	of	ADP
ap-490	46	12	all	all	DET
ap-490	46	13	nodes	node	NOUN
ap-490	46	14	and	and	CCONJ
ap-490	46	15	edges	edge	VERB
ap-490	46	16	weights	weight	NOUN
ap-490	46	17	along	along	ADP
ap-490	46	18	the	the	DET
ap-490	46	19	path	path	NOUN
ap-490	46	20	.	.	PUNCT
ap-490	47	1	the	the	DET
ap-490	47	2	t	t	PROPN
ap-490	47	3	level	level	NOUN
ap-490	47	4	vi	vi	PROPN
ap-490	47	5	�	�	PROPN
ap-490	47	6	(	(	PUNCT
ap-490	47	7	)	)	PUNCT
ap-490	47	8	is	be	AUX
ap-490	47	9	computed	compute	VERB
ap-490	47	10	recursively	recursively	ADV
ap-490	47	11	by	by	ADP
ap-490	47	12	traversing	traverse	VERB
ap-490	47	13	the	the	DET
ap-490	47	14	dag	dag	PROPN
ap-490	47	15	downward	downward	ADV
ap-490	47	16	starting	start	VERB
ap-490	47	17	from	from	ADP
ap-490	47	18	the	the	DET
ap-490	47	19	entry	entry	NOUN
ap-490	47	20	node	node	NOUN
ap-490	47	21	ventry	ventry	NOUN
ap-490	47	22	as	as	SCONJ
ap-490	47	23	follows	follow	VERB
ap-490	47	24	:	:	PUNCT
ap-490	47	25	�	�	PROPN
ap-490	47	26	�	�	PROPN
ap-490	47	27	�	�	PROPN
ap-490	47	28	�	�	PROPN
ap-490	47	29	t	t	PROPN
ap-490	47	30	level	level	NOUN
ap-490	47	31	v	v	ADP
ap-490	47	32	t	t	NOUN
ap-490	47	33	level	level	NOUN
ap-490	47	34	v	v	PROPN
ap-490	47	35	w	w	PROPN
ap-490	47	36	ci	ci	PROPN
ap-490	47	37	v	v	PROPN
ap-490	47	38	pred	pre	VERB
ap-490	47	39	v	v	NUM
ap-490	47	40	m	m	NOUN
ap-490	47	41	m	m	VERB
ap-490	47	42	m	m	VERB
ap-490	47	43	i	i	PRON
ap-490	47	44	m	m	VERB
ap-490	48	1	i	i	PRON
ap-490	48	2	�	�	PROPN
ap-490	48	3	�	�	PROPN
ap-490	48	4	�	�	PROPN
ap-490	48	5	�	�	PROPN
ap-490	48	6	�	�	PROPN
ap-490	48	7	�	�	PROPN
ap-490	48	8	max	max	PROPN
ap-490	48	9	(	(	PUNCT
ap-490	48	10	)	)	PUNCT
ap-490	48	11	,	,	PUNCT
ap-490	48	12	,	,	PUNCT
ap-490	48	13	where	where	SCONJ
ap-490	48	14	pred(vi	pred(vi	NOUN
ap-490	48	15	)	)	PUNCT
ap-490	48	16	is	be	AUX
ap-490	48	17	the	the	DET
ap-490	48	18	set	set	NOUN
ap-490	48	19	of	of	ADP
ap-490	48	20	immediate	immediate	ADJ
ap-490	48	21	predecessors	predecessor	NOUN
ap-490	48	22	of	of	ADP
ap-490	48	23	vi	vi	PROPN
ap-490	48	24	and	and	CCONJ
ap-490	48	25	t	t	PROPN
ap-490	48	26	level	level	NOUN
ap-490	48	27	ventry	ventry	PROPN
ap-490	48	28	�	�	PROPN
ap-490	48	29	�	�	PROPN
ap-490	48	30	(	(	PUNCT
ap-490	48	31	)	)	PUNCT
ap-490	48	32	0	0	X
ap-490	48	33	.	.	PUNCT
ap-490	49	1	the	the	DET
ap-490	49	2	�	�	PROPN
ap-490	49	3	�	�	PROPN
ap-490	49	4	b	b	PROPN
ap-490	49	5	level	level	NOUN
ap-490	49	6	vi	vi	NOUN
ap-490	49	7	�	�	PROPN
ap-490	49	8	of	of	ADP
ap-490	49	9	node	node	PROPN
ap-490	49	10	vi	vi	PROPN
ap-490	49	11	is	be	AUX
ap-490	49	12	the	the	DET
ap-490	49	13	length	length	NOUN
ap-490	49	14	of	of	ADP
ap-490	49	15	the	the	DET
ap-490	49	16	longest	long	ADJ
ap-490	49	17	path	path	NOUN
ap-490	49	18	from	from	ADP
ap-490	49	19	vi	vi	PROPN
ap-490	49	20	to	to	ADP
ap-490	49	21	the	the	DET
ap-490	49	22	exit	exit	NOUN
ap-490	49	23	node	node	NOUN
ap-490	49	24	.	.	PUNCT
ap-490	50	1	the	the	DET
ap-490	50	2	�	�	PROPN
ap-490	50	3	�	�	PROPN
ap-490	50	4	b	b	PROPN
ap-490	50	5	level	level	NOUN
ap-490	50	6	vi	vi	NOUN
ap-490	50	7	�	�	PROPN
ap-490	50	8	is	be	AUX
ap-490	50	9	computed	compute	VERB
ap-490	50	10	recursively	recursively	ADV
ap-490	50	11	by	by	ADP
ap-490	50	12	traversing	traverse	VERB
ap-490	50	13	the	the	DET
ap-490	50	14	dag	dag	PROPN
ap-490	50	15	upward	upward	ADV
ap-490	50	16	starting	start	VERB
ap-490	50	17	from	from	ADP
ap-490	50	18	the	the	DET
ap-490	50	19	exit	exit	NOUN
ap-490	50	20	node	node	NOUN
ap-490	50	21	vexit	vexit	NOUN
ap-490	50	22	as	as	SCONJ
ap-490	50	23	follows	follow	VERB
ap-490	50	24	:	:	PUNCT
ap-490	50	25	�	�	PROPN
ap-490	50	26	�	�	PROPN
ap-490	50	27	�	�	PROPN
ap-490	50	28	�	�	PROPN
ap-490	50	29	b	b	PROPN
ap-490	50	30	level	level	NOUN
ap-490	50	31	v	v	ADP
ap-490	50	32	w	w	PROPN
ap-490	50	33	b	b	PROPN
ap-490	50	34	level	level	NOUN
ap-490	50	35	v	v	ADP
ap-490	50	36	ci	ci	NOUN
ap-490	51	1	i	i	PRON
ap-490	51	2	v	v	PROPN
ap-490	51	3	succ	succ	PROPN
ap-490	51	4	v	v	INTJ
ap-490	51	5	m	m	NOUN
ap-490	51	6	i	i	PRON
ap-490	51	7	m	m	VERB
ap-490	51	8	m	m	VERB
ap-490	51	9	i	i	PRON
ap-490	51	10	�	�	PROPN
ap-490	51	11	�	�	PROPN
ap-490	51	12	�	�	PROPN
ap-490	51	13	�	�	PROPN
ap-490	51	14	�	�	PROPN
ap-490	51	15	�	�	PROPN
ap-490	51	16	max	max	PROPN
ap-490	51	17	(	(	PUNCT
ap-490	51	18	)	)	PUNCT
ap-490	51	19	,	,	PUNCT
ap-490	51	20	,	,	PUNCT
ap-490	51	21	where	where	SCONJ
ap-490	51	22	succ(vi	succ(vi	PROPN
ap-490	51	23	)	)	PUNCT
ap-490	51	24	is	be	AUX
ap-490	51	25	the	the	DET
ap-490	51	26	set	set	NOUN
ap-490	51	27	of	of	ADP
ap-490	51	28	immediate	immediate	ADJ
ap-490	51	29	successors	successor	NOUN
ap-490	51	30	of	of	ADP
ap-490	51	31	vi	vi	PROPN
ap-490	51	32	and	and	CCONJ
ap-490	51	33	�	�	PROPN
ap-490	51	34	�	�	PROPN
ap-490	51	35	�	�	PROPN
ap-490	51	36	�	�	PROPN
ap-490	51	37	b	b	PROPN
ap-490	51	38	level	level	NOUN
ap-490	51	39	v	v	ADP
ap-490	51	40	w	w	PROPN
ap-490	51	41	vexit	vexit	PROPN
ap-490	51	42	exit	exit	NOUN
ap-490	51	43	�	�	PROPN
ap-490	51	44	�	�	PROPN
ap-490	51	45	.	.	PUNCT
ap-490	52	1	if	if	SCONJ
ap-490	52	2	the	the	DET
ap-490	52	3	edge	edge	NOUN
ap-490	52	4	weights	weight	NOUN
ap-490	52	5	are	be	AUX
ap-490	52	6	not	not	PART
ap-490	52	7	taken	take	VERB
ap-490	52	8	into	into	ADP
ap-490	52	9	account	account	NOUN
ap-490	52	10	in	in	ADP
ap-490	52	11	computing	compute	VERB
ap-490	52	12	the	the	DET
ap-490	52	13	b	b	PROPN
ap-490	52	14	level	level	NOUN
ap-490	52	15	�	�	PROPN
ap-490	52	16	,	,	PUNCT
ap-490	52	17	the	the	DET
ap-490	52	18	b	b	PROPN
ap-490	52	19	level	level	NOUN
ap-490	52	20	�	�	NOUN
ap-490	52	21	in	in	ADP
ap-490	52	22	this	this	DET
ap-490	52	23	case	case	NOUN
ap-490	52	24	is	be	AUX
ap-490	52	25	called	call	VERB
ap-490	52	26	the	the	DET
ap-490	52	27	static	static	ADJ
ap-490	52	28	b	b	PROPN
ap-490	52	29	level	level	NOUN
ap-490	52	30	�	�	NOUN
ap-490	52	31	or	or	CCONJ
ap-490	52	32	simply	simply	ADV
ap-490	52	33	the	the	DET
ap-490	52	34	static	static	ADJ
ap-490	52	35	level	level	NOUN
ap-490	52	36	(	(	PUNCT
ap-490	52	37	sl	sl	NOUN
ap-490	52	38	)	)	PUNCT
ap-490	52	39	.	.	PUNCT
ap-490	53	1	the	the	DET
ap-490	53	2	sl	sl	NOUN
ap-490	53	3	can	can	AUX
ap-490	53	4	be	be	AUX
ap-490	53	5	computed	compute	VERB
ap-490	53	6	recursively	recursively	ADV
ap-490	53	7	by	by	ADP
ap-490	53	8	traversing	traverse	VERB
ap-490	53	9	the	the	DET
ap-490	53	10	dag	dag	PROPN
ap-490	53	11	upward	upward	ADV
ap-490	53	12	starting	start	VERB
ap-490	53	13	from	from	ADP
ap-490	53	14	the	the	DET
ap-490	53	15	exit	exit	NOUN
ap-490	53	16	node	node	NOUN
ap-490	53	17	vexit	vexit	NOUN
ap-490	53	18	as	as	SCONJ
ap-490	53	19	follows	follow	VERB
ap-490	53	20	:	:	PUNCT
ap-490	53	21	�	�	PROPN
ap-490	53	22	�	�	PROPN
ap-490	53	23	�	�	PROPN
ap-490	53	24	�	�	PROPN
ap-490	53	25	sl	sl	VERB
ap-490	53	26	v	v	NUM
ap-490	53	27	w	w	PROPN
ap-490	54	1	sl	sl	INTJ
ap-490	55	1	vi	vi	INTJ
ap-490	56	1	i	i	PRON
ap-490	56	2	v	v	X
ap-490	56	3	succ	succ	PROPN
ap-490	56	4	v	v	NOUN
ap-490	56	5	m	m	NOUN
ap-490	56	6	m	m	VERB
ap-490	56	7	i	i	PRON
ap-490	56	8	�	�	PROPN
ap-490	56	9	�	�	PROPN
ap-490	56	10	�	�	PROPN
ap-490	56	11	max	max	PROPN
ap-490	56	12	(	(	PUNCT
ap-490	56	13	)	)	PUNCT
ap-490	56	14	,	,	PUNCT
ap-490	56	15	where	where	SCONJ
ap-490	56	16	succ(vi	succ(vi	PROPN
ap-490	56	17	)	)	PUNCT
ap-490	56	18	is	be	AUX
ap-490	56	19	the	the	DET
ap-490	56	20	set	set	NOUN
ap-490	56	21	of	of	ADP
ap-490	56	22	immediate	immediate	ADJ
ap-490	56	23	successors	successor	NOUN
ap-490	56	24	of	of	ADP
ap-490	56	25	vi	vi	PROPN
ap-490	56	26	and	and	CCONJ
ap-490	56	27	�	�	PROPN
ap-490	56	28	�	�	PROPN
ap-490	56	29	�	�	PROPN
ap-490	56	30	�	�	PROPN
ap-490	56	31	sl	sl	NOUN
ap-490	56	32	v	v	NUM
ap-490	56	33	w	w	PROPN
ap-490	56	34	vexit	vexit	NOUN
ap-490	56	35	exit	exit	NOUN
ap-490	56	36	�	�	PROPN
ap-490	56	37	.	.	PUNCT
ap-490	57	1	two	two	NUM
ap-490	57	2	other	other	ADJ
ap-490	57	3	attributes	attribute	NOUN
ap-490	57	4	are	be	AUX
ap-490	57	5	also	also	ADV
ap-490	57	6	used	use	VERB
ap-490	57	7	to	to	PART
ap-490	57	8	assign	assign	VERB
ap-490	57	9	priority	priority	NOUN
ap-490	57	10	to	to	ADP
ap-490	57	11	the	the	DET
ap-490	57	12	nodes	node	NOUN
ap-490	57	13	:	:	PUNCT
ap-490	57	14	est	est	X
ap-490	57	15	(	(	PUNCT
ap-490	57	16	earliest	early	ADJ
ap-490	57	17	start	start	VERB
ap-490	57	18	time	time	NOUN
ap-490	57	19	)	)	PUNCT
ap-490	57	20	,	,	PUNCT
ap-490	57	21	also	also	ADV
ap-490	57	22	called	call	VERB
ap-490	57	23	asap	asap	NOUN
ap-490	57	24	(	(	PUNCT
ap-490	57	25	as	as	ADV
ap-490	57	26	soon	soon	ADV
ap-490	57	27	as	as	ADP
ap-490	57	28	possible	possible	ADJ
ap-490	57	29	)	)	PUNCT
ap-490	57	30	,	,	PUNCT
ap-490	57	31	and	and	CCONJ
ap-490	57	32	lst	lst	INTJ
ap-490	57	33	(	(	PUNCT
ap-490	57	34	latest	late	ADJ
ap-490	57	35	start	start	VERB
ap-490	57	36	time	time	NOUN
ap-490	57	37	)	)	PUNCT
ap-490	57	38	,	,	PUNCT
ap-490	57	39	also	also	ADV
ap-490	57	40	called	call	VERB
ap-490	57	41	alap	alap	PROPN
ap-490	57	42	(	(	PUNCT
ap-490	57	43	as	as	ADV
ap-490	57	44	late	late	ADV
ap-490	57	45	as	as	ADP
ap-490	57	46	possible	possible	ADJ
ap-490	57	47	)	)	PUNCT
ap-490	57	48	.	.	PUNCT
ap-490	58	1	the	the	DET
ap-490	58	2	est(vi	est(vi	NOUN
ap-490	58	3	)	)	PUNCT
ap-490	58	4	of	of	ADP
ap-490	58	5	vi	vi	PROPN
ap-490	58	6	is	be	AUX
ap-490	58	7	highly	highly	ADV
ap-490	58	8	correlated	correlate	VERB
ap-490	58	9	with	with	ADP
ap-490	58	10	the	the	DET
ap-490	58	11	t	t	PROPN
ap-490	58	12	level	level	NOUN
ap-490	58	13	�	�	PROPN
ap-490	58	14	of	of	ADP
ap-490	58	15	vi	vi	PROPN
ap-490	58	16	and	and	CCONJ
ap-490	58	17	the	the	DET
ap-490	58	18	procedure	procedure	NOUN
ap-490	58	19	for	for	ADP
ap-490	58	20	computing	compute	VERB
ap-490	58	21	the	the	DET
ap-490	58	22	t	t	PROPN
ap-490	58	23	level	level	NOUN
ap-490	58	24	�	�	PROPN
ap-490	58	25	can	can	AUX
ap-490	58	26	be	be	AUX
ap-490	58	27	used	use	VERB
ap-490	58	28	to	to	PART
ap-490	58	29	compute	compute	VERB
ap-490	58	30	the	the	DET
ap-490	58	31	nodes	node	NOUN
ap-490	58	32	earliest	early	ADJ
ap-490	58	33	start	start	PROPN
ap-490	58	34	times	time	NOUN
ap-490	58	35	.	.	PUNCT
ap-490	59	1	the	the	DET
ap-490	59	2	est	est	NOUN
ap-490	59	3	can	can	AUX
ap-490	59	4	be	be	AUX
ap-490	59	5	computed	compute	VERB
ap-490	59	6	recursively	recursively	ADV
ap-490	59	7	by	by	ADP
ap-490	59	8	traversing	traverse	VERB
ap-490	59	9	the	the	DET
ap-490	59	10	dag	dag	PROPN
ap-490	59	11	downward	downward	ADV
ap-490	59	12	starting	start	VERB
ap-490	59	13	from	from	ADP
ap-490	59	14	the	the	DET
ap-490	59	15	entry	entry	NOUN
ap-490	59	16	node	node	NOUN
ap-490	59	17	vexit	vexit	NOUN
ap-490	59	18	as	as	SCONJ
ap-490	59	19	follows	follow	VERB
ap-490	59	20	:	:	PUNCT
ap-490	59	21	�	�	PROPN
ap-490	59	22	�	�	PROPN
ap-490	59	23	�	�	PROPN
ap-490	59	24	�	�	PROPN
ap-490	59	25	est	est	X
ap-490	59	26	v	v	X
ap-490	59	27	est	est	X
ap-490	59	28	v	v	ADP
ap-490	59	29	w	w	PROPN
ap-490	59	30	ci	ci	PROPN
ap-490	59	31	v	v	PROPN
ap-490	59	32	pred	pre	VERB
ap-490	59	33	v	v	NUM
ap-490	59	34	m	m	NOUN
ap-490	59	35	m	m	VERB
ap-490	59	36	m	m	VERB
ap-490	59	37	i	i	PRON
ap-490	59	38	m	m	VERB
ap-490	60	1	i	i	PRON
ap-490	60	2	�	�	PROPN
ap-490	60	3	�	�	PROPN
ap-490	60	4	�	�	PROPN
ap-490	60	5	�	�	PROPN
ap-490	60	6	max	max	PROPN
ap-490	60	7	(	(	PUNCT
ap-490	60	8	)	)	PUNCT
ap-490	60	9	,	,	PUNCT
ap-490	60	10	,	,	PUNCT
ap-490	60	11	where	where	SCONJ
ap-490	60	12	pred	pred	PROPN
ap-490	60	13	vi	vi	PROPN
ap-490	60	14	(	(	PUNCT
ap-490	60	15	)	)	PUNCT
ap-490	60	16	is	be	AUX
ap-490	60	17	the	the	DET
ap-490	60	18	set	set	NOUN
ap-490	60	19	of	of	ADP
ap-490	60	20	immediate	immediate	ADJ
ap-490	60	21	predecessors	predecessor	NOUN
ap-490	60	22	of	of	ADP
ap-490	60	23	vi	vi	PROPN
ap-490	60	24	and	and	CCONJ
ap-490	60	25	est	est	PROPN
ap-490	60	26	ventry	ventry	PROPN
ap-490	60	27	(	(	PUNCT
ap-490	60	28	)	)	PUNCT
ap-490	60	29	�	�	PROPN
ap-490	60	30	0	0	NUM
ap-490	60	31	.	.	PUNCT
ap-490	61	1	the	the	DET
ap-490	61	2	lst	lst	NOUN
ap-490	61	3	can	can	AUX
ap-490	61	4	be	be	AUX
ap-490	61	5	computed	compute	VERB
ap-490	61	6	recursively	recursively	ADV
ap-490	61	7	by	by	ADP
ap-490	61	8	traversing	traverse	VERB
ap-490	61	9	the	the	DET
ap-490	61	10	dag	dag	PROPN
ap-490	61	11	upward	upward	ADV
ap-490	61	12	,	,	PUNCT
ap-490	61	13	starting	start	VERB
ap-490	61	14	from	from	ADP
ap-490	61	15	the	the	DET
ap-490	61	16	exit	exit	NOUN
ap-490	61	17	node	node	NOUN
ap-490	61	18	vexit	vexit	NOUN
ap-490	61	19	,	,	PUNCT
ap-490	61	20	as	as	SCONJ
ap-490	61	21	follows	follow	VERB
ap-490	61	22	:	:	PUNCT
ap-490	61	23	�	�	PROPN
ap-490	61	24	�	�	PROPN
ap-490	61	25	�	�	PROPN
ap-490	61	26	�	�	PROPN
ap-490	61	27	lst	lst	VERB
ap-490	61	28	v	v	PART
ap-490	61	29	lst	lst	NOUN
ap-490	61	30	v	v	ADP
ap-490	61	31	c	c	PROPN
ap-490	61	32	wi	wi	PROPN
ap-490	61	33	v	v	PROPN
ap-490	61	34	succ	succ	PROPN
ap-490	61	35	v	v	INTJ
ap-490	61	36	m	m	PROPN
ap-490	62	1	i	i	PRON
ap-490	62	2	m	m	VERB
ap-490	63	1	i	i	PRON
ap-490	63	2	m	m	VERB
ap-490	63	3	i	i	PRON
ap-490	63	4	�	�	PROPN
ap-490	63	5	�	�	PROPN
ap-490	63	6	�	�	PROPN
ap-490	63	7	�	�	PROPN
ap-490	63	8	min	min	PROPN
ap-490	63	9	(	(	PUNCT
ap-490	63	10	)	)	PUNCT
ap-490	63	11	,	,	PUNCT
ap-490	63	12	,	,	PUNCT
ap-490	63	13	where	where	SCONJ
ap-490	63	14	succ(vi	succ(vi	PROPN
ap-490	63	15	)	)	PUNCT
ap-490	63	16	is	be	AUX
ap-490	63	17	the	the	DET
ap-490	63	18	set	set	NOUN
ap-490	63	19	of	of	ADP
ap-490	63	20	immediate	immediate	ADJ
ap-490	63	21	successors	successor	NOUN
ap-490	63	22	of	of	ADP
ap-490	63	23	vi	vi	PROPN
ap-490	63	24	and	and	CCONJ
ap-490	63	25	lst	lst	X
ap-490	63	26	v	v	X
ap-490	63	27	est	est	X
ap-490	63	28	vexit	vexit	NOUN
ap-490	63	29	exit	exit	NOUN
ap-490	63	30	(	(	PUNCT
ap-490	63	31	)	)	PUNCT
ap-490	63	32	(	(	PUNCT
ap-490	63	33	)	)	PUNCT
ap-490	63	34	�	�	PROPN
ap-490	63	35	.	.	PUNCT
ap-490	64	1	the	the	DET
ap-490	64	2	critical	critical	ADJ
ap-490	64	3	path	path	NOUN
ap-490	64	4	(	(	PUNCT
ap-490	64	5	cp	cp	NOUN
ap-490	64	6	)	)	PUNCT
ap-490	64	7	of	of	ADP
ap-490	64	8	a	a	DET
ap-490	64	9	dag	dag	PROPN
ap-490	64	10	is	be	AUX
ap-490	64	11	the	the	DET
ap-490	64	12	longest	long	ADJ
ap-490	64	13	path	path	NOUN
ap-490	64	14	from	from	ADP
ap-490	64	15	the	the	DET
ap-490	64	16	entry	entry	NOUN
ap-490	64	17	node	node	NOUN
ap-490	64	18	to	to	ADP
ap-490	64	19	the	the	DET
ap-490	64	20	exit	exit	NOUN
ap-490	64	21	node	node	NOUN
ap-490	64	22	.	.	PUNCT
ap-490	65	1	clearly	clearly	ADV
ap-490	65	2	a	a	DET
ap-490	65	3	dag	dag	PROPN
ap-490	65	4	can	can	AUX
ap-490	65	5	have	have	VERB
ap-490	65	6	more	more	ADJ
ap-490	65	7	than	than	ADP
ap-490	65	8	one	one	NUM
ap-490	65	9	cp	cp	NOUN
ap-490	65	10	.	.	PROPN
ap-490	66	1	consider	consider	VERB
ap-490	66	2	the	the	DET
ap-490	66	3	dag	dag	PROPN
ap-490	66	4	shown	show	VERB
ap-490	66	5	in	in	ADP
ap-490	66	6	fig	fig	NOUN
ap-490	66	7	.	.	PUNCT
ap-490	67	1	1	1	NUM
ap-490	67	2	,	,	PUNCT
ap-490	67	3	where	where	SCONJ
ap-490	67	4	each	each	DET
ap-490	67	5	node	node	NOUN
ap-490	67	6	has	have	VERB
ap-490	67	7	two	two	NUM
ap-490	67	8	labels	label	NOUN
ap-490	67	9	,	,	PUNCT
ap-490	67	10	the	the	DET
ap-490	67	11	upper	upper	ADJ
ap-490	67	12	one	one	NOUN
ap-490	67	13	is	be	AUX
ap-490	67	14	indicating	indicate	VERB
ap-490	67	15	the	the	DET
ap-490	67	16	node	node	ADJ
ap-490	67	17	label	label	NOUN
ap-490	67	18	and	and	CCONJ
ap-490	67	19	the	the	DET
ap-490	67	20	lower	low	ADJ
ap-490	67	21	one	one	NOUN
ap-490	67	22	is	be	AUX
ap-490	67	23	indicating	indicate	VERB
ap-490	67	24	the	the	DET
ap-490	67	25	node	node	ADJ
ap-490	67	26	weight	weight	NOUN
ap-490	67	27	.	.	PUNCT
ap-490	68	1	in	in	ADP
ap-490	68	2	this	this	DET
ap-490	68	3	dag	dag	NOUN
ap-490	68	4	,	,	PUNCT
ap-490	68	5	the	the	DET
ap-490	68	6	nodes	node	NOUN
ap-490	68	7	v1	v1	NOUN
ap-490	68	8	,	,	PUNCT
ap-490	68	9	v2	v2	PROPN
ap-490	68	10	,	,	PUNCT
ap-490	68	11	v9	v9	PROPN
ap-490	68	12	,	,	PUNCT
ap-490	68	13	v10	v10	NOUN
ap-490	68	14	are	be	AUX
ap-490	68	15	the	the	DET
ap-490	68	16	cp	cp	PROPN
ap-490	68	17	nodes	node	NOUN
ap-490	68	18	and	and	CCONJ
ap-490	68	19	are	be	AUX
ap-490	68	20	called	call	VERB
ap-490	68	21	cpns	cpns	ADJ
ap-490	68	22	(	(	PUNCT
ap-490	68	23	critical	critical	ADJ
ap-490	68	24	path	path	NOUN
ap-490	68	25	nodes	node	NOUN
ap-490	68	26	)	)	PUNCT
ap-490	68	27	.	.	PUNCT
ap-490	69	1	the	the	DET
ap-490	69	2	edges	edge	NOUN
ap-490	69	3	on	on	ADP
ap-490	69	4	the	the	DET
ap-490	69	5	cp	cp	PROPN
ap-490	69	6	are	be	AUX
ap-490	69	7	shown	show	VERB
ap-490	69	8	by	by	ADP
ap-490	69	9	thick	thick	ADJ
ap-490	69	10	arrows	arrow	NOUN
ap-490	69	11	.	.	PUNCT
ap-490	70	1	the	the	DET
ap-490	70	2	values	value	NOUN
ap-490	70	3	of	of	ADP
ap-490	70	4	the	the	DET
ap-490	70	5	priorities	priority	NOUN
ap-490	70	6	discussed	discuss	VERB
ap-490	70	7	above	above	ADV
ap-490	70	8	are	be	AUX
ap-490	70	9	shown	show	VERB
ap-490	70	10	in	in	ADP
ap-490	70	11	table	table	NOUN
ap-490	70	12	1	1	NUM
ap-490	70	13	.	.	PUNCT
ap-490	71	1	©	©	PROPN
ap-490	71	2	czech	czech	PROPN
ap-490	71	3	technical	technical	PROPN
ap-490	71	4	university	university	PROPN
ap-490	71	5	publishing	publishing	NOUN
ap-490	71	6	house	house	NOUN
ap-490	71	7	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-490	71	8	17	17	NUM
ap-490	71	9	acta	acta	PROPN
ap-490	71	10	polytechnica	polytechnica	PROPN
ap-490	71	11	vol	vol	NOUN
ap-490	71	12	.	.	PUNCT
ap-490	72	1	43	43	NUM
ap-490	72	2	no	no	NOUN
ap-490	72	3	.	.	PUNCT
ap-490	73	1	6/2003	6/2003	NUM
ap-490	73	2	fig	fig	NOUN
ap-490	73	3	.	.	PUNCT
ap-490	74	1	1	1	NUM
ap-490	74	2	:	:	PUNCT
ap-490	74	3	application	application	NOUN
ap-490	74	4	directed	direct	VERB
ap-490	74	5	acyclic	acyclic	ADJ
ap-490	74	6	graph	graph	NOUN
ap-490	74	7	(	(	PUNCT
ap-490	74	8	dag	dag	PROPN
ap-490	74	9	)	)	PUNCT
ap-490	74	10	node	node	NOUN
ap-490	74	11	sl	sl	PROPN
ap-490	74	12	t	t	PROPN
ap-490	74	13	�	�	PROPN
ap-490	74	14	level	level	PROPN
ap-490	74	15	&	&	CCONJ
ap-490	74	16	est	est	PROPN
ap-490	74	17	b	b	PROPN
ap-490	74	18	�	�	PROPN
ap-490	74	19	level	level	NOUN
ap-490	74	20	lst	lst	VERB
ap-490	74	21	1	1	NUM
ap-490	74	22	80	80	NUM
ap-490	74	23	0	0	NUM
ap-490	75	1	104	104	NUM
ap-490	75	2	0	0	NUM
ap-490	75	3	2	2	NUM
ap-490	75	4	60	60	NUM
ap-490	75	5	28	28	NUM
ap-490	75	6	76	76	NUM
ap-490	75	7	28	28	NUM
ap-490	75	8	3	3	NUM
ap-490	75	9	50	50	NUM
ap-490	75	10	24	24	NUM
ap-490	75	11	60	60	NUM
ap-490	75	12	44	44	NUM
ap-490	75	13	4	4	NUM
ap-490	75	14	55	55	NUM
ap-490	75	15	22	22	NUM
ap-490	75	16	65	65	NUM
ap-490	75	17	39	39	NUM
ap-490	75	18	5	5	NUM
ap-490	75	19	45	45	NUM
ap-490	75	20	28	28	NUM
ap-490	75	21	61	61	NUM
ap-490	75	22	43	43	NUM
ap-490	75	23	6	6	NUM
ap-490	75	24	40	40	NUM
ap-490	75	25	24	24	NUM
ap-490	75	26	52	52	NUM
ap-490	75	27	52	52	NUM
ap-490	75	28	7	7	NUM
ap-490	75	29	30	30	NUM
ap-490	75	30	52	52	NUM
ap-490	75	31	32	32	NUM
ap-490	75	32	72	72	NUM
ap-490	75	33	8	8	NUM
ap-490	75	34	35	35	NUM
ap-490	75	35	52	52	NUM
ap-490	75	36	39	39	NUM
ap-490	75	37	65	65	NUM
ap-490	75	38	9	9	NUM
ap-490	75	39	40	40	NUM
ap-490	75	40	56	56	NUM
ap-490	75	41	48	48	NUM
ap-490	75	42	56	56	NUM
ap-490	75	43	10	10	NUM
ap-490	75	44	20	20	NUM
ap-490	75	45	84	84	NUM
ap-490	75	46	20	20	NUM
ap-490	75	47	84	84	NUM
ap-490	75	48	table	table	NOUN
ap-490	75	49	1	1	NUM
ap-490	75	50	:	:	PUNCT
ap-490	75	51	priority	priority	NOUN
ap-490	75	52	attributes	attribute	VERB
ap-490	75	53	3	3	NUM
ap-490	75	54	list	list	NOUN
ap-490	75	55	-	-	PUNCT
ap-490	75	56	scheduling	scheduling	NOUN
ap-490	75	57	algorithms	algorithm	NOUN
ap-490	75	58	this	this	DET
ap-490	75	59	section	section	NOUN
ap-490	75	60	presents	present	VERB
ap-490	75	61	the	the	DET
ap-490	75	62	two	two	NUM
ap-490	75	63	main	main	ADJ
ap-490	75	64	static	static	ADJ
ap-490	75	65	list	list	NOUN
ap-490	75	66	-	-	PUNCT
ap-490	75	67	scheduling	schedule	VERB
ap-490	75	68	algorithms	algorithm	NOUN
ap-490	75	69	and	and	CCONJ
ap-490	75	70	the	the	DET
ap-490	75	71	two	two	NUM
ap-490	75	72	main	main	ADJ
ap-490	75	73	dynamic	dynamic	ADJ
ap-490	75	74	list	list	NOUN
ap-490	75	75	-	-	PUNCT
ap-490	75	76	scheduling	scheduling	NOUN
ap-490	75	77	algorithms	algorithm	NOUN
ap-490	75	78	.	.	PUNCT
ap-490	76	1	all	all	DET
ap-490	76	2	these	these	DET
ap-490	76	3	algorithms	algorithm	NOUN
ap-490	76	4	are	be	AUX
ap-490	76	5	for	for	ADP
ap-490	76	6	a	a	DET
ap-490	76	7	limited	limited	ADJ
ap-490	76	8	number	number	NOUN
ap-490	76	9	of	of	ADP
ap-490	76	10	homogeneous	homogeneous	ADJ
ap-490	76	11	processors	processor	NOUN
ap-490	76	12	.	.	PUNCT
ap-490	77	1	3.1	3.1	NUM
ap-490	77	2	static	static	ADJ
ap-490	77	3	list	list	NOUN
ap-490	77	4	-	-	PUNCT
ap-490	77	5	scheduling	schedule	VERB
ap-490	77	6	algorithms	algorithm	NOUN
ap-490	77	7	this	this	DET
ap-490	77	8	section	section	NOUN
ap-490	77	9	briefly	briefly	NOUN
ap-490	77	10	reviews	review	VERB
ap-490	77	11	the	the	DET
ap-490	77	12	two	two	NUM
ap-490	77	13	main	main	ADJ
ap-490	77	14	static	static	ADJ
ap-490	77	15	list	list	NOUN
ap-490	77	16	-	-	PUNCT
ap-490	77	17	scheduling	scheduling	NOUN
ap-490	77	18	algorithms	algorithm	NOUN
ap-490	77	19	,	,	PUNCT
ap-490	77	20	which	which	PRON
ap-490	77	21	are	be	AUX
ap-490	77	22	the	the	DET
ap-490	77	23	highest	high	ADJ
ap-490	77	24	level	level	NOUN
ap-490	77	25	first	first	ADV
ap-490	77	26	with	with	ADP
ap-490	77	27	estimated	estimate	VERB
ap-490	77	28	time	time	NOUN
ap-490	77	29	(	(	PUNCT
ap-490	77	30	hlfet	hlfet	NOUN
ap-490	77	31	)	)	PUNCT
ap-490	77	32	algorithm	algorithm	NOUN
ap-490	78	1	[	[	X
ap-490	78	2	2	2	NUM
ap-490	78	3	]	]	PUNCT
ap-490	78	4	and	and	CCONJ
ap-490	78	5	the	the	DET
ap-490	78	6	modified	modified	ADJ
ap-490	78	7	critical	critical	ADJ
ap-490	78	8	path	path	NOUN
ap-490	78	9	(	(	PUNCT
ap-490	78	10	mcp	mcp	PROPN
ap-490	78	11	)	)	PUNCT
ap-490	78	12	algorithm	algorithm	NOUN
ap-490	79	1	[	[	X
ap-490	79	2	8	8	NUM
ap-490	79	3	]	]	PUNCT
ap-490	79	4	.	.	PUNCT
ap-490	80	1	3.1.1	3.1.1	NUM
ap-490	80	2	hlfet	hlfet	NOUN
ap-490	80	3	algorithm	algorithm	NOUN
ap-490	80	4	the	the	DET
ap-490	80	5	highest	high	ADJ
ap-490	80	6	level	level	NOUN
ap-490	80	7	first	first	ADV
ap-490	80	8	with	with	ADP
ap-490	80	9	estimated	estimate	VERB
ap-490	80	10	time	time	NOUN
ap-490	80	11	(	(	PUNCT
ap-490	80	12	hlfet	hlfet	NOUN
ap-490	80	13	)	)	PUNCT
ap-490	80	14	algorithms	algorithm	NOUN
ap-490	80	15	[	[	X
ap-490	80	16	2	2	X
ap-490	80	17	]	]	PUNCT
ap-490	80	18	is	be	AUX
ap-490	80	19	one	one	NUM
ap-490	80	20	of	of	ADP
ap-490	80	21	the	the	DET
ap-490	80	22	simplest	simple	ADJ
ap-490	80	23	list	list	NOUN
ap-490	80	24	-	-	PUNCT
ap-490	80	25	scheduling	schedule	VERB
ap-490	80	26	algorithms	algorithm	NOUN
ap-490	80	27	and	and	CCONJ
ap-490	80	28	is	be	AUX
ap-490	80	29	described	describe	VERB
ap-490	80	30	as	as	SCONJ
ap-490	80	31	follows	follow	VERB
ap-490	80	32	in	in	ADP
ap-490	80	33	fig	fig	NOUN
ap-490	80	34	.	.	PUNCT
ap-490	81	1	2	2	X
ap-490	81	2	.	.	X
ap-490	81	3	the	the	DET
ap-490	81	4	complexity	complexity	NOUN
ap-490	81	5	of	of	ADP
ap-490	81	6	the	the	DET
ap-490	81	7	hlfet	hlfet	NOUN
ap-490	81	8	algorithm	algorithm	NOUN
ap-490	81	9	is	be	AUX
ap-490	81	10	o(pv2	o(pv2	NOUN
ap-490	81	11	)	)	PUNCT
ap-490	81	12	.	.	PUNCT
ap-490	82	1	for	for	ADP
ap-490	82	2	the	the	DET
ap-490	82	3	dag	dag	PROPN
ap-490	82	4	shown	show	VERB
ap-490	82	5	in	in	ADP
ap-490	82	6	fig	fig	NOUN
ap-490	82	7	.	.	PUNCT
ap-490	83	1	1	1	NUM
ap-490	83	2	,	,	PUNCT
ap-490	83	3	the	the	DET
ap-490	83	4	scheduling	scheduling	NOUN
ap-490	83	5	trace	trace	NOUN
ap-490	83	6	of	of	ADP
ap-490	83	7	hlfet	hlfet	NOUN
ap-490	83	8	algorithm	algorithm	NOUN
ap-490	83	9	is	be	AUX
ap-490	83	10	given	give	VERB
ap-490	83	11	in	in	ADP
ap-490	83	12	table	table	NOUN
ap-490	83	13	2	2	NUM
ap-490	83	14	.	.	PUNCT
ap-490	84	1	in	in	ADP
ap-490	84	2	the	the	DET
ap-490	84	3	table	table	NOUN
ap-490	84	4	,	,	PUNCT
ap-490	84	5	the	the	DET
ap-490	84	6	execution	execution	NOUN
ap-490	84	7	start	start	VERB
ap-490	84	8	times	time	NOUN
ap-490	84	9	of	of	ADP
ap-490	84	10	each	each	DET
ap-490	84	11	node	node	NOUN
ap-490	84	12	on	on	ADP
ap-490	84	13	all	all	DET
ap-490	84	14	available	available	ADJ
ap-490	84	15	processors	processor	NOUN
ap-490	84	16	at	at	ADP
ap-490	84	17	each	each	DET
ap-490	84	18	step	step	NOUN
ap-490	84	19	are	be	AUX
ap-490	84	20	given	give	VERB
ap-490	84	21	,	,	PUNCT
ap-490	84	22	and	and	CCONJ
ap-490	84	23	the	the	DET
ap-490	84	24	nodes	node	NOUN
ap-490	84	25	on	on	ADP
ap-490	84	26	the	the	DET
ap-490	84	27	list	list	NOUN
ap-490	84	28	are	be	AUX
ap-490	84	29	scheduled	schedule	VERB
ap-490	84	30	one	one	NUM
ap-490	84	31	by	by	ADP
ap-490	84	32	one	one	NUM
ap-490	84	33	,	,	PUNCT
ap-490	84	34	to	to	ADP
ap-490	84	35	the	the	DET
ap-490	84	36	processor	processor	NOUN
ap-490	84	37	that	that	PRON
ap-490	84	38	allows	allow	VERB
ap-490	84	39	the	the	DET
ap-490	84	40	earliest	early	ADJ
ap-490	84	41	execution	execution	NOUN
ap-490	84	42	start	start	VERB
ap-490	84	43	time	time	NOUN
ap-490	84	44	.	.	PUNCT
ap-490	85	1	3.1.2	3.1.2	NUM
ap-490	85	2	mcp	mcp	PROPN
ap-490	85	3	algorithm	algorithm	NOUN
ap-490	85	4	the	the	DET
ap-490	85	5	modified	modified	ADJ
ap-490	85	6	critical	critical	ADJ
ap-490	85	7	path	path	NOUN
ap-490	85	8	(	(	PUNCT
ap-490	85	9	mcp	mcp	PROPN
ap-490	85	10	)	)	PUNCT
ap-490	85	11	algorithm	algorithm	NOUN
ap-490	86	1	[	[	X
ap-490	86	2	8	8	NUM
ap-490	86	3	]	]	PUNCT
ap-490	86	4	uses	use	VERB
ap-490	86	5	the	the	DET
ap-490	86	6	alap	alap	PROPN
ap-490	86	7	attribute	attribute	NOUN
ap-490	86	8	(	(	PUNCT
ap-490	86	9	lst	lst	INTJ
ap-490	86	10	defined	define	VERB
ap-490	86	11	in	in	ADP
ap-490	86	12	section	section	NOUN
ap-490	86	13	2	2	NUM
ap-490	86	14	)	)	PUNCT
ap-490	86	15	of	of	ADP
ap-490	86	16	a	a	DET
ap-490	86	17	node	node	NOUN
ap-490	86	18	as	as	ADP
ap-490	86	19	the	the	DET
ap-490	86	20	scheduling	scheduling	NOUN
ap-490	86	21	priority	priority	NOUN
ap-490	86	22	.	.	PUNCT
ap-490	87	1	the	the	DET
ap-490	87	2	mcp	mcp	PROPN
ap-490	87	3	algorithm	algorithm	PROPN
ap-490	87	4	first	first	ADV
ap-490	87	5	computes	compute	VERB
ap-490	87	6	the	the	DET
ap-490	87	7	alaps	alap	NOUN
ap-490	87	8	of	of	ADP
ap-490	87	9	all	all	DET
ap-490	87	10	nodes	node	NOUN
ap-490	87	11	,	,	PUNCT
ap-490	87	12	and	and	CCONJ
ap-490	87	13	then	then	ADV
ap-490	87	14	constructs	construct	VERB
ap-490	87	15	a	a	DET
ap-490	87	16	list	list	NOUN
ap-490	87	17	of	of	ADP
ap-490	87	18	nodes	node	NOUN
ap-490	87	19	in	in	ADP
ap-490	87	20	ascending	ascend	VERB
ap-490	87	21	order	order	NOUN
ap-490	87	22	of	of	ADP
ap-490	87	23	nodes	node	NOUN
ap-490	87	24	alap	alap	ADJ
ap-490	87	25	.	.	PUNCT
ap-490	88	1	in	in	ADP
ap-490	88	2	the	the	DET
ap-490	88	3	case	case	NOUN
ap-490	88	4	of	of	ADP
ap-490	88	5	equivalent	equivalent	ADJ
ap-490	88	6	alap	alap	NOUN
ap-490	88	7	values	value	NOUN
ap-490	88	8	,	,	PUNCT
ap-490	88	9	the	the	DET
ap-490	88	10	alaps	alap	NOUN
ap-490	88	11	of	of	ADP
ap-490	88	12	the	the	DET
ap-490	88	13	children	child	NOUN
ap-490	88	14	are	be	AUX
ap-490	88	15	taken	take	VERB
ap-490	88	16	into	into	ADP
ap-490	88	17	consideration	consideration	NOUN
ap-490	88	18	to	to	PART
ap-490	88	19	break	break	VERB
ap-490	88	20	the	the	DET
ap-490	88	21	tie	tie	NOUN
ap-490	88	22	.	.	PUNCT
ap-490	89	1	the	the	DET
ap-490	89	2	mcp	mcp	PROPN
ap-490	89	3	algorithm	algorithm	NOUN
ap-490	89	4	then	then	ADV
ap-490	89	5	schedules	schedule	VERB
ap-490	89	6	the	the	DET
ap-490	89	7	nodes	node	NOUN
ap-490	89	8	on	on	ADP
ap-490	89	9	the	the	DET
ap-490	89	10	list	list	NOUN
ap-490	89	11	one	one	NUM
ap-490	89	12	by	by	ADP
ap-490	89	13	one	one	NUM
ap-490	89	14	such	such	ADJ
ap-490	89	15	that	that	SCONJ
ap-490	89	16	a	a	DET
ap-490	89	17	node	node	NOUN
ap-490	89	18	is	be	AUX
ap-490	89	19	scheduled	schedule	VERB
ap-490	89	20	to	to	ADP
ap-490	89	21	the	the	DET
ap-490	89	22	processor	processor	NOUN
ap-490	89	23	that	that	PRON
ap-490	89	24	allows	allow	VERB
ap-490	89	25	the	the	DET
ap-490	89	26	earliest	early	ADJ
ap-490	89	27	execution	execution	NOUN
ap-490	89	28	start	start	VERB
ap-490	89	29	time	time	NOUN
ap-490	89	30	.	.	PUNCT
ap-490	90	1	the	the	DET
ap-490	90	2	mcp	mcp	PROPN
ap-490	90	3	algorithm	algorithm	PROPN
ap-490	90	4	is	be	AUX
ap-490	90	5	shown	show	VERB
ap-490	90	6	in	in	ADP
ap-490	90	7	fig	fig	NOUN
ap-490	90	8	.	.	PUNCT
ap-490	91	1	3	3	X
ap-490	91	2	.	.	X
ap-490	91	3	the	the	DET
ap-490	91	4	complexity	complexity	NOUN
ap-490	91	5	of	of	ADP
ap-490	91	6	the	the	DET
ap-490	91	7	mcp	mcp	PROPN
ap-490	91	8	algorithm	algorithm	NOUN
ap-490	91	9	is	be	AUX
ap-490	91	10	o(pv2	o(pv2	NOUN
ap-490	91	11	)	)	PUNCT
ap-490	91	12	.	.	PUNCT
ap-490	92	1	for	for	ADP
ap-490	92	2	the	the	DET
ap-490	92	3	dag	dag	PROPN
ap-490	92	4	shown	show	VERB
ap-490	92	5	in	in	ADP
ap-490	92	6	fig	fig	NOUN
ap-490	92	7	.	.	PUNCT
ap-490	93	1	1	1	NUM
ap-490	93	2	,	,	PUNCT
ap-490	93	3	the	the	DET
ap-490	93	4	scheduling	scheduling	NOUN
ap-490	93	5	trace	trace	NOUN
ap-490	93	6	of	of	ADP
ap-490	93	7	mcp	mcp	PROPN
ap-490	93	8	algorithm	algorithm	NOUN
ap-490	93	9	is	be	AUX
ap-490	93	10	given	give	VERB
ap-490	93	11	in	in	ADP
ap-490	93	12	table	table	NOUN
ap-490	93	13	3	3	NUM
ap-490	93	14	.	.	NOUN
ap-490	93	15	3.2	3.2	NUM
ap-490	93	16	dynamic	dynamic	ADJ
ap-490	93	17	list	list	NOUN
ap-490	93	18	-	-	PUNCT
ap-490	93	19	scheduling	schedule	VERB
ap-490	93	20	algorithms	algorithm	NOUN
ap-490	93	21	this	this	DET
ap-490	93	22	section	section	NOUN
ap-490	93	23	briefly	briefly	NOUN
ap-490	93	24	reviews	review	VERB
ap-490	93	25	the	the	DET
ap-490	93	26	two	two	NUM
ap-490	93	27	main	main	ADJ
ap-490	93	28	dynamic	dynamic	ADJ
ap-490	93	29	list	list	NOUN
ap-490	93	30	-	-	PUNCT
ap-490	93	31	scheduling	scheduling	NOUN
ap-490	93	32	algorithms	algorithm	NOUN
ap-490	93	33	,	,	PUNCT
ap-490	93	34	which	which	PRON
ap-490	93	35	are	be	AUX
ap-490	93	36	the	the	DET
ap-490	93	37	earliest	early	ADJ
ap-490	93	38	time	time	NOUN
ap-490	93	39	first	first	ADV
ap-490	93	40	(	(	PUNCT
ap-490	93	41	etf	etf	NOUN
ap-490	93	42	)	)	PUNCT
ap-490	93	43	algorithm	algorithm	NOUN
ap-490	94	1	[	[	X
ap-490	94	2	9	9	NUM
ap-490	94	3	]	]	PUNCT
ap-490	94	4	and	and	CCONJ
ap-490	94	5	the	the	DET
ap-490	94	6	dynamic	dynamic	ADJ
ap-490	94	7	level	level	NOUN
ap-490	94	8	scheduling	scheduling	NOUN
ap-490	94	9	(	(	PUNCT
ap-490	94	10	dls	dls	PROPN
ap-490	94	11	)	)	PUNCT
ap-490	94	12	algorithm	algorithm	NOUN
ap-490	95	1	[	[	X
ap-490	95	2	10	10	NUM
ap-490	95	3	]	]	PUNCT
ap-490	95	4	.	.	PUNCT
ap-490	96	1	18	18	NUM
ap-490	96	2	©	©	PROPN
ap-490	96	3	czech	czech	PROPN
ap-490	96	4	technical	technical	PROPN
ap-490	96	5	university	university	PROPN
ap-490	96	6	publishing	publishing	NOUN
ap-490	96	7	house	house	NOUN
ap-490	96	8	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-490	96	9	acta	acta	PROPN
ap-490	96	10	polytechnica	polytechnica	PROPN
ap-490	96	11	vol	vol	NOUN
ap-490	96	12	.	.	PUNCT
ap-490	97	1	43	43	NUM
ap-490	97	2	no	no	INTJ
ap-490	97	3	.	.	PUNCT
ap-490	98	1	6/2003	6/2003	NUM
ap-490	98	2	1	1	NUM
ap-490	98	3	.	.	X
ap-490	98	4	compute	compute	VERB
ap-490	98	5	the	the	DET
ap-490	98	6	sl	sl	INTJ
ap-490	98	7	(	(	PUNCT
ap-490	98	8	static	static	ADJ
ap-490	98	9	level	level	NOUN
ap-490	98	10	)	)	PUNCT
ap-490	98	11	for	for	ADP
ap-490	98	12	each	each	DET
ap-490	98	13	node	node	NOUN
ap-490	98	14	in	in	ADP
ap-490	98	15	the	the	DET
ap-490	98	16	graph	graph	NOUN
ap-490	98	17	2	2	NUM
ap-490	98	18	.	.	PUNCT
ap-490	99	1	put	put	VERB
ap-490	99	2	all	all	DET
ap-490	99	3	nodes	node	NOUN
ap-490	99	4	in	in	ADP
ap-490	99	5	a	a	DET
ap-490	99	6	list	list	NOUN
ap-490	99	7	l	l	NOUN
ap-490	99	8	and	and	CCONJ
ap-490	99	9	sort	sort	ADV
ap-490	99	10	l	l	NOUN
ap-490	99	11	in	in	ADP
ap-490	99	12	a	a	DET
ap-490	99	13	descending	descend	VERB
ap-490	99	14	order	order	NOUN
ap-490	99	15	of	of	ADP
ap-490	99	16	nodes	node	NOUN
ap-490	99	17	sl	sl	AUX
ap-490	99	18	3	3	NUM
ap-490	99	19	.	.	PUNCT
ap-490	100	1	while	while	SCONJ
ap-490	100	2	not	not	PART
ap-490	100	3	the	the	DET
ap-490	100	4	end	end	NOUN
ap-490	100	5	l	l	NOUN
ap-490	100	6	do	do	AUX
ap-490	100	7	�	�	PROPN
ap-490	100	8	dequeue	dequeue	NOUN
ap-490	100	9	vi	vi	PROPN
ap-490	100	10	from	from	ADP
ap-490	100	11	l	l	PROPN
ap-490	100	12	�	�	PROPN
ap-490	100	13	compute	compute	PROPN
ap-490	100	14	earliest	early	ADJ
ap-490	100	15	execution	execution	NOUN
ap-490	100	16	start	start	VERB
ap-490	100	17	time	time	NOUN
ap-490	100	18	for	for	ADP
ap-490	100	19	vi	vi	NOUN
ap-490	100	20	in	in	ADP
ap-490	100	21	all	all	DET
ap-490	100	22	processors	processor	NOUN
ap-490	100	23	�	�	PROPN
ap-490	100	24	schedule	schedule	NOUN
ap-490	100	25	vi	vi	PROPN
ap-490	100	26	to	to	ADP
ap-490	100	27	the	the	DET
ap-490	100	28	processor	processor	NOUN
ap-490	100	29	that	that	PRON
ap-490	100	30	minimizes	minimize	VERB
ap-490	100	31	the	the	DET
ap-490	100	32	node	node	ADJ
ap-490	100	33	earliest	early	ADJ
ap-490	100	34	execution	execution	NOUN
ap-490	100	35	start	start	VERB
ap-490	100	36	time	time	NOUN
ap-490	100	37	fig	fig	NOUN
ap-490	100	38	.	.	PUNCT
ap-490	101	1	2	2	NUM
ap-490	101	2	:	:	PUNCT
ap-490	101	3	hlfet	hlfet	NOUN
ap-490	101	4	algorithm	algorithm	NOUN
ap-490	101	5	step	step	NOUN
ap-490	101	6	selected	select	VERB
ap-490	101	7	v	v	NUM
ap-490	101	8	p1	p1	PROPN
ap-490	101	9	p2	p2	PROPN
ap-490	101	10	p3	p3	PROPN
ap-490	101	11	selected	select	VERB
ap-490	101	12	p	p	NOUN
ap-490	101	13	1	1	NUM
ap-490	101	14	1	1	NUM
ap-490	101	15	0	0	NUM
ap-490	101	16	0	0	NUM
ap-490	101	17	0	0	NUM
ap-490	101	18	p1	p1	NOUN
ap-490	101	19	2	2	NUM
ap-490	101	20	2	2	NUM
ap-490	101	21	20	20	NUM
ap-490	101	22	28	28	NUM
ap-490	101	23	28	28	NUM
ap-490	101	24	p1	p1	NOUN
ap-490	101	25	3	3	NUM
ap-490	101	26	4	4	NUM
ap-490	101	27	40	40	NUM
ap-490	101	28	22	22	NUM
ap-490	101	29	22	22	NUM
ap-490	101	30	p2	p2	PROPN
ap-490	101	31	4	4	NUM
ap-490	101	32	3	3	NUM
ap-490	101	33	40	40	NUM
ap-490	101	34	37	37	NUM
ap-490	101	35	24	24	NUM
ap-490	101	36	p3	p3	NOUN
ap-490	101	37	5	5	NUM
ap-490	101	38	5	5	NUM
ap-490	101	39	40	40	NUM
ap-490	101	40	37	37	NUM
ap-490	101	41	44	44	NUM
ap-490	101	42	p2	p2	PROPN
ap-490	101	43	6	6	NUM
ap-490	101	44	6	6	NUM
ap-490	101	45	40	40	NUM
ap-490	101	46	42	42	NUM
ap-490	101	47	44	44	NUM
ap-490	101	48	p1	p1	NOUN
ap-490	101	49	7	7	NUM
ap-490	101	50	9	9	NUM
ap-490	101	51	50	50	NUM
ap-490	101	52	48	48	NUM
ap-490	101	53	50	50	NUM
ap-490	101	54	p2	p2	NOUN
ap-490	101	55	8	8	NUM
ap-490	101	56	8	8	NUM
ap-490	101	57	45	45	NUM
ap-490	101	58	68	68	NUM
ap-490	101	59	53	53	NUM
ap-490	101	60	p1	p1	NOUN
ap-490	101	61	9	9	NUM
ap-490	101	62	7	7	NUM
ap-490	101	63	60	60	NUM
ap-490	101	64	68	68	NUM
ap-490	101	65	44	44	NUM
ap-490	101	66	p3	p3	NOUN
ap-490	101	67	10	10	NUM
ap-490	101	68	10	10	NUM
ap-490	101	69	76	76	NUM
ap-490	101	70	68	68	NUM
ap-490	101	71	76	76	NUM
ap-490	101	72	p2	p2	NOUN
ap-490	101	73	table	table	NOUN
ap-490	101	74	2	2	NUM
ap-490	101	75	:	:	PUNCT
ap-490	101	76	a	a	DET
ap-490	101	77	scheduling	scheduling	NOUN
ap-490	101	78	trace	trace	NOUN
ap-490	101	79	of	of	ADP
ap-490	101	80	the	the	DET
ap-490	101	81	hlfet	hlfet	NOUN
ap-490	101	82	algorithm	algorithm	NOUN
ap-490	101	83	(	(	PUNCT
ap-490	101	84	makespan	makespan	ADV
ap-490	101	85	�	�	PROPN
ap-490	101	86	88	88	NUM
ap-490	101	87	)	)	PUNCT
ap-490	101	88	1	1	NUM
ap-490	101	89	.	.	X
ap-490	101	90	compute	compute	VERB
ap-490	101	91	the	the	DET
ap-490	101	92	alap	alap	NOUN
ap-490	101	93	(	(	PUNCT
ap-490	101	94	lst	lst	NOUN
ap-490	101	95	in	in	ADP
ap-490	101	96	section	section	NOUN
ap-490	101	97	2	2	NUM
ap-490	101	98	)	)	PUNCT
ap-490	101	99	for	for	ADP
ap-490	101	100	each	each	DET
ap-490	101	101	node	node	NOUN
ap-490	101	102	in	in	ADP
ap-490	101	103	the	the	DET
ap-490	101	104	graph	graph	NOUN
ap-490	101	105	2	2	NUM
ap-490	101	106	.	.	PUNCT
ap-490	101	107	for	for	ADP
ap-490	101	108	each	each	DET
ap-490	101	109	node	node	NOUN
ap-490	101	110	,	,	PUNCT
ap-490	101	111	create	create	VERB
ap-490	101	112	a	a	DET
ap-490	101	113	list	list	NOUN
ap-490	101	114	,	,	PUNCT
ap-490	101	115	which	which	PRON
ap-490	101	116	consists	consist	VERB
ap-490	101	117	of	of	ADP
ap-490	101	118	the	the	DET
ap-490	101	119	alap	alap	NOUN
ap-490	101	120	of	of	ADP
ap-490	101	121	the	the	DET
ap-490	101	122	node	node	NOUN
ap-490	101	123	itself	itself	PRON
ap-490	101	124	and	and	CCONJ
ap-490	101	125	all	all	DET
ap-490	101	126	its	its	PRON
ap-490	101	127	children	child	NOUN
ap-490	101	128	3	3	X
ap-490	101	129	.	.	X
ap-490	101	130	sort	sort	NOUN
ap-490	101	131	these	these	DET
ap-490	101	132	lists	list	NOUN
ap-490	101	133	in	in	ADP
ap-490	101	134	an	an	DET
ap-490	101	135	ascending	ascend	VERB
ap-490	101	136	order	order	NOUN
ap-490	101	137	of	of	ADP
ap-490	101	138	nodes	node	NOUN
ap-490	101	139	alap	alap	ADJ
ap-490	101	140	4	4	NUM
ap-490	101	141	.	.	PUNCT
ap-490	101	142	create	create	VERB
ap-490	101	143	a	a	DET
ap-490	101	144	node	node	NOUN
ap-490	101	145	list	list	NOUN
ap-490	101	146	l	l	NOUN
ap-490	101	147	sorted	sort	VERB
ap-490	101	148	in	in	ADP
ap-490	101	149	ascending	ascend	VERB
ap-490	101	150	order	order	NOUN
ap-490	101	151	of	of	ADP
ap-490	101	152	nodes	node	NOUN
ap-490	101	153	alap	alap	ADJ
ap-490	101	154	.	.	PUNCT
ap-490	102	1	use	use	NOUN
ap-490	102	2	nodes	node	NOUN
ap-490	102	3	sorted	sort	VERB
ap-490	102	4	lists	list	NOUN
ap-490	102	5	(	(	PUNCT
ap-490	102	6	previous	previous	ADJ
ap-490	102	7	2	2	NUM
ap-490	102	8	steps	step	NOUN
ap-490	102	9	)	)	PUNCT
ap-490	102	10	to	to	PART
ap-490	102	11	break	break	VERB
ap-490	102	12	a	a	DET
ap-490	102	13	tie	tie	NOUN
ap-490	102	14	5	5	NUM
ap-490	102	15	.	.	PUNCT
ap-490	103	1	while	while	SCONJ
ap-490	103	2	not	not	PART
ap-490	103	3	the	the	DET
ap-490	103	4	end	end	NOUN
ap-490	103	5	l	l	NOUN
ap-490	103	6	do	do	AUX
ap-490	103	7	�	�	PROPN
ap-490	103	8	dequeue	dequeue	NOUN
ap-490	103	9	vi	vi	PROPN
ap-490	103	10	from	from	ADP
ap-490	103	11	l	l	PROPN
ap-490	103	12	�	�	PROPN
ap-490	103	13	compute	compute	PROPN
ap-490	103	14	earliest	early	ADJ
ap-490	103	15	execution	execution	NOUN
ap-490	103	16	start	start	VERB
ap-490	103	17	time	time	NOUN
ap-490	103	18	for	for	ADP
ap-490	103	19	vi	vi	NOUN
ap-490	103	20	in	in	ADP
ap-490	103	21	all	all	DET
ap-490	103	22	processors	processor	NOUN
ap-490	103	23	�	�	PROPN
ap-490	103	24	schedule	schedule	NOUN
ap-490	103	25	vi	vi	PROPN
ap-490	103	26	to	to	ADP
ap-490	103	27	the	the	DET
ap-490	103	28	processor	processor	NOUN
ap-490	103	29	that	that	PRON
ap-490	103	30	minimizes	minimize	VERB
ap-490	103	31	the	the	DET
ap-490	103	32	node	node	ADJ
ap-490	103	33	earliest	early	ADJ
ap-490	103	34	execution	execution	NOUN
ap-490	103	35	start	start	VERB
ap-490	103	36	time	time	NOUN
ap-490	103	37	fig	fig	NOUN
ap-490	103	38	.	.	PUNCT
ap-490	104	1	3	3	NUM
ap-490	104	2	:	:	PUNCT
ap-490	104	3	mcp	mcp	PROPN
ap-490	104	4	algorithm	algorithm	PROPN
ap-490	104	5	step	step	NOUN
ap-490	104	6	selected	select	VERB
ap-490	104	7	v	v	NUM
ap-490	104	8	p1	p1	PROPN
ap-490	104	9	p2	p2	PROPN
ap-490	104	10	p3	p3	PROPN
ap-490	104	11	selected	select	VERB
ap-490	104	12	p	p	NOUN
ap-490	104	13	1	1	NUM
ap-490	104	14	1	1	NUM
ap-490	104	15	0	0	NUM
ap-490	104	16	0	0	NUM
ap-490	104	17	0	0	NUM
ap-490	104	18	p1	p1	NOUN
ap-490	104	19	2	2	NUM
ap-490	104	20	2	2	NUM
ap-490	104	21	20	20	NUM
ap-490	104	22	28	28	NUM
ap-490	104	23	28	28	NUM
ap-490	104	24	p1	p1	NOUN
ap-490	104	25	3	3	NUM
ap-490	104	26	4	4	NUM
ap-490	104	27	40	40	NUM
ap-490	104	28	22	22	NUM
ap-490	104	29	22	22	NUM
ap-490	104	30	p2	p2	PROPN
ap-490	104	31	4	4	NUM
ap-490	104	32	5	5	NUM
ap-490	104	33	40	40	NUM
ap-490	104	34	37	37	NUM
ap-490	104	35	28	28	NUM
ap-490	104	36	p3	p3	PROPN
ap-490	104	37	5	5	NUM
ap-490	104	38	3	3	NUM
ap-490	104	39	40	40	NUM
ap-490	104	40	37	37	NUM
ap-490	104	41	33	33	NUM
ap-490	104	42	p3	p3	NOUN
ap-490	104	43	6	6	NUM
ap-490	104	44	6	6	NUM
ap-490	104	45	40	40	NUM
ap-490	104	46	37	37	NUM
ap-490	104	47	53	53	NUM
ap-490	104	48	p2	p2	PROPN
ap-490	104	49	7	7	NUM
ap-490	104	50	9	9	NUM
ap-490	104	51	41	41	NUM
ap-490	104	52	48	48	NUM
ap-490	104	53	53	53	NUM
ap-490	104	54	p1	p1	NOUN
ap-490	104	55	8	8	NUM
ap-490	104	56	8	8	NUM
ap-490	104	57	61	61	NUM
ap-490	104	58	44	44	NUM
ap-490	104	59	53	53	NUM
ap-490	104	60	p2	p2	PROPN
ap-490	104	61	9	9	NUM
ap-490	104	62	7	7	NUM
ap-490	104	63	61	61	NUM
ap-490	104	64	61	61	NUM
ap-490	104	65	53	53	NUM
ap-490	104	66	p3	p3	NOUN
ap-490	104	67	10	10	NUM
ap-490	104	68	10	10	NUM
ap-490	104	69	65	65	NUM
ap-490	104	70	69	69	NUM
ap-490	104	71	69	69	NUM
ap-490	104	72	p1	p1	NOUN
ap-490	104	73	table	table	NOUN
ap-490	104	74	3	3	NUM
ap-490	104	75	:	:	PUNCT
ap-490	104	76	a	a	DET
ap-490	104	77	scheduling	scheduling	NOUN
ap-490	104	78	trace	trace	NOUN
ap-490	104	79	of	of	ADP
ap-490	104	80	the	the	DET
ap-490	104	81	mcp	mcp	PROPN
ap-490	104	82	algorithm	algorithm	NOUN
ap-490	104	83	(	(	PUNCT
ap-490	104	84	makespan	makespan	PROPN
ap-490	104	85	�	�	PROPN
ap-490	104	86	85	85	NUM
ap-490	104	87	)	)	PUNCT
ap-490	104	88	3.2.1	3.2.1	NUM
ap-490	104	89	etf	etf	NOUN
ap-490	104	90	algorithm	algorithm	NOUN
ap-490	104	91	the	the	DET
ap-490	104	92	earliest	early	ADJ
ap-490	104	93	time	time	NOUN
ap-490	104	94	first	first	ADV
ap-490	104	95	(	(	PUNCT
ap-490	104	96	etf	etf	NOUN
ap-490	104	97	)	)	PUNCT
ap-490	104	98	algorithm	algorithm	NOUN
ap-490	105	1	[	[	X
ap-490	105	2	9	9	NUM
ap-490	105	3	]	]	PUNCT
ap-490	105	4	computes	compute	NOUN
ap-490	105	5	,	,	PUNCT
ap-490	105	6	at	at	ADP
ap-490	105	7	each	each	DET
ap-490	105	8	step	step	NOUN
ap-490	105	9	,	,	PUNCT
ap-490	105	10	the	the	DET
ap-490	105	11	earliest	early	ADJ
ap-490	105	12	execution	execution	NOUN
ap-490	105	13	start	start	NOUN
ap-490	105	14	time	time	NOUN
ap-490	105	15	(	(	PUNCT
ap-490	105	16	eest	eest	X
ap-490	105	17	)	)	PUNCT
ap-490	105	18	for	for	ADP
ap-490	105	19	all	all	DET
ap-490	105	20	ready	ready	ADJ
ap-490	105	21	nodes	node	NOUN
ap-490	105	22	and	and	CCONJ
ap-490	105	23	selects	select	VERB
ap-490	105	24	the	the	DET
ap-490	105	25	one	one	NOUN
ap-490	105	26	with	with	ADP
ap-490	105	27	the	the	DET
ap-490	105	28	lowest	low	ADJ
ap-490	105	29	value	value	NOUN
ap-490	105	30	for	for	ADP
ap-490	105	31	scheduling	scheduling	NOUN
ap-490	105	32	.	.	PUNCT
ap-490	106	1	the	the	DET
ap-490	106	2	ready	ready	ADJ
ap-490	106	3	node	node	NOUN
ap-490	106	4	is	be	AUX
ap-490	106	5	defined	define	VERB
ap-490	106	6	as	as	ADP
ap-490	106	7	the	the	DET
ap-490	106	8	node	node	NOUN
ap-490	106	9	having	have	VERB
ap-490	106	10	all	all	DET
ap-490	106	11	its	its	PRON
ap-490	106	12	parents	parent	NOUN
ap-490	106	13	scheduled	schedule	VERB
ap-490	106	14	.	.	PUNCT
ap-490	107	1	when	when	SCONJ
ap-490	107	2	two	two	NUM
ap-490	107	3	nodes	node	NOUN
ap-490	107	4	have	have	VERB
ap-490	107	5	the	the	DET
ap-490	107	6	same	same	ADJ
ap-490	107	7	value	value	NOUN
ap-490	107	8	of	of	ADP
ap-490	107	9	eest	e	ADJ
ap-490	107	10	,	,	PUNCT
ap-490	107	11	the	the	DET
ap-490	107	12	etf	etf	NOUN
ap-490	107	13	algorithm	algorithm	NOUN
ap-490	107	14	breaks	break	VERB
ap-490	107	15	the	the	DET
ap-490	107	16	tie	tie	NOUN
ap-490	107	17	by	by	ADP
ap-490	107	18	scheduling	schedule	VERB
ap-490	107	19	the	the	DET
ap-490	107	20	one	one	NOUN
ap-490	107	21	with	with	ADP
ap-490	107	22	the	the	DET
ap-490	107	23	higher	high	ADJ
ap-490	107	24	static	static	ADJ
ap-490	107	25	level	level	NOUN
ap-490	107	26	.	.	PUNCT
ap-490	108	1	fig	fig	NOUN
ap-490	108	2	.	.	PUNCT
ap-490	109	1	4	4	NUM
ap-490	109	2	shows	show	VERB
ap-490	109	3	the	the	DET
ap-490	109	4	etf	etf	NOUN
ap-490	109	5	algorithm	algorithm	NOUN
ap-490	109	6	.	.	PUNCT
ap-490	110	1	the	the	DET
ap-490	110	2	complexity	complexity	NOUN
ap-490	110	3	of	of	ADP
ap-490	110	4	the	the	DET
ap-490	110	5	etf	etf	NOUN
ap-490	110	6	algorithm	algorithm	NOUN
ap-490	110	7	is	be	AUX
ap-490	110	8	o(pv3	o(pv3	ADJ
ap-490	110	9	)	)	PUNCT
ap-490	110	10	.	.	PUNCT
ap-490	111	1	for	for	ADP
ap-490	111	2	the	the	DET
ap-490	111	3	dag	dag	PROPN
ap-490	111	4	shown	show	VERB
ap-490	111	5	in	in	ADP
ap-490	111	6	fig	fig	NOUN
ap-490	111	7	.	.	PUNCT
ap-490	112	1	1	1	NUM
ap-490	112	2	,	,	PUNCT
ap-490	112	3	the	the	DET
ap-490	112	4	scheduling	scheduling	NOUN
ap-490	112	5	trace	trace	NOUN
ap-490	112	6	of	of	ADP
ap-490	112	7	etf	etf	NOUN
ap-490	112	8	algorithm	algorithm	NOUN
ap-490	112	9	is	be	AUX
ap-490	112	10	given	give	VERB
ap-490	112	11	in	in	ADP
ap-490	112	12	table	table	NOUN
ap-490	112	13	4	4	NUM
ap-490	112	14	.	.	X
ap-490	112	15	3.2.2	3.2.2	NUM
ap-490	112	16	dls	dls	PROPN
ap-490	112	17	algorithm	algorithm	NOUN
ap-490	113	1	the	the	DET
ap-490	113	2	dynamic	dynamic	ADJ
ap-490	113	3	level	level	NOUN
ap-490	113	4	scheduling	scheduling	NOUN
ap-490	113	5	(	(	PUNCT
ap-490	113	6	dls	dls	PROPN
ap-490	113	7	)	)	PUNCT
ap-490	113	8	algorithm	algorithm	NOUN
ap-490	114	1	[	[	X
ap-490	114	2	10	10	NUM
ap-490	114	3	]	]	PUNCT
ap-490	114	4	uses	use	VERB
ap-490	114	5	an	an	DET
ap-490	114	6	attribute	attribute	NOUN
ap-490	114	7	called	call	VERB
ap-490	114	8	the	the	DET
ap-490	114	9	dynamic	dynamic	ADJ
ap-490	114	10	level	level	NOUN
ap-490	114	11	(	(	PUNCT
ap-490	114	12	dl	dl	PROPN
ap-490	114	13	)	)	PUNCT
ap-490	114	14	,	,	PUNCT
ap-490	114	15	which	which	PRON
ap-490	114	16	is	be	AUX
ap-490	114	17	the	the	DET
ap-490	114	18	difference	difference	NOUN
ap-490	114	19	between	between	ADP
ap-490	114	20	the	the	DET
ap-490	114	21	static	static	ADJ
ap-490	114	22	level	level	NOUN
ap-490	114	23	of	of	ADP
ap-490	114	24	a	a	DET
ap-490	114	25	node	node	NOUN
ap-490	114	26	and	and	CCONJ
ap-490	114	27	its	its	PRON
ap-490	114	28	earliest	early	ADJ
ap-490	114	29	execution	execution	NOUN
ap-490	114	30	start	start	VERB
ap-490	114	31	time	time	NOUN
ap-490	114	32	.	.	PUNCT
ap-490	115	1	in	in	ADP
ap-490	115	2	each	each	DET
ap-490	115	3	scheduling	scheduling	NOUN
ap-490	115	4	step	step	NOUN
ap-490	115	5	,	,	PUNCT
ap-490	115	6	the	the	DET
ap-490	115	7	nodeprocessor	nodeprocessor	NOUN
ap-490	115	8	pair	pair	NOUN
ap-490	115	9	that	that	PRON
ap-490	115	10	gives	give	VERB
ap-490	115	11	the	the	DET
ap-490	115	12	largest	large	ADJ
ap-490	115	13	value	value	NOUN
ap-490	115	14	of	of	ADP
ap-490	115	15	dl	dl	PROPN
ap-490	115	16	is	be	AUX
ap-490	115	17	selected	select	VERB
ap-490	115	18	.	.	PUNCT
ap-490	116	1	this	this	DET
ap-490	116	2	mechanism	mechanism	NOUN
ap-490	116	3	is	be	AUX
ap-490	116	4	similar	similar	ADJ
ap-490	116	5	to	to	ADP
ap-490	116	6	the	the	DET
ap-490	116	7	one	one	NOUN
ap-490	116	8	used	use	VERB
ap-490	116	9	by	by	ADP
ap-490	116	10	the	the	DET
ap-490	116	11	etf	etf	NOUN
ap-490	116	12	algorithm	algorithm	NOUN
ap-490	116	13	.	.	PUNCT
ap-490	117	1	however	however	ADV
ap-490	117	2	,	,	PUNCT
ap-490	117	3	there	there	PRON
ap-490	117	4	is	be	VERB
ap-490	117	5	one	one	NUM
ap-490	117	6	subtle	subtle	ADJ
ap-490	117	7	difference	difference	NOUN
ap-490	117	8	between	between	ADP
ap-490	117	9	the	the	DET
ap-490	117	10	etf	etf	NOUN
ap-490	117	11	and	and	CCONJ
ap-490	117	12	dls	dls	PROPN
ap-490	117	13	:	:	PUNCT
ap-490	117	14	the	the	DET
ap-490	117	15	etf	etf	NOUN
ap-490	117	16	algorithm	algorithm	NOUN
ap-490	117	17	schedules	schedule	VERB
ap-490	117	18	the	the	DET
ap-490	117	19	node	node	NOUN
ap-490	117	20	with	with	ADP
ap-490	117	21	the	the	DET
ap-490	117	22	minimum	minimum	ADJ
ap-490	117	23	earliest	early	ADJ
ap-490	117	24	execution	execution	NOUN
ap-490	117	25	start	start	VERB
ap-490	117	26	time	time	NOUN
ap-490	117	27	and	and	CCONJ
ap-490	117	28	uses	use	VERB
ap-490	117	29	the	the	DET
ap-490	117	30	static	static	ADJ
ap-490	117	31	level	level	NOUN
ap-490	117	32	merely	merely	ADV
ap-490	117	33	to	to	PART
ap-490	117	34	break	break	VERB
ap-490	117	35	ties	tie	NOUN
ap-490	117	36	.	.	PUNCT
ap-490	118	1	in	in	ADP
ap-490	118	2	contrast	contrast	NOUN
ap-490	118	3	,	,	PUNCT
ap-490	118	4	the	the	DET
ap-490	118	5	dls	dls	PROPN
ap-490	118	6	algorithm	algorithm	NOUN
ap-490	118	7	tends	tend	VERB
ap-490	118	8	to	to	PART
ap-490	118	9	schedule	schedule	VERB
ap-490	118	10	nodes	node	NOUN
ap-490	118	11	in	in	ADP
ap-490	118	12	descending	descend	VERB
ap-490	118	13	order	order	NOUN
ap-490	118	14	of	of	ADP
ap-490	118	15	their	their	PRON
ap-490	118	16	static	static	ADJ
ap-490	118	17	levels	level	NOUN
ap-490	118	18	at	at	ADP
ap-490	118	19	the	the	DET
ap-490	118	20	beginning	beginning	NOUN
ap-490	118	21	of	of	ADP
ap-490	118	22	the	the	DET
ap-490	118	23	process	process	NOUN
ap-490	118	24	,	,	PUNCT
ap-490	118	25	but	but	CCONJ
ap-490	118	26	tends	tend	VERB
ap-490	118	27	to	to	PART
ap-490	118	28	schedule	schedule	VERB
ap-490	118	29	nodes	node	NOUN
ap-490	118	30	in	in	ADP
ap-490	118	31	ascending	ascend	VERB
ap-490	118	32	order	order	NOUN
ap-490	118	33	of	of	ADP
ap-490	118	34	eest	eest	NOUN
ap-490	118	35	near	near	ADP
ap-490	118	36	the	the	DET
ap-490	118	37	end	end	NOUN
ap-490	118	38	of	of	ADP
ap-490	118	39	the	the	DET
ap-490	118	40	process	process	NOUN
ap-490	118	41	.	.	PUNCT
ap-490	119	1	the	the	DET
ap-490	119	2	dls	dls	PROPN
ap-490	119	3	algorithm	algorithm	NOUN
ap-490	119	4	is	be	AUX
ap-490	119	5	shown	show	VERB
ap-490	119	6	in	in	ADP
ap-490	119	7	fig	fig	NOUN
ap-490	119	8	.	.	PUNCT
ap-490	120	1	5	5	X
ap-490	120	2	.	.	PUNCT
ap-490	120	3	the	the	DET
ap-490	120	4	complexity	complexity	NOUN
ap-490	120	5	of	of	ADP
ap-490	120	6	the	the	DET
ap-490	120	7	dls	dls	PROPN
ap-490	120	8	algorithm	algorithm	NOUN
ap-490	120	9	is	be	AUX
ap-490	120	10	o(pv3	o(pv3	ADJ
ap-490	120	11	)	)	PUNCT
ap-490	120	12	.	.	PUNCT
ap-490	121	1	for	for	ADP
ap-490	121	2	the	the	DET
ap-490	121	3	dag	dag	PROPN
ap-490	121	4	shown	show	VERB
ap-490	121	5	in	in	ADP
ap-490	121	6	fig	fig	NOUN
ap-490	121	7	.	.	PUNCT
ap-490	122	1	1	1	NUM
ap-490	122	2	,	,	PUNCT
ap-490	122	3	the	the	DET
ap-490	122	4	s	s	NOUN
ap-490	122	5	of	of	ADP
ap-490	122	6	dls	dls	PROPN
ap-490	122	7	algorithm	algorithm	NOUN
ap-490	122	8	is	be	AUX
ap-490	122	9	exactly	exactly	ADV
ap-490	122	10	the	the	DET
ap-490	122	11	same	same	ADJ
ap-490	122	12	as	as	ADP
ap-490	122	13	the	the	DET
ap-490	122	14	scheduling	scheduling	NOUN
ap-490	122	15	trace	trace	NOUN
ap-490	122	16	of	of	ADP
ap-490	122	17	the	the	DET
ap-490	122	18	the	the	DET
ap-490	122	19	etf	etf	NOUN
ap-490	122	20	algorithm	algorithm	NOUN
ap-490	122	21	as	as	SCONJ
ap-490	122	22	shown	show	VERB
ap-490	122	23	in	in	ADP
ap-490	122	24	table	table	NOUN
ap-490	122	25	4	4	NUM
ap-490	122	26	.	.	NOUN
ap-490	122	27	4	4	NUM
ap-490	122	28	experimental	experimental	ADJ
ap-490	122	29	results	result	NOUN
ap-490	122	30	and	and	CCONJ
ap-490	122	31	discussion	discussion	NOUN
ap-490	122	32	this	this	DET
ap-490	122	33	section	section	NOUN
ap-490	122	34	presents	present	VERB
ap-490	122	35	a	a	DET
ap-490	122	36	performance	performance	NOUN
ap-490	122	37	comparison	comparison	NOUN
ap-490	122	38	of	of	ADP
ap-490	122	39	the	the	DET
ap-490	122	40	four	four	NUM
ap-490	122	41	algorithms	algorithm	NOUN
ap-490	122	42	given	give	VERB
ap-490	122	43	in	in	ADP
ap-490	122	44	section	section	NOUN
ap-490	122	45	3	3	NUM
ap-490	122	46	.	.	PUNCT
ap-490	123	1	for	for	ADP
ap-490	123	2	this	this	DET
ap-490	123	3	purpose	purpose	NOUN
ap-490	123	4	,	,	PUNCT
ap-490	123	5	we	we	PRON
ap-490	123	6	used	use	VERB
ap-490	123	7	randomly	randomly	ADV
ap-490	123	8	generated	generate	VERB
ap-490	123	9	task	task	NOUN
ap-490	123	10	graphs	graph	NOUN
ap-490	123	11	and	and	CCONJ
ap-490	123	12	the	the	DET
ap-490	123	13	following	follow	VERB
ap-490	123	14	comparison	comparison	NOUN
ap-490	123	15	metrics	metric	NOUN
ap-490	123	16	are	be	AUX
ap-490	123	17	used	use	VERB
ap-490	123	18	.	.	PUNCT
ap-490	124	1	4.1	4.1	NUM
ap-490	124	2	comparison	comparison	NOUN
ap-490	124	3	metrics	metric	NOUN
ap-490	124	4	the	the	DET
ap-490	124	5	comparisons	comparison	NOUN
ap-490	124	6	of	of	ADP
ap-490	124	7	the	the	DET
ap-490	124	8	algorithms	algorithm	NOUN
ap-490	124	9	are	be	AUX
ap-490	124	10	based	base	VERB
ap-490	124	11	on	on	ADP
ap-490	124	12	the	the	DET
ap-490	124	13	following	follow	VERB
ap-490	124	14	metrics	metric	NOUN
ap-490	124	15	.	.	PUNCT
ap-490	125	1	makespan	makespan	ADP
ap-490	125	2	the	the	DET
ap-490	125	3	makespan	makespan	NOUN
ap-490	125	4	is	be	AUX
ap-490	125	5	defined	define	VERB
ap-490	125	6	as	as	ADP
ap-490	125	7	the	the	DET
ap-490	125	8	overall	overall	ADJ
ap-490	125	9	completion	completion	NOUN
ap-490	125	10	time	time	NOUN
ap-490	125	11	,	,	PUNCT
ap-490	125	12	and	and	CCONJ
ap-490	125	13	can	can	AUX
ap-490	125	14	be	be	AUX
ap-490	125	15	specified	specify	VERB
ap-490	125	16	as	as	SCONJ
ap-490	125	17	follows	follow	VERB
ap-490	125	18	:	:	PUNCT
ap-490	125	19	makespan	makespan	PROPN
ap-490	125	20	fet	fet	PROPN
ap-490	125	21	vexit	vexit	PROPN
ap-490	125	22	�	�	PROPN
ap-490	125	23	(	(	PUNCT
ap-490	125	24	)	)	PUNCT
ap-490	125	25	,	,	PUNCT
ap-490	125	26	where	where	SCONJ
ap-490	125	27	fet	fet	PROPN
ap-490	125	28	vexit	vexit	VERB
ap-490	125	29	(	(	PUNCT
ap-490	125	30	)	)	PUNCT
ap-490	125	31	is	be	AUX
ap-490	125	32	the	the	DET
ap-490	125	33	finishing	finish	VERB
ap-490	125	34	time	time	NOUN
ap-490	125	35	of	of	ADP
ap-490	125	36	the	the	DET
ap-490	125	37	scheduled	schedule	VERB
ap-490	125	38	exit	exit	NOUN
ap-490	125	39	node	node	NOUN
ap-490	125	40	.	.	PUNCT
ap-490	126	1	scheduling	scheduling	NOUN
ap-490	126	2	length	length	NOUN
ap-490	126	3	ratio	ratio	NOUN
ap-490	126	4	(	(	PUNCT
ap-490	126	5	slr	slr	X
ap-490	126	6	)	)	PUNCT
ap-490	126	7	the	the	DET
ap-490	126	8	main	main	ADJ
ap-490	126	9	performance	performance	NOUN
ap-490	126	10	measure	measure	NOUN
ap-490	126	11	is	be	AUX
ap-490	126	12	the	the	DET
ap-490	126	13	scheduling	scheduling	NOUN
ap-490	126	14	length	length	NOUN
ap-490	126	15	(	(	PUNCT
ap-490	126	16	makespan	makespan	ADV
ap-490	126	17	)	)	PUNCT
ap-490	126	18	of	of	ADP
ap-490	126	19	its	its	PRON
ap-490	126	20	output	output	NOUN
ap-490	126	21	schedule	schedule	NOUN
ap-490	126	22	.	.	PUNCT
ap-490	127	1	since	since	SCONJ
ap-490	127	2	a	a	DET
ap-490	127	3	large	large	ADJ
ap-490	127	4	set	set	NOUN
ap-490	127	5	of	of	ADP
ap-490	127	6	task	task	NOUN
ap-490	127	7	graphs	graph	NOUN
ap-490	127	8	with	with	ADP
ap-490	127	9	different	different	ADJ
ap-490	127	10	properties	property	NOUN
ap-490	127	11	is	be	AUX
ap-490	127	12	used	use	VERB
ap-490	127	13	,	,	PUNCT
ap-490	127	14	it	it	PRON
ap-490	127	15	is	be	AUX
ap-490	127	16	necessary	necessary	ADJ
ap-490	127	17	to	to	PART
ap-490	127	18	normalize	normalize	VERB
ap-490	127	19	the	the	DET
ap-490	127	20	schedule	schedule	NOUN
ap-490	127	21	length	length	NOUN
ap-490	127	22	to	to	ADP
ap-490	127	23	the	the	DET
ap-490	127	24	lower	lower	ADV
ap-490	127	25	bound	bind	VERB
ap-490	127	26	,	,	PUNCT
ap-490	127	27	which	which	PRON
ap-490	127	28	is	be	AUX
ap-490	127	29	called	call	VERB
ap-490	127	30	the	the	DET
ap-490	127	31	schedule	schedule	NOUN
ap-490	127	32	length	length	NOUN
ap-490	127	33	ratio	ratio	NOUN
ap-490	127	34	(	(	PUNCT
ap-490	127	35	slr	slr	NOUN
ap-490	127	36	)	)	PUNCT
ap-490	127	37	.	.	PUNCT
ap-490	128	1	the	the	DET
ap-490	128	2	slr	slr	NOUN
ap-490	128	3	value	value	NOUN
ap-490	128	4	of	of	ADP
ap-490	128	5	an	an	DET
ap-490	128	6	algorithm	algorithm	NOUN
ap-490	128	7	on	on	ADP
ap-490	128	8	a	a	DET
ap-490	128	9	graph	graph	NOUN
ap-490	128	10	is	be	AUX
ap-490	128	11	defined	define	VERB
ap-490	128	12	as	as	ADP
ap-490	128	13	slr	slr	NOUN
ap-490	128	14	makespan	makespan	ADV
ap-490	128	15	wi	wi	PROPN
ap-490	128	16	i	i	PRON
ap-490	128	17	cp	cp	PROPN
ap-490	128	18	�	�	PROPN
ap-490	128	19	�	�	PROPN
ap-490	128	20	�	�	PROPN
ap-490	128	21	.	.	PUNCT
ap-490	129	1	©	©	PROPN
ap-490	129	2	czech	czech	PROPN
ap-490	129	3	technical	technical	PROPN
ap-490	129	4	university	university	PROPN
ap-490	129	5	publishing	publishing	NOUN
ap-490	129	6	house	house	NOUN
ap-490	129	7	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-490	129	8	19	19	NUM
ap-490	129	9	acta	acta	PROPN
ap-490	129	10	polytechnica	polytechnica	PROPN
ap-490	129	11	vol	vol	NOUN
ap-490	129	12	.	.	PUNCT
ap-490	130	1	43	43	NUM
ap-490	130	2	no	no	INTJ
ap-490	130	3	.	.	PUNCT
ap-490	131	1	6/2003	6/2003	NUM
ap-490	131	2	1	1	NUM
ap-490	131	3	.	.	X
ap-490	131	4	compute	compute	VERB
ap-490	131	5	the	the	DET
ap-490	131	6	sl	sl	INTJ
ap-490	131	7	(	(	PUNCT
ap-490	131	8	static	static	ADJ
ap-490	131	9	level	level	NOUN
ap-490	131	10	)	)	PUNCT
ap-490	131	11	of	of	ADP
ap-490	131	12	each	each	DET
ap-490	131	13	node	node	NOUN
ap-490	131	14	in	in	ADP
ap-490	131	15	the	the	DET
ap-490	131	16	graph	graph	NOUN
ap-490	131	17	2	2	NUM
ap-490	131	18	.	.	PUNCT
ap-490	131	19	initially	initially	ADV
ap-490	131	20	,	,	PUNCT
ap-490	131	21	the	the	DET
ap-490	131	22	ready	ready	ADJ
ap-490	131	23	nodes	node	NOUN
ap-490	131	24	list	list	NOUN
ap-490	131	25	includes	include	VERB
ap-490	131	26	only	only	ADV
ap-490	131	27	the	the	DET
ap-490	131	28	entry	entry	NOUN
ap-490	131	29	node	node	NOUN
ap-490	131	30	3	3	NUM
ap-490	131	31	.	.	PUNCT
ap-490	131	32	while	while	SCONJ
ap-490	131	33	the	the	DET
ap-490	131	34	ready	ready	ADJ
ap-490	131	35	list	list	NOUN
ap-490	131	36	is	be	AUX
ap-490	131	37	not	not	PART
ap-490	131	38	empty	empty	ADJ
ap-490	131	39	do	do	AUX
ap-490	131	40	�	�	PROPN
ap-490	131	41	compute	compute	VERB
ap-490	131	42	the	the	DET
ap-490	131	43	earliest	early	ADJ
ap-490	131	44	execution	execution	NOUN
ap-490	131	45	start	start	VERB
ap-490	131	46	time	time	NOUN
ap-490	131	47	on	on	ADP
ap-490	131	48	each	each	DET
ap-490	131	49	processor	processor	NOUN
ap-490	131	50	for	for	ADP
ap-490	131	51	each	each	DET
ap-490	131	52	node	node	NOUN
ap-490	131	53	in	in	ADP
ap-490	131	54	the	the	DET
ap-490	131	55	ready	ready	ADJ
ap-490	131	56	list	list	NOUN
ap-490	131	57	�	�	NOUN
ap-490	131	58	select	select	VERB
ap-490	131	59	the	the	DET
ap-490	131	60	node	node	NOUN
ap-490	131	61	-	-	PUNCT
ap-490	131	62	processor	processor	NOUN
ap-490	131	63	pair	pair	NOUN
ap-490	131	64	that	that	PRON
ap-490	131	65	gives	give	VERB
ap-490	131	66	the	the	DET
ap-490	131	67	earliest	early	ADJ
ap-490	131	68	execution	execution	NOUN
ap-490	131	69	start	start	VERB
ap-490	131	70	time	time	NOUN
ap-490	131	71	.	.	PUNCT
ap-490	132	1	ties	tie	NOUN
ap-490	132	2	are	be	AUX
ap-490	132	3	broken	break	VERB
ap-490	132	4	by	by	ADP
ap-490	132	5	selecting	select	VERB
ap-490	132	6	the	the	DET
ap-490	132	7	node	node	NOUN
ap-490	132	8	with	with	ADP
ap-490	132	9	a	a	DET
ap-490	132	10	higher	high	ADJ
ap-490	132	11	sl	sl	NOUN
ap-490	132	12	�	�	PROPN
ap-490	132	13	schedule	schedule	NOUN
ap-490	132	14	the	the	DET
ap-490	132	15	node	node	NOUN
ap-490	132	16	to	to	ADP
ap-490	132	17	the	the	DET
ap-490	132	18	corresponding	corresponding	ADJ
ap-490	132	19	selected	select	VERB
ap-490	132	20	processor	processor	NOUN
ap-490	132	21	�	�	PROPN
ap-490	132	22	add	add	VERB
ap-490	132	23	the	the	DET
ap-490	132	24	newly	newly	ADV
ap-490	132	25	ready	ready	ADJ
ap-490	132	26	nodes	node	NOUN
ap-490	132	27	to	to	ADP
ap-490	132	28	the	the	DET
ap-490	132	29	ready	ready	ADJ
ap-490	132	30	list	list	NOUN
ap-490	132	31	fig	fig	NOUN
ap-490	132	32	.	.	PUNCT
ap-490	133	1	4	4	NUM
ap-490	133	2	:	:	PUNCT
ap-490	133	3	etf	etf	NOUN
ap-490	133	4	algorithm	algorithm	NOUN
ap-490	133	5	step	step	NOUN
ap-490	133	6	selected	select	VERB
ap-490	133	7	v	v	NUM
ap-490	133	8	p1	p1	PROPN
ap-490	133	9	p2	p2	PROPN
ap-490	133	10	p3	p3	PROPN
ap-490	133	11	selected	select	VERB
ap-490	133	12	p	p	NOUN
ap-490	133	13	1	1	NUM
ap-490	133	14	1	1	NUM
ap-490	133	15	0	0	NUM
ap-490	133	16	0	0	NUM
ap-490	133	17	0	0	NUM
ap-490	133	18	p1	p1	NOUN
ap-490	133	19	2	2	NUM
ap-490	133	20	2	2	NUM
ap-490	133	21	20	20	NUM
ap-490	133	22	28	28	NUM
ap-490	133	23	28	28	NUM
ap-490	133	24	p1	p1	NOUN
ap-490	133	25	3	3	NUM
ap-490	133	26	4	4	NUM
ap-490	133	27	40	40	NUM
ap-490	133	28	22	22	NUM
ap-490	133	29	22	22	NUM
ap-490	133	30	p2	p2	PROPN
ap-490	133	31	4	4	NUM
ap-490	133	32	3	3	NUM
ap-490	133	33	40	40	NUM
ap-490	133	34	37	37	NUM
ap-490	133	35	24	24	NUM
ap-490	133	36	p3	p3	NOUN
ap-490	133	37	5	5	NUM
ap-490	133	38	5	5	NUM
ap-490	133	39	40	40	NUM
ap-490	133	40	37	37	NUM
ap-490	133	41	44	44	NUM
ap-490	133	42	p2	p2	PROPN
ap-490	133	43	6	6	NUM
ap-490	133	44	6	6	NUM
ap-490	133	45	40	40	NUM
ap-490	133	46	42	42	NUM
ap-490	133	47	44	44	NUM
ap-490	133	48	p1	p1	NOUN
ap-490	133	49	7	7	NUM
ap-490	133	50	7	7	NUM
ap-490	133	51	52	52	NUM
ap-490	133	52	52	52	NUM
ap-490	133	53	44	44	NUM
ap-490	133	54	p3	p3	NOUN
ap-490	133	55	8	8	NUM
ap-490	133	56	8	8	NUM
ap-490	133	57	45	45	NUM
ap-490	133	58	53	53	NUM
ap-490	133	59	53	53	NUM
ap-490	133	60	p1	p1	NOUN
ap-490	133	61	9	9	NUM
ap-490	133	62	9	9	NUM
ap-490	133	63	50	50	NUM
ap-490	133	64	48	48	NUM
ap-490	133	65	50	50	NUM
ap-490	133	66	p2	p2	NOUN
ap-490	133	67	10	10	NUM
ap-490	133	68	10	10	NUM
ap-490	133	69	76	76	NUM
ap-490	133	70	68	68	NUM
ap-490	133	71	76	76	NUM
ap-490	133	72	p2	p2	NOUN
ap-490	133	73	table	table	NOUN
ap-490	133	74	4	4	NUM
ap-490	133	75	:	:	PUNCT
ap-490	133	76	a	a	DET
ap-490	133	77	scheduling	scheduling	NOUN
ap-490	133	78	trace	trace	NOUN
ap-490	133	79	of	of	ADP
ap-490	133	80	the	the	DET
ap-490	133	81	etf	etf	NOUN
ap-490	133	82	and	and	CCONJ
ap-490	133	83	dls	dls	NOUN
ap-490	133	84	algorithms	algorithm	NOUN
ap-490	133	85	(	(	PUNCT
ap-490	133	86	makespan	makespan	ADV
ap-490	133	87	�	�	PROPN
ap-490	133	88	88	88	NUM
ap-490	133	89	)	)	PUNCT
ap-490	133	90	1	1	NUM
ap-490	133	91	.	.	X
ap-490	133	92	compute	compute	VERB
ap-490	133	93	the	the	DET
ap-490	133	94	sl	sl	INTJ
ap-490	133	95	(	(	PUNCT
ap-490	133	96	static	static	ADJ
ap-490	133	97	level	level	NOUN
ap-490	133	98	)	)	PUNCT
ap-490	133	99	of	of	ADP
ap-490	133	100	each	each	DET
ap-490	133	101	node	node	NOUN
ap-490	133	102	in	in	ADP
ap-490	133	103	the	the	DET
ap-490	133	104	graph	graph	NOUN
ap-490	133	105	2	2	NUM
ap-490	133	106	.	.	PUNCT
ap-490	133	107	initially	initially	ADV
ap-490	133	108	,	,	PUNCT
ap-490	133	109	the	the	DET
ap-490	133	110	ready	ready	ADJ
ap-490	133	111	nodes	node	NOUN
ap-490	133	112	list	list	NOUN
ap-490	133	113	includes	include	VERB
ap-490	133	114	only	only	ADV
ap-490	133	115	the	the	DET
ap-490	133	116	entry	entry	NOUN
ap-490	133	117	node	node	NOUN
ap-490	133	118	3	3	NUM
ap-490	133	119	.	.	PUNCT
ap-490	133	120	while	while	SCONJ
ap-490	133	121	the	the	DET
ap-490	133	122	ready	ready	ADJ
ap-490	133	123	list	list	NOUN
ap-490	133	124	is	be	AUX
ap-490	133	125	not	not	PART
ap-490	133	126	empty	empty	ADJ
ap-490	133	127	do	do	AUX
ap-490	133	128	�	�	PROPN
ap-490	133	129	compute	compute	VERB
ap-490	133	130	the	the	DET
ap-490	133	131	earliest	early	ADJ
ap-490	133	132	execution	execution	NOUN
ap-490	133	133	start	start	VERB
ap-490	133	134	time	time	NOUN
ap-490	133	135	for	for	ADP
ap-490	133	136	every	every	DET
ap-490	133	137	ready	ready	ADJ
ap-490	133	138	node	node	NOUN
ap-490	133	139	on	on	ADP
ap-490	133	140	each	each	DET
ap-490	133	141	processor	processor	NOUN
ap-490	133	142	�	�	PROPN
ap-490	133	143	compute	compute	VERB
ap-490	133	144	the	the	DET
ap-490	133	145	dl	dl	PROPN
ap-490	133	146	of	of	ADP
ap-490	133	147	every	every	DET
ap-490	133	148	node	node	NOUN
ap-490	133	149	-	-	PUNCT
ap-490	133	150	processor	processor	NOUN
ap-490	133	151	pair	pair	NOUN
ap-490	133	152	by	by	ADP
ap-490	133	153	subtracting	subtract	VERB
ap-490	133	154	the	the	DET
ap-490	133	155	earliest	early	ADJ
ap-490	133	156	execution	execution	NOUN
ap-490	133	157	start	start	VERB
ap-490	133	158	time	time	NOUN
ap-490	133	159	from	from	ADP
ap-490	133	160	the	the	DET
ap-490	133	161	node	node	NOUN
ap-490	133	162	’s	’s	PART
ap-490	133	163	static	static	ADJ
ap-490	133	164	level	level	NOUN
ap-490	133	165	(	(	PUNCT
ap-490	133	166	sl	sl	NOUN
ap-490	133	167	)	)	PUNCT
ap-490	133	168	�	�	PROPN
ap-490	133	169	select	select	VERB
ap-490	133	170	the	the	DET
ap-490	133	171	node	node	NOUN
ap-490	133	172	-	-	PUNCT
ap-490	133	173	processor	processor	NOUN
ap-490	133	174	pair	pair	NOUN
ap-490	133	175	that	that	PRON
ap-490	133	176	gives	give	VERB
ap-490	133	177	the	the	DET
ap-490	133	178	largest	large	ADJ
ap-490	133	179	dl	dl	PROPN
ap-490	133	180	�	�	PROPN
ap-490	133	181	schedule	schedule	VERB
ap-490	133	182	the	the	DET
ap-490	133	183	node	node	NOUN
ap-490	133	184	to	to	ADP
ap-490	133	185	the	the	DET
ap-490	133	186	corresponding	corresponding	ADJ
ap-490	133	187	selected	select	VERB
ap-490	133	188	processor	processor	NOUN
ap-490	133	189	�	�	PROPN
ap-490	133	190	add	add	VERB
ap-490	133	191	the	the	DET
ap-490	133	192	newly	newly	ADV
ap-490	133	193	ready	ready	ADJ
ap-490	133	194	nodes	node	NOUN
ap-490	133	195	to	to	ADP
ap-490	133	196	the	the	DET
ap-490	133	197	ready	ready	ADJ
ap-490	133	198	list	list	NOUN
ap-490	133	199	fig	fig	NOUN
ap-490	133	200	.	.	PUNCT
ap-490	134	1	5	5	NUM
ap-490	134	2	:	:	PUNCT
ap-490	134	3	dls	dls	PROPN
ap-490	134	4	algorithm	algorithm	VERB
ap-490	134	5	the	the	DET
ap-490	134	6	denominator	denominator	NOUN
ap-490	134	7	is	be	AUX
ap-490	134	8	the	the	DET
ap-490	134	9	sum	sum	NOUN
ap-490	134	10	of	of	ADP
ap-490	134	11	the	the	DET
ap-490	134	12	computation	computation	NOUN
ap-490	134	13	costs	cost	NOUN
ap-490	134	14	of	of	ADP
ap-490	134	15	the	the	DET
ap-490	134	16	tasks	task	NOUN
ap-490	134	17	on	on	ADP
ap-490	134	18	a	a	DET
ap-490	134	19	critical	critical	ADJ
ap-490	134	20	path	path	NOUN
ap-490	134	21	(	(	PUNCT
ap-490	134	22	cp	cp	NOUN
ap-490	134	23	)	)	PUNCT
ap-490	134	24	.	.	PUNCT
ap-490	135	1	the	the	DET
ap-490	135	2	slr	slr	NOUN
ap-490	135	3	of	of	ADP
ap-490	135	4	a	a	DET
ap-490	135	5	graph	graph	NOUN
ap-490	135	6	(	(	PUNCT
ap-490	135	7	using	use	VERB
ap-490	135	8	any	any	DET
ap-490	135	9	algorithm	algorithm	NOUN
ap-490	135	10	)	)	PUNCT
ap-490	135	11	can	can	AUX
ap-490	135	12	not	not	PART
ap-490	135	13	be	be	AUX
ap-490	135	14	less	less	ADJ
ap-490	135	15	than	than	ADP
ap-490	135	16	one	one	NUM
ap-490	135	17	,	,	PUNCT
ap-490	135	18	since	since	SCONJ
ap-490	135	19	the	the	DET
ap-490	135	20	denominator	denominator	NOUN
ap-490	135	21	is	be	AUX
ap-490	135	22	the	the	DET
ap-490	135	23	lower	lower	ADV
ap-490	135	24	bound	bind	VERB
ap-490	135	25	.	.	PUNCT
ap-490	136	1	average	average	ADJ
ap-490	136	2	slr	slr	NOUN
ap-490	136	3	values	value	NOUN
ap-490	136	4	are	be	AUX
ap-490	136	5	used	use	VERB
ap-490	136	6	in	in	ADP
ap-490	136	7	our	our	PRON
ap-490	136	8	experiments	experiment	NOUN
ap-490	136	9	.	.	PUNCT
ap-490	137	1	speedup	speedup	VERB
ap-490	137	2	the	the	DET
ap-490	137	3	speedup	speedup	NOUN
ap-490	137	4	value	value	NOUN
ap-490	137	5	is	be	AUX
ap-490	137	6	computed	compute	VERB
ap-490	137	7	by	by	ADP
ap-490	137	8	dividing	divide	VERB
ap-490	137	9	the	the	DET
ap-490	137	10	sequential	sequential	ADJ
ap-490	137	11	execution	execution	NOUN
ap-490	137	12	time	time	NOUN
ap-490	137	13	(	(	PUNCT
ap-490	137	14	i.e.	i.e.	X
ap-490	137	15	,	,	PUNCT
ap-490	137	16	the	the	DET
ap-490	137	17	cumulative	cumulative	ADJ
ap-490	137	18	computation	computation	NOUN
ap-490	137	19	costs	cost	NOUN
ap-490	137	20	of	of	ADP
ap-490	137	21	the	the	DET
ap-490	137	22	tasks	task	NOUN
ap-490	137	23	)	)	PUNCT
ap-490	137	24	by	by	ADP
ap-490	137	25	the	the	DET
ap-490	137	26	parallel	parallel	ADJ
ap-490	137	27	execution	execution	NOUN
ap-490	137	28	time	time	NOUN
ap-490	137	29	(	(	PUNCT
ap-490	137	30	i.e.	i.e.	X
ap-490	137	31	,	,	PUNCT
ap-490	137	32	the	the	DET
ap-490	137	33	makespan	makespan	NOUN
ap-490	137	34	of	of	ADP
ap-490	137	35	the	the	DET
ap-490	137	36	schedule	schedule	NOUN
ap-490	137	37	)	)	PUNCT
ap-490	137	38	.	.	PUNCT
ap-490	138	1	number	number	NOUN
ap-490	138	2	of	of	ADP
ap-490	138	3	occurrences	occurrence	NOUN
ap-490	138	4	of	of	ADP
ap-490	138	5	better	well	ADJ
ap-490	138	6	quality	quality	NOUN
ap-490	138	7	of	of	ADP
ap-490	138	8	schedules	schedule	NOUN
ap-490	138	9	the	the	DET
ap-490	138	10	number	number	NOUN
ap-490	138	11	of	of	ADP
ap-490	138	12	times	time	NOUN
ap-490	138	13	that	that	SCONJ
ap-490	138	14	each	each	DET
ap-490	138	15	algorithm	algorithm	NOUN
ap-490	138	16	produced	produce	VERB
ap-490	138	17	a	a	DET
ap-490	138	18	better	well	ADJ
ap-490	138	19	,	,	PUNCT
ap-490	138	20	worse	bad	ADJ
ap-490	138	21	,	,	PUNCT
ap-490	138	22	and	and	CCONJ
ap-490	138	23	equal	equal	ADJ
ap-490	138	24	quality	quality	NOUN
ap-490	138	25	of	of	ADP
ap-490	138	26	schedules	schedule	NOUN
ap-490	138	27	compared	compare	VERB
ap-490	138	28	to	to	ADP
ap-490	138	29	every	every	DET
ap-490	138	30	other	other	ADJ
ap-490	138	31	algorithm	algorithm	NOUN
ap-490	138	32	is	be	AUX
ap-490	138	33	counted	count	VERB
ap-490	138	34	in	in	ADP
ap-490	138	35	the	the	DET
ap-490	138	36	experiments	experiment	NOUN
ap-490	138	37	.	.	PUNCT
ap-490	139	1	4.2	4.2	NUM
ap-490	139	2	random	random	ADJ
ap-490	139	3	graph	graph	NOUN
ap-490	139	4	generator	generator	NOUN
ap-490	139	5	the	the	DET
ap-490	139	6	random	random	ADJ
ap-490	139	7	graph	graph	NOUN
ap-490	139	8	generator	generator	NOUN
ap-490	139	9	was	be	AUX
ap-490	139	10	implemented	implement	VERB
ap-490	139	11	to	to	PART
ap-490	139	12	generate	generate	VERB
ap-490	139	13	weighted	weight	VERB
ap-490	139	14	application	application	NOUN
ap-490	139	15	dags	dag	NOUN
ap-490	139	16	with	with	ADP
ap-490	139	17	various	various	ADJ
ap-490	139	18	characteristics	characteristic	NOUN
ap-490	139	19	that	that	PRON
ap-490	139	20	depend	depend	VERB
ap-490	139	21	on	on	ADP
ap-490	139	22	several	several	ADJ
ap-490	139	23	input	input	NOUN
ap-490	139	24	parameters	parameter	NOUN
ap-490	139	25	.	.	PUNCT
ap-490	140	1	the	the	DET
ap-490	140	2	generator	generator	NOUN
ap-490	140	3	requires	require	VERB
ap-490	140	4	the	the	DET
ap-490	140	5	following	follow	VERB
ap-490	140	6	input	input	NOUN
ap-490	140	7	parameters	parameter	NOUN
ap-490	140	8	to	to	PART
ap-490	140	9	build	build	VERB
ap-490	140	10	weighted	weighted	ADJ
ap-490	140	11	dags	dag	NOUN
ap-490	140	12	.	.	PUNCT
ap-490	141	1	�	�	PROPN
ap-490	141	2	number	number	NOUN
ap-490	141	3	of	of	ADP
ap-490	141	4	tasks	task	NOUN
ap-490	141	5	in	in	ADP
ap-490	141	6	a	a	DET
ap-490	141	7	graph	graph	NOUN
ap-490	141	8	v	v	NOUN
ap-490	141	9	,	,	PUNCT
ap-490	141	10	�	�	PROPN
ap-490	141	11	graph	graph	NOUN
ap-490	141	12	levels	level	NOUN
ap-490	141	13	l	l	NOUN
ap-490	141	14	,	,	PUNCT
ap-490	141	15	�	�	PROPN
ap-490	141	16	communication	communication	NOUN
ap-490	141	17	to	to	PART
ap-490	141	18	computation	computation	VERB
ap-490	141	19	ratio	ratio	PROPN
ap-490	141	20	ccr	ccr	PROPN
ap-490	141	21	,	,	PUNCT
ap-490	141	22	which	which	PRON
ap-490	141	23	is	be	AUX
ap-490	141	24	defined	define	VERB
ap-490	141	25	as	as	ADP
ap-490	141	26	the	the	DET
ap-490	141	27	ratio	ratio	NOUN
ap-490	141	28	of	of	ADP
ap-490	141	29	the	the	DET
ap-490	141	30	average	average	ADJ
ap-490	141	31	communication	communication	NOUN
ap-490	141	32	cost	cost	NOUN
ap-490	141	33	to	to	ADP
ap-490	141	34	the	the	DET
ap-490	141	35	average	average	ADJ
ap-490	141	36	computation	computation	NOUN
ap-490	141	37	cost	cost	NOUN
ap-490	141	38	.	.	PUNCT
ap-490	142	1	in	in	ADP
ap-490	142	2	all	all	DET
ap-490	142	3	experiments	experiment	NOUN
ap-490	142	4	,	,	PUNCT
ap-490	142	5	graphs	graph	NOUN
ap-490	142	6	with	with	ADP
ap-490	142	7	a	a	DET
ap-490	142	8	single	single	ADJ
ap-490	142	9	entry	entry	NOUN
ap-490	142	10	and	and	CCONJ
ap-490	142	11	a	a	DET
ap-490	142	12	single	single	ADJ
ap-490	142	13	exit	exit	NOUN
ap-490	142	14	node	node	NOUN
ap-490	142	15	were	be	AUX
ap-490	142	16	considered	consider	VERB
ap-490	142	17	.	.	PUNCT
ap-490	143	1	in	in	ADP
ap-490	143	2	each	each	DET
ap-490	143	3	experiment	experiment	NOUN
ap-490	143	4	,	,	PUNCT
ap-490	143	5	the	the	DET
ap-490	143	6	values	value	NOUN
ap-490	143	7	of	of	ADP
ap-490	143	8	the	the	DET
ap-490	143	9	previous	previous	ADJ
ap-490	143	10	parameters	parameter	NOUN
ap-490	143	11	are	be	AUX
ap-490	143	12	selected	select	VERB
ap-490	143	13	from	from	ADP
ap-490	143	14	the	the	DET
ap-490	143	15	corresponding	corresponding	ADJ
ap-490	143	16	set	set	NOUN
ap-490	143	17	given	give	VERB
ap-490	143	18	below	below	ADV
ap-490	143	19	.	.	PUNCT
ap-490	144	1	v	v	X
ap-490	144	2	v	v	NUM
ap-490	144	3	l	l	NOUN
ap-490	144	4	v	v	PROPN
ap-490	144	5	ccr	ccr	PROPN
ap-490	144	6	�	�	PROPN
ap-490	144	7	�	�	PROPN
ap-490	144	8	�	�	PROPN
ap-490	144	9	�	�	PROPN
ap-490	144	10	20	20	NUM
ap-490	144	11	30	30	NUM
ap-490	144	12	40	40	NUM
ap-490	144	13	50	50	NUM
ap-490	144	14	60	60	NUM
ap-490	144	15	70	70	NUM
ap-490	144	16	80	80	NUM
ap-490	144	17	90	90	NUM
ap-490	144	18	100	100	NUM
ap-490	144	19	02	02	NUM
ap-490	144	20	08	08	NUM
ap-490	144	21	05	05	NUM
ap-490	144	22	,	,	PUNCT
ap-490	144	23	,	,	PUNCT
ap-490	144	24	,	,	PUNCT
ap-490	144	25	,	,	PUNCT
ap-490	144	26	,	,	PUNCT
ap-490	144	27	,	,	PUNCT
ap-490	144	28	,	,	PUNCT
ap-490	144	29	,	,	PUNCT
ap-490	144	30	,	,	PUNCT
ap-490	144	31	.	.	PUNCT
ap-490	144	32	.	.	PUNCT
ap-490	145	1	,	,	PUNCT
ap-490	145	2	.	.	PUNCT
ap-490	146	1	,	,	PUNCT
ap-490	146	2	10	10	NUM
ap-490	146	3	20	20	NUM
ap-490	146	4	.	.	PUNCT
ap-490	146	5	,	,	PUNCT
ap-490	146	6	.	.	PUNCT
ap-490	146	7	.	.	PUNCT
ap-490	147	1	these	these	DET
ap-490	147	2	input	input	NOUN
ap-490	147	3	parameters	parameter	NOUN
ap-490	147	4	were	be	AUX
ap-490	147	5	used	use	VERB
ap-490	147	6	to	to	PART
ap-490	147	7	generate	generate	VERB
ap-490	147	8	10k	10k	NOUN
ap-490	147	9	different	different	ADJ
ap-490	147	10	dags	dag	NOUN
ap-490	147	11	with	with	ADP
ap-490	147	12	various	various	ADJ
ap-490	147	13	characteristics	characteristic	NOUN
ap-490	147	14	for	for	ADP
ap-490	147	15	each	each	DET
ap-490	147	16	v	v	NOUN
ap-490	147	17	from	from	ADP
ap-490	147	18	the	the	DET
ap-490	147	19	used	use	VERB
ap-490	147	20	v	v	NUM
ap-490	147	21	set	set	NOUN
ap-490	147	22	.	.	PUNCT
ap-490	148	1	4.3	4.3	NUM
ap-490	148	2	performance	performance	NOUN
ap-490	148	3	results	result	VERB
ap-490	148	4	the	the	DET
ap-490	148	5	performances	performance	NOUN
ap-490	148	6	of	of	ADP
ap-490	148	7	the	the	DET
ap-490	148	8	algorithms	algorithm	NOUN
ap-490	148	9	were	be	AUX
ap-490	148	10	compared	compare	VERB
ap-490	148	11	with	with	ADP
ap-490	148	12	respect	respect	NOUN
ap-490	148	13	to	to	ADP
ap-490	148	14	different	different	ADJ
ap-490	148	15	graph	graph	NOUN
ap-490	148	16	size	size	NOUN
ap-490	148	17	.	.	PUNCT
ap-490	149	1	the	the	DET
ap-490	149	2	experiments	experiment	NOUN
ap-490	149	3	were	be	AUX
ap-490	149	4	repeated	repeat	VERB
ap-490	149	5	for	for	ADP
ap-490	149	6	each	each	DET
ap-490	149	7	v	v	NOUN
ap-490	149	8	from	from	ADP
ap-490	149	9	the	the	DET
ap-490	149	10	v	v	NOUN
ap-490	149	11	set	set	NOUN
ap-490	149	12	given	give	VERB
ap-490	149	13	above	above	ADV
ap-490	149	14	.	.	PUNCT
ap-490	150	1	for	for	ADP
ap-490	150	2	each	each	DET
ap-490	150	3	v	v	NOUN
ap-490	150	4	,	,	PUNCT
ap-490	150	5	10k	10k	NOUN
ap-490	150	6	graph	graph	NOUN
ap-490	150	7	were	be	AUX
ap-490	150	8	generated	generate	VERB
ap-490	150	9	using	use	VERB
ap-490	150	10	random	random	ADJ
ap-490	150	11	selection	selection	NOUN
ap-490	150	12	for	for	ADP
ap-490	150	13	ccr	ccr	PROPN
ap-490	150	14	and	and	CCONJ
ap-490	150	15	levels	level	NOUN
ap-490	150	16	(	(	PUNCT
ap-490	150	17	l	l	NOUN
ap-490	150	18	)	)	PUNCT
ap-490	150	19	(	(	PUNCT
ap-490	150	20	given	give	VERB
ap-490	150	21	above	above	ADV
ap-490	150	22	)	)	PUNCT
ap-490	150	23	for	for	ADP
ap-490	150	24	each	each	DET
ap-490	150	25	graph	graph	NOUN
ap-490	150	26	.	.	PUNCT
ap-490	151	1	the	the	DET
ap-490	151	2	average	average	ADJ
ap-490	151	3	slr	slr	NOUN
ap-490	151	4	for	for	ADP
ap-490	151	5	each	each	DET
ap-490	151	6	v	v	NOUN
ap-490	151	7	is	be	AUX
ap-490	151	8	given	give	VERB
ap-490	151	9	in	in	ADP
ap-490	151	10	fig	fig	NOUN
ap-490	151	11	.	.	PUNCT
ap-490	152	1	6	6	NUM
ap-490	152	2	.	.	X
ap-490	152	3	in	in	ADP
ap-490	152	4	general	general	ADJ
ap-490	152	5	the	the	DET
ap-490	152	6	performances	performance	NOUN
ap-490	152	7	of	of	ADP
ap-490	152	8	the	the	DET
ap-490	152	9	dynamic	dynamic	ADJ
ap-490	152	10	algorithms	algorithm	NOUN
ap-490	152	11	are	be	AUX
ap-490	152	12	better	well	ADJ
ap-490	152	13	than	than	ADP
ap-490	152	14	those	those	PRON
ap-490	152	15	of	of	ADP
ap-490	152	16	the	the	DET
ap-490	152	17	static	static	ADJ
ap-490	152	18	ones	one	NOUN
ap-490	152	19	.	.	PUNCT
ap-490	153	1	the	the	DET
ap-490	153	2	static	static	ADJ
ap-490	153	3	algorithms	algorithm	NOUN
ap-490	153	4	have	have	VERB
ap-490	153	5	near	near	ADP
ap-490	153	6	equal	equal	ADJ
ap-490	153	7	performance	performance	NOUN
ap-490	153	8	while	while	SCONJ
ap-490	153	9	the	the	DET
ap-490	153	10	etf	etf	NOUN
ap-490	153	11	algorithm	algorithm	NOUN
ap-490	153	12	is	be	AUX
ap-490	153	13	better	well	ADJ
ap-490	153	14	than	than	ADP
ap-490	153	15	the	the	DET
ap-490	153	16	dls	dls	NOUN
ap-490	153	17	in	in	ADP
ap-490	153	18	the	the	DET
ap-490	153	19	dynamic	dynamic	ADJ
ap-490	153	20	algorithms	algorithm	NOUN
ap-490	153	21	.	.	PUNCT
ap-490	154	1	the	the	DET
ap-490	154	2	average	average	ADJ
ap-490	154	3	speedup	speedup	NOUN
ap-490	154	4	is	be	AUX
ap-490	154	5	given	give	VERB
ap-490	154	6	in	in	ADP
ap-490	154	7	fig	fig	NOUN
ap-490	154	8	.	.	PUNCT
ap-490	155	1	7	7	X
ap-490	155	2	.	.	X
ap-490	155	3	in	in	ADP
ap-490	155	4	general	general	ADJ
ap-490	155	5	,	,	PUNCT
ap-490	155	6	the	the	DET
ap-490	155	7	speed	speed	NOUN
ap-490	155	8	up	up	ADP
ap-490	155	9	of	of	ADP
ap-490	155	10	the	the	DET
ap-490	155	11	dynamic	dynamic	ADJ
ap-490	155	12	algorithms	algorithms	NOUN
ap-490	155	13	is	be	AUX
ap-490	155	14	better	well	ADJ
ap-490	155	15	than	than	ADP
ap-490	155	16	the	the	DET
ap-490	155	17	static	static	ADJ
ap-490	155	18	algorithms	algorithm	NOUN
ap-490	155	19	.	.	PUNCT
ap-490	156	1	the	the	DET
ap-490	156	2	two	two	NUM
ap-490	156	3	dynamic	dynamic	ADJ
ap-490	156	4	algorithms	algorithm	NOUN
ap-490	156	5	have	have	VERB
ap-490	156	6	almost	almost	ADV
ap-490	156	7	the	the	DET
ap-490	156	8	same	same	ADJ
ap-490	156	9	performances	performance	NOUN
ap-490	156	10	,	,	PUNCT
ap-490	156	11	while	while	SCONJ
ap-490	156	12	hlfet	hlfet	NOUN
ap-490	156	13	is	be	AUX
ap-490	156	14	better	well	ADJ
ap-490	156	15	than	than	ADP
ap-490	156	16	mcp	mcp	PROPN
ap-490	156	17	.	.	PROPN
ap-490	157	1	finally	finally	ADV
ap-490	157	2	,	,	PUNCT
ap-490	157	3	the	the	DET
ap-490	157	4	percentage	percentage	NOUN
ap-490	157	5	of	of	ADP
ap-490	157	6	situations	situation	NOUN
ap-490	157	7	that	that	PRON
ap-490	157	8	each	each	DET
ap-490	157	9	scheduling	scheduling	NOUN
ap-490	157	10	algorithm	algorithm	NOUN
ap-490	157	11	in	in	ADP
ap-490	157	12	the	the	DET
ap-490	157	13	experiments	experiment	NOUN
ap-490	157	14	produced	produce	VERB
ap-490	157	15	better	well	ADV
ap-490	157	16	(	(	PUNCT
ap-490	157	17	b	b	NOUN
ap-490	157	18	)	)	PUNCT
ap-490	157	19	,	,	PUNCT
ap-490	157	20	equal	equal	ADJ
ap-490	157	21	(	(	PUNCT
ap-490	157	22	e	e	NOUN
ap-490	157	23	)	)	PUNCT
ap-490	157	24	or	or	CCONJ
ap-490	157	25	worse	bad	ADJ
ap-490	157	26	(	(	PUNCT
ap-490	157	27	w	w	NOUN
ap-490	157	28	)	)	PUNCT
ap-490	157	29	scheduling	scheduling	NOUN
ap-490	157	30	length	length	NOUN
ap-490	157	31	compared	compare	VERB
ap-490	157	32	to	to	ADP
ap-490	157	33	every	every	DET
ap-490	157	34	other	other	ADJ
ap-490	157	35	algorithm	algorithm	NOUN
ap-490	157	36	was	be	AUX
ap-490	157	37	counted	count	VERB
ap-490	157	38	for	for	ADP
ap-490	157	39	90k	90k	NOUN
ap-490	157	40	dags	dag	NOUN
ap-490	157	41	used	use	VERB
ap-490	157	42	.	.	PUNCT
ap-490	158	1	each	each	DET
ap-490	158	2	cell	cell	NOUN
ap-490	158	3	in	in	ADP
ap-490	158	4	table	table	NOUN
ap-490	158	5	5	5	NUM
ap-490	158	6	indicates	indicate	VERB
ap-490	158	7	the	the	DET
ap-490	158	8	comparison	comparison	NOUN
ap-490	158	9	results	result	NOUN
ap-490	158	10	of	of	ADP
ap-490	158	11	the	the	DET
ap-490	158	12	algorithm	algorithm	NOUN
ap-490	158	13	on	on	ADP
ap-490	158	14	the	the	DET
ap-490	158	15	left	left	NOUN
ap-490	158	16	with	with	ADP
ap-490	158	17	the	the	DET
ap-490	158	18	algorithm	algorithm	NOUN
ap-490	158	19	at	at	ADP
ap-490	158	20	the	the	DET
ap-490	158	21	top	top	ADJ
ap-490	158	22	.	.	PUNCT
ap-490	159	1	table	table	NOUN
ap-490	159	2	5	5	NUM
ap-490	159	3	indicates	indicate	VERB
ap-490	159	4	that	that	SCONJ
ap-490	159	5	the	the	DET
ap-490	159	6	dynamic	dynamic	ADJ
ap-490	159	7	algorithms	algorithm	NOUN
ap-490	159	8	are	be	AUX
ap-490	159	9	better	well	ADJ
ap-490	159	10	than	than	ADP
ap-490	159	11	the	the	DET
ap-490	159	12	static	static	ADJ
ap-490	159	13	ones	one	NOUN
ap-490	159	14	.	.	PUNCT
ap-490	160	1	as	as	SCONJ
ap-490	160	2	regards	regard	VERB
ap-490	160	3	the	the	DET
ap-490	160	4	static	static	ADJ
ap-490	160	5	algorithms	algorithm	NOUN
ap-490	160	6	,	,	PUNCT
ap-490	160	7	the	the	DET
ap-490	160	8	hlfet	hlfet	NOUN
ap-490	160	9	algorithm	algorithm	NOUN
ap-490	160	10	is	be	AUX
ap-490	160	11	better	well	ADJ
ap-490	160	12	than	than	ADP
ap-490	160	13	the	the	DET
ap-490	160	14	mcp	mcp	PROPN
ap-490	160	15	,	,	PUNCT
ap-490	160	16	while	while	SCONJ
ap-490	160	17	the	the	DET
ap-490	160	18	dls	dls	PROPN
ap-490	160	19	algorithm	algorithm	NOUN
ap-490	160	20	is	be	AUX
ap-490	160	21	better	well	ADJ
ap-490	160	22	than	than	ADP
ap-490	160	23	the	the	DET
ap-490	160	24	etf	etf	NOUN
ap-490	160	25	algorithm	algorithm	NOUN
ap-490	160	26	as	as	SCONJ
ap-490	160	27	regards	regard	VERB
ap-490	160	28	the	the	DET
ap-490	160	29	dynamic	dynamic	ADJ
ap-490	160	30	algorithms	algorithm	NOUN
ap-490	160	31	.	.	PUNCT
ap-490	161	1	we	we	PRON
ap-490	161	2	note	note	VERB
ap-490	161	3	that	that	SCONJ
ap-490	161	4	the	the	DET
ap-490	161	5	algorithm	algorithm	NOUN
ap-490	161	6	complexity	complexity	NOUN
ap-490	161	7	is	be	AUX
ap-490	161	8	an	an	DET
ap-490	161	9	important	important	ADJ
ap-490	161	10	factor	factor	NOUN
ap-490	161	11	that	that	PRON
ap-490	161	12	has	have	VERB
ap-490	161	13	to	to	PART
ap-490	161	14	be	be	AUX
ap-490	161	15	taken	take	VERB
ap-490	161	16	into	into	ADP
ap-490	161	17	account	account	NOUN
ap-490	161	18	when	when	SCONJ
ap-490	161	19	comparing	compare	VERB
ap-490	161	20	the	the	DET
ap-490	161	21	performance	performance	NOUN
ap-490	161	22	of	of	ADP
ap-490	161	23	different	different	ADJ
ap-490	161	24	algorithms	algorithm	NOUN
ap-490	161	25	.	.	PUNCT
ap-490	162	1	as	as	SCONJ
ap-490	162	2	shown	show	VERB
ap-490	162	3	in	in	ADP
ap-490	162	4	table	table	NOUN
ap-490	162	5	6	6	NUM
ap-490	162	6	,	,	PUNCT
ap-490	162	7	the	the	DET
ap-490	162	8	complexity	complexity	NOUN
ap-490	162	9	of	of	ADP
ap-490	162	10	the	the	DET
ap-490	162	11	dynamic	dynamic	ADJ
ap-490	162	12	algorithms	algorithms	NOUN
ap-490	162	13	is	be	AUX
ap-490	162	14	much	much	ADV
ap-490	162	15	higher	high	ADJ
ap-490	162	16	than	than	ADP
ap-490	162	17	20	20	NUM
ap-490	162	18	©	©	PROPN
ap-490	162	19	czech	czech	PROPN
ap-490	162	20	technical	technical	PROPN
ap-490	162	21	university	university	PROPN
ap-490	162	22	publishing	publishing	NOUN
ap-490	162	23	house	house	NOUN
ap-490	162	24	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-490	162	25	acta	acta	PROPN
ap-490	162	26	polytechnica	polytechnica	PROPN
ap-490	162	27	vol	vol	NOUN
ap-490	162	28	.	.	PUNCT
ap-490	163	1	43	43	NUM
ap-490	163	2	no	no	NOUN
ap-490	163	3	.	.	PUNCT
ap-490	164	1	6/2003	6/2003	NUM
ap-490	164	2	fig	fig	NOUN
ap-490	164	3	.	.	PUNCT
ap-490	165	1	6	6	NUM
ap-490	165	2	:	:	PUNCT
ap-490	165	3	average	average	ADJ
ap-490	165	4	slr	slr	NOUN
ap-490	165	5	fig	fig	NOUN
ap-490	165	6	.	.	PUNCT
ap-490	166	1	7	7	NUM
ap-490	166	2	:	:	PUNCT
ap-490	166	3	average	average	ADJ
ap-490	166	4	speedup	speedup	NOUN
ap-490	166	5	hlfet	hlfet	PROPN
ap-490	166	6	mcp	mcp	PROPN
ap-490	166	7	etf	etf	PROPN
ap-490	166	8	dls	dls	PROPN
ap-490	166	9	b	b	PROPN
ap-490	166	10	49.15	49.15	NUM
ap-490	166	11	%	%	NOUN
ap-490	166	12	37.75	37.75	NUM
ap-490	166	13	%	%	NOUN
ap-490	166	14	22.62	22.62	NUM
ap-490	166	15	%	%	NOUN
ap-490	166	16	hlfet	hlfet	NOUN
ap-490	166	17	e	e	NOUN
ap-490	166	18	12.47	12.47	NUM
ap-490	166	19	%	%	NOUN
ap-490	166	20	22.37	22.37	NUM
ap-490	166	21	%	%	NOUN
ap-490	166	22	42.17	42.17	NUM
ap-490	166	23	%	%	NOUN
ap-490	166	24	w	w	NOUN
ap-490	166	25	38.39	38.39	NUM
ap-490	166	26	%	%	NOUN
ap-490	166	27	39.89	39.89	NUM
ap-490	166	28	%	%	NOUN
ap-490	166	29	35.22	35.22	NUM
ap-490	166	30	%	%	NOUN
ap-490	166	31	b	b	PROPN
ap-490	166	32	38.39	38.39	NUM
ap-490	166	33	%	%	NOUN
ap-490	166	34	40.84	40.84	NUM
ap-490	166	35	%	%	NOUN
ap-490	166	36	36.41	36.41	NUM
ap-490	166	37	%	%	NOUN
ap-490	166	38	mcp	mcp	PROPN
ap-490	166	39	e	e	PROPN
ap-490	166	40	12.47	12.47	NUM
ap-490	166	41	%	%	NOUN
ap-490	166	42	5.84	5.84	NUM
ap-490	166	43	%	%	NOUN
ap-490	166	44	8.35	8.35	NUM
ap-490	166	45	%	%	NOUN
ap-490	166	46	w	w	PROPN
ap-490	166	47	49.15	49.15	NUM
ap-490	166	48	%	%	NOUN
ap-490	166	49	53.33	53.33	NUM
ap-490	166	50	%	%	NOUN
ap-490	166	51	55.24	55.24	NUM
ap-490	166	52	%	%	NOUN
ap-490	166	53	b	b	NOUN
ap-490	166	54	39.89	39.89	NUM
ap-490	166	55	%	%	NOUN
ap-490	166	56	53.33	53.33	NUM
ap-490	166	57	%	%	NOUN
ap-490	166	58	26.93	26.93	NUM
ap-490	166	59	%	%	NOUN
ap-490	166	60	etf	etf	NOUN
ap-490	166	61	e	e	PROPN
ap-490	166	62	22.37	22.37	NUM
ap-490	166	63	%	%	NOUN
ap-490	166	64	5.84	5.84	NUM
ap-490	166	65	%	%	NOUN
ap-490	166	66	39.53	39.53	NUM
ap-490	166	67	%	%	NOUN
ap-490	166	68	w	w	NOUN
ap-490	166	69	37.75	37.75	NUM
ap-490	166	70	%	%	NOUN
ap-490	166	71	40.84	40.84	NUM
ap-490	166	72	%	%	NOUN
ap-490	166	73	33.54	33.54	NUM
ap-490	166	74	%	%	NOUN
ap-490	166	75	b	b	PROPN
ap-490	166	76	35.22	35.22	NUM
ap-490	166	77	%	%	NOUN
ap-490	166	78	55.24	55.24	NUM
ap-490	166	79	%	%	NOUN
ap-490	166	80	33.54	33.54	NUM
ap-490	166	81	%	%	NOUN
ap-490	166	82	dls	dls	PROPN
ap-490	166	83	e	e	X
ap-490	166	84	42.17	42.17	NUM
ap-490	166	85	%	%	NOUN
ap-490	166	86	8.35	8.35	NUM
ap-490	166	87	%	%	NOUN
ap-490	166	88	39.43	39.43	NUM
ap-490	166	89	%	%	NOUN
ap-490	166	90	w	w	PROPN
ap-490	166	91	22.62	22.62	NUM
ap-490	166	92	%	%	NOUN
ap-490	166	93	36.41	36.41	NUM
ap-490	166	94	%	%	NOUN
ap-490	166	95	26.93	26.93	NUM
ap-490	166	96	%	%	NOUN
ap-490	166	97	table	table	NOUN
ap-490	166	98	5	5	NUM
ap-490	166	99	:	:	PUNCT
ap-490	166	100	pair	pair	NOUN
ap-490	166	101	-	-	PUNCT
ap-490	166	102	wise	wise	ADJ
ap-490	166	103	comparison	comparison	NOUN
ap-490	166	104	of	of	ADP
ap-490	166	105	the	the	DET
ap-490	166	106	examined	examine	VERB
ap-490	166	107	algorithms	algorithm	NOUN
ap-490	166	108	that	that	PRON
ap-490	166	109	of	of	ADP
ap-490	166	110	static	static	ADJ
ap-490	166	111	ones	one	NOUN
ap-490	166	112	.	.	PUNCT
ap-490	167	1	this	this	PRON
ap-490	167	2	makes	make	VERB
ap-490	167	3	it	it	PRON
ap-490	167	4	unfair	unfair	ADJ
ap-490	167	5	if	if	SCONJ
ap-490	167	6	the	the	DET
ap-490	167	7	static	static	ADJ
ap-490	167	8	algorithm	algorithm	NOUN
ap-490	167	9	gives	give	VERB
ap-490	167	10	the	the	DET
ap-490	167	11	same	same	ADJ
ap-490	167	12	schedule	schedule	NOUN
ap-490	167	13	length	length	NOUN
ap-490	167	14	as	as	ADP
ap-490	167	15	the	the	DET
ap-490	167	16	dynamic	dynamic	ADJ
ap-490	167	17	one	one	NOUN
ap-490	167	18	,	,	PUNCT
ap-490	167	19	to	to	PART
ap-490	167	20	consider	consider	VERB
ap-490	167	21	it	it	PRON
ap-490	167	22	as	as	ADP
ap-490	167	23	an	an	DET
ap-490	167	24	equivalent	equivalent	ADJ
ap-490	167	25	trial	trial	NOUN
ap-490	167	26	.	.	PUNCT
ap-490	168	1	if	if	SCONJ
ap-490	168	2	we	we	PRON
ap-490	168	3	consider	consider	VERB
ap-490	168	4	the	the	DET
ap-490	168	5	equivalent	equivalent	ADJ
ap-490	168	6	scheduling	scheduling	NOUN
ap-490	168	7	length	length	NOUN
ap-490	168	8	of	of	ADP
ap-490	168	9	two	two	NUM
ap-490	168	10	algorithms	algorithm	NOUN
ap-490	168	11	as	as	ADP
ap-490	168	12	a	a	DET
ap-490	168	13	better	well	ADJ
ap-490	168	14	trial	trial	NOUN
ap-490	168	15	of	of	ADP
ap-490	168	16	the	the	DET
ap-490	168	17	lowest	low	ADJ
ap-490	168	18	complexity	complexity	NOUN
ap-490	168	19	algorithm	algorithm	NOUN
ap-490	168	20	,	,	PUNCT
ap-490	168	21	the	the	DET
ap-490	168	22	better	well	ADJ
ap-490	168	23	,	,	PUNCT
ap-490	168	24	equal	equal	ADJ
ap-490	168	25	,	,	PUNCT
ap-490	168	26	and	and	CCONJ
ap-490	168	27	worse	bad	ADJ
ap-490	168	28	comparison	comparison	NOUN
ap-490	168	29	between	between	ADP
ap-490	168	30	the	the	DET
ap-490	168	31	examined	examine	VERB
ap-490	168	32	algorithms	algorithm	NOUN
ap-490	168	33	will	will	AUX
ap-490	168	34	be	be	AUX
ap-490	168	35	as	as	SCONJ
ap-490	168	36	shown	show	VERB
ap-490	168	37	in	in	ADP
ap-490	168	38	table	table	NOUN
ap-490	168	39	7	7	NUM
ap-490	168	40	.	.	PUNCT
ap-490	169	1	4.4	4.4	NUM
ap-490	169	2	.	.	PUNCT
ap-490	170	1	ranking	rank	VERB
ap-490	170	2	of	of	ADP
ap-490	170	3	examined	examine	VERB
ap-490	170	4	algorithms	algorithm	NOUN
ap-490	170	5	based	base	VERB
ap-490	170	6	on	on	ADP
ap-490	170	7	the	the	DET
ap-490	170	8	above	above	ADJ
ap-490	170	9	comparison	comparison	NOUN
ap-490	170	10	metrics	metric	NOUN
ap-490	170	11	and	and	CCONJ
ap-490	170	12	the	the	DET
ap-490	170	13	average	average	ADJ
ap-490	170	14	results	result	NOUN
ap-490	170	15	for	for	ADP
ap-490	170	16	90k	90k	NUM
ap-490	170	17	randomly	randomly	ADV
ap-490	170	18	generated	generate	VERB
ap-490	170	19	dags	dag	NOUN
ap-490	170	20	,	,	PUNCT
ap-490	170	21	the	the	DET
ap-490	170	22	ranking	ranking	NOUN
ap-490	170	23	for	for	ADP
ap-490	170	24	the	the	DET
ap-490	170	25	examined	examine	VERB
ap-490	170	26	algorithms	algorithms	NOUN
ap-490	170	27	was	be	AUX
ap-490	170	28	as	as	SCONJ
ap-490	170	29	follows	follow	VERB
ap-490	170	30	:	:	PUNCT
ap-490	170	31	average	average	ADJ
ap-490	170	32	makespan	makespan	ADV
ap-490	170	33	:	:	PUNCT
ap-490	170	34	dls	dls	PROPN
ap-490	170	35	etf	etf	PROPN
ap-490	170	36	hlfet	hlfet	PROPN
ap-490	170	37	mcp	mcp	PROPN
ap-490	170	38	average	average	ADJ
ap-490	170	39	speedup	speedup	NOUN
ap-490	170	40	:	:	PUNCT
ap-490	170	41	dls	dls	PROPN
ap-490	170	42	etf	etf	PROPN
ap-490	170	43	hlfet	hlfet	PROPN
ap-490	170	44	mcp	mcp	PROPN
ap-490	170	45	average	average	ADJ
ap-490	170	46	slr	slr	NOUN
ap-490	170	47	:	:	PUNCT
ap-490	170	48	etf	etf	NOUN
ap-490	170	49	dls	dls	PROPN
ap-490	170	50	mcp	mcp	PROPN
ap-490	170	51	hlfet	hlfet	PROPN
ap-490	170	52	best	good	ADJ
ap-490	170	53	results	result	NOUN
ap-490	170	54	:	:	PUNCT
ap-490	170	55	dls	dls	PROPN
ap-490	170	56	etf	etf	PROPN
ap-490	170	57	mcp	mcp	PROPN
ap-490	170	58	hlfet	hlfet	PROPN
ap-490	170	59	complexity	complexity	NOUN
ap-490	170	60	:	:	PUNCT
ap-490	170	61	hlfet	hlfet	NOUN
ap-490	170	62	&	&	CCONJ
ap-490	170	63	mcp	mcp	PROPN
ap-490	170	64	dls	dls	PROPN
ap-490	170	65	&	&	CCONJ
ap-490	170	66	etf	etf	PROPN
ap-490	170	67	5	5	NUM
ap-490	170	68	conclusion	conclusion	NOUN
ap-490	170	69	in	in	ADP
ap-490	170	70	this	this	DET
ap-490	170	71	paper	paper	NOUN
ap-490	170	72	we	we	PRON
ap-490	170	73	present	present	VERB
ap-490	170	74	a	a	DET
ap-490	170	75	brief	brief	ADJ
ap-490	170	76	description	description	NOUN
ap-490	170	77	of	of	ADP
ap-490	170	78	the	the	DET
ap-490	170	79	characteristics	characteristic	NOUN
ap-490	170	80	of	of	ADP
ap-490	170	81	the	the	DET
ap-490	170	82	two	two	NUM
ap-490	170	83	most	most	ADV
ap-490	170	84	known	know	VERB
ap-490	170	85	static	static	NOUN
ap-490	170	86	and	and	CCONJ
ap-490	170	87	also	also	ADV
ap-490	170	88	the	the	DET
ap-490	170	89	two	two	NUM
ap-490	170	90	most	most	ADV
ap-490	170	91	known	know	VERB
ap-490	170	92	dynamic	dynamic	ADJ
ap-490	170	93	list	list	NOUN
ap-490	170	94	-	-	PUNCT
ap-490	170	95	scheduling	scheduling	NOUN
ap-490	170	96	algorithms	algorithm	NOUN
ap-490	170	97	.	.	PUNCT
ap-490	171	1	the	the	DET
ap-490	171	2	performances	performance	NOUN
ap-490	171	3	of	of	ADP
ap-490	171	4	these	these	DET
ap-490	171	5	algorithms	algorithm	NOUN
ap-490	171	6	were	be	AUX
ap-490	171	7	examined	examine	VERB
ap-490	171	8	using	use	VERB
ap-490	171	9	variant	variant	ADJ
ap-490	171	10	random	random	ADJ
ap-490	171	11	generated	generate	VERB
ap-490	171	12	graphs	graph	NOUN
ap-490	171	13	.	.	PUNCT
ap-490	172	1	six	six	NUM
ap-490	172	2	comparison	comparison	NOUN
ap-490	172	3	matrices	matrix	NOUN
ap-490	172	4	were	be	AUX
ap-490	172	5	used	use	VERB
ap-490	172	6	to	to	PART
ap-490	172	7	measure	measure	VERB
ap-490	172	8	their	their	PRON
ap-490	172	9	performance	performance	NOUN
ap-490	172	10	.	.	PUNCT
ap-490	173	1	in	in	ADP
ap-490	173	2	general	general	ADJ
ap-490	173	3	the	the	DET
ap-490	173	4	dynamic	dynamic	ADJ
ap-490	173	5	list	list	NOUN
ap-490	173	6	-	-	PUNCT
ap-490	173	7	scheduling	schedule	VERB
ap-490	173	8	algorithms	algorithm	NOUN
ap-490	173	9	performed	perform	VERB
ap-490	173	10	better	well	ADV
ap-490	173	11	than	than	ADP
ap-490	173	12	the	the	DET
ap-490	173	13	static	static	ADJ
ap-490	173	14	list	list	NOUN
ap-490	173	15	-	-	PUNCT
ap-490	173	16	scheduling	scheduling	NOUN
ap-490	173	17	algorithms	algorithm	NOUN
ap-490	173	18	.	.	PUNCT
ap-490	174	1	for	for	ADP
ap-490	174	2	the	the	DET
ap-490	174	3	static	static	ADJ
ap-490	174	4	list	list	NOUN
ap-490	174	5	-	-	PUNCT
ap-490	174	6	scheduling	scheduling	NOUN
ap-490	174	7	algorithms	algorithm	NOUN
ap-490	174	8	,	,	PUNCT
ap-490	174	9	the	the	DET
ap-490	174	10	hlfet	hlfet	NOUN
ap-490	174	11	performed	perform	VERB
ap-490	174	12	better	well	ADV
ap-490	174	13	than	than	ADP
ap-490	174	14	mcp	mcp	PROPN
ap-490	174	15	and	and	CCONJ
ap-490	174	16	for	for	ADP
ap-490	174	17	the	the	DET
ap-490	174	18	dynamic	dynamic	ADJ
ap-490	174	19	list	list	NOUN
ap-490	174	20	-	-	PUNCT
ap-490	174	21	scheduling	scheduling	NOUN
ap-490	174	22	algorithms	algorithm	NOUN
ap-490	174	23	,	,	PUNCT
ap-490	174	24	the	the	DET
ap-490	174	25	dls	dls	PROPN
ap-490	174	26	algorithm	algorithm	NOUN
ap-490	174	27	performed	perform	VERB
ap-490	174	28	better	well	ADV
ap-490	174	29	than	than	ADP
ap-490	174	30	the	the	DET
ap-490	174	31	etf	etf	NOUN
ap-490	174	32	algorithm	algorithm	NOUN
ap-490	174	33	.	.	PUNCT
ap-490	175	1	if	if	SCONJ
ap-490	175	2	the	the	DET
ap-490	175	3	complexities	complexity	NOUN
ap-490	175	4	of	of	ADP
ap-490	175	5	the	the	DET
ap-490	175	6	algorithms	algorithm	NOUN
ap-490	175	7	are	be	AUX
ap-490	175	8	taken	take	VERB
ap-490	175	9	into	into	ADP
ap-490	175	10	account	account	NOUN
ap-490	175	11	,	,	PUNCT
ap-490	175	12	it	it	PRON
ap-490	175	13	is	be	AUX
ap-490	175	14	highly	highly	ADV
ap-490	175	15	recommended	recommend	VERB
ap-490	175	16	to	to	PART
ap-490	175	17	use	use	VERB
ap-490	175	18	static	static	ADJ
ap-490	175	19	list	list	NOUN
ap-490	175	20	-	-	PUNCT
ap-490	175	21	scheduling	scheduling	NOUN
ap-490	175	22	.	.	PUNCT
ap-490	176	1	references	reference	NOUN
ap-490	176	2	[	[	X
ap-490	176	3	1	1	NUM
ap-490	176	4	]	]	X
ap-490	176	5	feitelson	feitelson	PROPN
ap-490	176	6	d.	d.	PROPN
ap-490	176	7	,	,	PUNCT
ap-490	176	8	rudolph	rudolph	PROPN
ap-490	176	9	l.	l.	PROPN
ap-490	176	10	,	,	PUNCT
ap-490	176	11	schwiegelshohm	schwiegelshohm	PROPN
ap-490	176	12	u.	u.	PROPN
ap-490	176	13	,	,	PUNCT
ap-490	176	14	sevcik	sevcik	PROPN
ap-490	176	15	k.	k.	PROPN
ap-490	176	16	,	,	PUNCT
ap-490	176	17	wong	wong	PROPN
ap-490	176	18	p.	p.	PROPN
ap-490	176	19	:	:	PUNCT
ap-490	176	20	theory	theory	NOUN
ap-490	176	21	and	and	CCONJ
ap-490	176	22	practice	practice	NOUN
ap-490	176	23	in	in	ADP
ap-490	176	24	parallel	parallel	ADJ
ap-490	176	25	job	job	NOUN
ap-490	176	26	scheduling	scheduling	NOUN
ap-490	176	27	.	.	PUNCT
ap-490	177	1	jsspp	jsspp	NOUN
ap-490	177	2	,	,	PUNCT
ap-490	177	3	1997	1997	NUM
ap-490	177	4	,	,	PUNCT
ap-490	177	5	p.	p.	NOUN
ap-490	177	6	1–34	1–34	NUM
ap-490	177	7	.	.	PUNCT
ap-490	178	1	[	[	X
ap-490	178	2	2	2	X
ap-490	178	3	]	]	PUNCT
ap-490	178	4	kwok	kwok	PROPN
ap-490	178	5	y.	y.	PROPN
ap-490	178	6	,	,	PUNCT
ap-490	178	7	ahmed	ahmed	PROPN
ap-490	178	8	i.	i.	PROPN
ap-490	178	9	:	:	PUNCT
ap-490	178	10	benchmarking	benchmarke	VERB
ap-490	178	11	the	the	DET
ap-490	178	12	task	task	NOUN
ap-490	178	13	graph	graph	NOUN
ap-490	178	14	scheduling	scheduling	NOUN
ap-490	178	15	algorithms	algorithm	NOUN
ap-490	178	16	.	.	PUNCT
ap-490	179	1	proc	proc	NOUN
ap-490	179	2	.	.	PUNCT
ap-490	180	1	ipps	ipps	PROPN
ap-490	180	2	/	/	SYM
ap-490	180	3	spdp	spdp	PROPN
ap-490	180	4	,	,	PUNCT
ap-490	180	5	1998	1998	NUM
ap-490	180	6	.	.	PUNCT
ap-490	181	1	[	[	X
ap-490	181	2	3	3	X
ap-490	181	3	]	]	X
ap-490	181	4	liou	liou	PROPN
ap-490	181	5	j.	j.	PROPN
ap-490	181	6	,	,	PUNCT
ap-490	181	7	palis	palis	PROPN
ap-490	181	8	m.	m.	VERB
ap-490	181	9	:	:	PUNCT
ap-490	181	10	a	a	DET
ap-490	181	11	comparison	comparison	NOUN
ap-490	181	12	of	of	ADP
ap-490	181	13	general	general	ADJ
ap-490	181	14	approaches	approach	NOUN
ap-490	181	15	to	to	ADP
ap-490	181	16	multiprocessor	multiprocessor	NOUN
ap-490	181	17	scheduling	scheduling	NOUN
ap-490	181	18	.	.	PUNCT
ap-490	182	1	proc	proc	NOUN
ap-490	182	2	.	.	PUNCT
ap-490	183	1	int’l	int’l	PRON
ap-490	183	2	parallel	parallel	ADJ
ap-490	183	3	processing	processing	NOUN
ap-490	183	4	symp	symp	NOUN
ap-490	183	5	.	.	PUNCT
ap-490	183	6	,	,	PUNCT
ap-490	183	7	1997	1997	NUM
ap-490	183	8	,	,	PUNCT
ap-490	183	9	p.	p.	NOUN
ap-490	183	10	152–156	152–156	NUM
ap-490	183	11	.	.	PUNCT
ap-490	184	1	[	[	X
ap-490	184	2	4	4	X
ap-490	184	3	]	]	X
ap-490	184	4	khan	khan	PROPN
ap-490	184	5	a.	a.	PROPN
ap-490	184	6	,	,	PUNCT
ap-490	184	7	mccreary	mccreary	PROPN
ap-490	184	8	c.	c.	PROPN
ap-490	184	9	,	,	PUNCT
ap-490	184	10	jones	jones	PROPN
ap-490	184	11	m.	m.	PROPN
ap-490	184	12	:	:	PUNCT
ap-490	184	13	a	a	DET
ap-490	184	14	comparison	comparison	NOUN
ap-490	184	15	of	of	ADP
ap-490	184	16	multiprocessor	multiprocessor	NOUN
ap-490	184	17	scheduling	scheduling	NOUN
ap-490	184	18	heuristics	heuristic	NOUN
ap-490	184	19	.	.	PUNCT
ap-490	185	1	icpp	icpp	PROPN
ap-490	185	2	,	,	PUNCT
ap-490	185	3	1994	1994	NUM
ap-490	185	4	,	,	PUNCT
ap-490	185	5	vol	vol	NOUN
ap-490	185	6	.	.	PROPN
ap-490	185	7	2	2	NUM
ap-490	185	8	,	,	PUNCT
ap-490	185	9	p.	p.	NOUN
ap-490	185	10	243–250	243–250	NUM
ap-490	185	11	.	.	PUNCT
ap-490	186	1	[	[	X
ap-490	186	2	5	5	NUM
ap-490	186	3	]	]	X
ap-490	186	4	gerasoulis	gerasoulis	PROPN
ap-490	186	5	a.	a.	PROPN
ap-490	186	6	,	,	PUNCT
ap-490	186	7	yang	yang	PROPN
ap-490	186	8	t.	t.	PROPN
ap-490	186	9	:	:	PUNCT
ap-490	186	10	a	a	DET
ap-490	186	11	comparison	comparison	NOUN
ap-490	186	12	of	of	ADP
ap-490	186	13	clustering	clustering	ADJ
ap-490	186	14	heuristics	heuristic	NOUN
ap-490	186	15	for	for	ADP
ap-490	186	16	scheduling	scheduling	NOUN
ap-490	186	17	dags	dag	NOUN
ap-490	186	18	on	on	ADP
ap-490	186	19	multiprocessors	multiprocessor	NOUN
ap-490	186	20	.	.	PUNCT
ap-490	187	1	journal	journal	NOUN
ap-490	187	2	of	of	ADP
ap-490	187	3	parallel	parallel	ADJ
ap-490	187	4	and	and	CCONJ
ap-490	187	5	distributed	distributed	ADJ
ap-490	187	6	computing	computing	NOUN
ap-490	187	7	,	,	PUNCT
ap-490	187	8	1992	1992	NUM
ap-490	187	9	,	,	PUNCT
ap-490	187	10	vol	vol	NOUN
ap-490	187	11	.	.	PROPN
ap-490	187	12	16	16	NUM
ap-490	187	13	,	,	PUNCT
ap-490	187	14	p.	p.	NOUN
ap-490	187	15	276–291	276–291	NUM
ap-490	187	16	.	.	PUNCT
ap-490	188	1	[	[	X
ap-490	188	2	6	6	NUM
ap-490	188	3	]	]	PUNCT
ap-490	188	4	gerasoulis	gerasoulis	PROPN
ap-490	188	5	a.	a.	PROPN
ap-490	188	6	,	,	PUNCT
ap-490	188	7	yang	yang	PROPN
ap-490	188	8	t.	t.	PROPN
ap-490	188	9	:	:	PUNCT
ap-490	188	10	on	on	ADP
ap-490	188	11	the	the	DET
ap-490	188	12	granularity	granularity	NOUN
ap-490	188	13	and	and	CCONJ
ap-490	188	14	clustering	clustering	NOUN
ap-490	188	15	of	of	ADP
ap-490	188	16	directed	direct	VERB
ap-490	188	17	acyclic	acyclic	ADJ
ap-490	188	18	task	task	NOUN
ap-490	188	19	graphs	graph	NOUN
ap-490	188	20	.	.	PUNCT
ap-490	189	1	ieee	ieee	PROPN
ap-490	189	2	trans	trans	PROPN
ap-490	189	3	.	.	PUNCT
ap-490	190	1	parallel	parallel	ADJ
ap-490	190	2	and	and	CCONJ
ap-490	190	3	distributed	distributed	ADJ
ap-490	190	4	systems	system	NOUN
ap-490	190	5	,	,	PUNCT
ap-490	190	6	1993	1993	NUM
ap-490	190	7	,	,	PUNCT
ap-490	190	8	vol	vol	NOUN
ap-490	190	9	.	.	PROPN
ap-490	191	1	4	4	NUM
ap-490	191	2	,	,	PUNCT
ap-490	191	3	no	no	INTJ
ap-490	191	4	.	.	NOUN
ap-490	191	5	6	6	NUM
ap-490	191	6	,	,	PUNCT
ap-490	191	7	p.	p.	NOUN
ap-490	191	8	686–701	686–701	NUM
ap-490	191	9	.	.	PUNCT
ap-490	192	1	[	[	X
ap-490	192	2	7	7	X
ap-490	192	3	]	]	X
ap-490	192	4	zhou	zhou	PROPN
ap-490	192	5	h.	h.	PROPN
ap-490	192	6	:	:	PUNCT
ap-490	192	7	scheduling	scheduling	NOUN
ap-490	192	8	dags	dag	NOUN
ap-490	192	9	on	on	ADP
ap-490	192	10	a	a	DET
ap-490	192	11	bounded	bounded	ADJ
ap-490	192	12	number	number	NOUN
ap-490	192	13	of	of	ADP
ap-490	192	14	processors	processor	NOUN
ap-490	192	15	.	.	PUNCT
ap-490	193	1	int’l	int’l	NUM
ap-490	193	2	conf	conf	NOUN
ap-490	193	3	.	.	PUNCT
ap-490	193	4	,	,	PUNCT
ap-490	193	5	parallel	parallel	ADJ
ap-490	193	6	and	and	CCONJ
ap-490	193	7	distributed	distribute	VERB
ap-490	193	8	processing	processing	NOUN
ap-490	193	9	techniques	technique	NOUN
ap-490	193	10	and	and	CCONJ
ap-490	193	11	applications	application	NOUN
ap-490	193	12	,	,	PUNCT
ap-490	193	13	1996	1996	NUM
ap-490	193	14	.	.	PUNCT
ap-490	194	1	[	[	X
ap-490	194	2	8	8	NUM
ap-490	194	3	]	]	SYM
ap-490	194	4	min	min	NOUN
ap-490	194	5	-	-	PROPN
ap-490	194	6	you	you	PRON
ap-490	194	7	w.	w.	PROPN
ap-490	194	8	,	,	PUNCT
ap-490	194	9	gajski	gajski	PROPN
ap-490	194	10	d.	d.	PROPN
ap-490	194	11	:	:	PUNCT
ap-490	195	1	hypertool	hypertool	PROPN
ap-490	195	2	:	:	PUNCT
ap-490	195	3	a	a	DET
ap-490	195	4	programming	programming	NOUN
ap-490	195	5	aid	aid	NOUN
ap-490	195	6	for	for	ADP
ap-490	195	7	message	message	NOUN
ap-490	195	8	-	-	PUNCT
ap-490	195	9	passing	pass	VERB
ap-490	195	10	systems	system	NOUN
ap-490	195	11	.	.	PUNCT
ap-490	196	1	ieee	ieee	PROPN
ap-490	196	2	trans	trans	PROPN
ap-490	196	3	.	.	PUNCT
ap-490	197	1	parallel	parallel	ADJ
ap-490	197	2	and	and	CCONJ
ap-490	197	3	distributed	distributed	ADJ
ap-490	197	4	systems	system	NOUN
ap-490	197	5	,	,	PUNCT
ap-490	197	6	1990	1990	NUM
ap-490	197	7	,	,	PUNCT
ap-490	197	8	vol	vol	NOUN
ap-490	197	9	.	.	PROPN
ap-490	198	1	1	1	NUM
ap-490	198	2	,	,	PUNCT
ap-490	198	3	no	no	INTJ
ap-490	198	4	.	.	NOUN
ap-490	198	5	3	3	X
ap-490	198	6	.	.	PUNCT
ap-490	199	1	[	[	X
ap-490	199	2	9	9	NUM
ap-490	199	3	]	]	X
ap-490	199	4	hwang	hwang	PROPN
ap-490	199	5	j.	j.	PROPN
ap-490	199	6	,	,	PUNCT
ap-490	199	7	chow	chow	PROPN
ap-490	199	8	y.	y.	PROPN
ap-490	199	9	,	,	PUNCT
ap-490	199	10	anger	anger	PROPN
ap-490	199	11	e.	e.	PROPN
ap-490	199	12	,	,	PUNCT
ap-490	199	13	lee	lee	PROPN
ap-490	199	14	c.	c.	PROPN
ap-490	199	15	:	:	PUNCT
ap-490	199	16	scheduling	scheduling	NOUN
ap-490	199	17	precedence	precedence	NOUN
ap-490	199	18	graphs	graph	NOUN
ap-490	199	19	in	in	ADP
ap-490	199	20	systems	system	NOUN
ap-490	199	21	with	with	ADP
ap-490	199	22	interprocessor	interprocessor	NOUN
ap-490	199	23	communication	communication	NOUN
ap-490	199	24	times	time	NOUN
ap-490	199	25	.	.	PUNCT
ap-490	200	1	siam	siam	PROPN
ap-490	200	2	journal	journal	PROPN
ap-490	200	3	on	on	ADP
ap-490	200	4	computing	computing	NOUN
ap-490	200	5	,	,	PUNCT
ap-490	200	6	1989	1989	NUM
ap-490	200	7	,	,	PUNCT
ap-490	200	8	vol	vol	NOUN
ap-490	200	9	.	.	PROPN
ap-490	200	10	18	18	NUM
ap-490	200	11	,	,	PUNCT
ap-490	200	12	no	no	INTJ
ap-490	200	13	.	.	NOUN
ap-490	200	14	2	2	NUM
ap-490	200	15	,	,	PUNCT
ap-490	200	16	p.	p.	NOUN
ap-490	200	17	244–257	244–257	NUM
ap-490	200	18	.	.	PUNCT
ap-490	201	1	[	[	X
ap-490	201	2	10	10	NUM
ap-490	201	3	]	]	X
ap-490	201	4	sih	sih	PROPN
ap-490	201	5	g.	g.	PROPN
ap-490	201	6	,	,	PUNCT
ap-490	201	7	lee	lee	PROPN
ap-490	201	8	e.	e.	PROPN
ap-490	201	9	:	:	PUNCT
ap-490	201	10	a	a	DET
ap-490	201	11	compile	compile	NOUN
ap-490	201	12	-	-	PUNCT
ap-490	201	13	time	time	NOUN
ap-490	201	14	scheduling	scheduling	NOUN
ap-490	201	15	heuristic	heuristic	NOUN
ap-490	201	16	for	for	ADP
ap-490	201	17	interconnection	interconnection	NOUN
ap-490	201	18	-	-	PUNCT
ap-490	201	19	constrained	constrain	VERB
ap-490	201	20	heterogeneous	heterogeneous	ADJ
ap-490	201	21	processor	processor	NOUN
ap-490	201	22	architectures	architecture	NOUN
ap-490	201	23	.	.	PUNCT
ap-490	202	1	ieee	ieee	PROPN
ap-490	202	2	trans	trans	PROPN
ap-490	202	3	.	.	PUNCT
ap-490	203	1	in	in	ADP
ap-490	203	2	parallel	parallel	ADJ
ap-490	203	3	and	and	CCONJ
ap-490	203	4	distributed	distributed	ADJ
ap-490	203	5	systems	system	NOUN
ap-490	203	6	,	,	PUNCT
ap-490	203	7	1993	1993	NUM
ap-490	203	8	,	,	PUNCT
ap-490	203	9	vol	vol	NOUN
ap-490	203	10	.	.	PROPN
ap-490	203	11	4	4	NUM
ap-490	203	12	,	,	PUNCT
ap-490	203	13	no	no	INTJ
ap-490	203	14	.	.	NOUN
ap-490	203	15	2	2	NUM
ap-490	203	16	,	,	PUNCT
ap-490	203	17	p.	p.	NOUN
ap-490	203	18	75–87	75–87	PROPN
ap-490	203	19	.	.	PUNCT
ap-490	204	1	ing	ing	ADJ
ap-490	204	2	.	.	PUNCT
ap-490	205	1	tarek	tarek	PROPN
ap-490	205	2	hagras	hagras	PROPN
ap-490	205	3	phone	phone	NOUN
ap-490	205	4	:	:	PUNCT
ap-490	205	5	+420	+420	PROPN
ap-490	205	6	224	224	NUM
ap-490	205	7	357	357	NUM
ap-490	205	8	267	267	NUM
ap-490	205	9	e	e	NOUN
ap-490	205	10	-	-	NOUN
ap-490	205	11	mail	mail	NOUN
ap-490	205	12	:	:	PUNCT
ap-490	205	13	tarek@felk.cvut.cz	tarek@felk.cvut.cz	ADP
ap-490	205	14	doc	doc	PROPN
ap-490	205	15	.	.	PROPN
ap-490	206	1	ing	ing	PROPN
ap-490	206	2	.	.	PUNCT
ap-490	207	1	jan	jan	PROPN
ap-490	207	2	janeček	janeček	PROPN
ap-490	207	3	,	,	PUNCT
ap-490	207	4	csc	csc	PROPN
ap-490	207	5	.	.	PROPN
ap-490	207	6	phone	phone	NOUN
ap-490	207	7	:	:	PUNCT
ap-490	207	8	+420	+420	PROPN
ap-490	207	9	224	224	NUM
ap-490	207	10	357	357	NUM
ap-490	207	11	267	267	NUM
ap-490	207	12	e	e	NOUN
ap-490	207	13	-	-	NOUN
ap-490	207	14	mail	mail	NOUN
ap-490	207	15	:	:	PUNCT
ap-490	207	16	janecek@fel.cvut.cz	janecek@fel.cvut.cz	PROPN
ap-490	207	17	dept	dept	PROPN
ap-490	207	18	.	.	PROPN
ap-490	207	19	of	of	ADP
ap-490	207	20	computer	computer	NOUN
ap-490	207	21	science	science	NOUN
ap-490	207	22	and	and	CCONJ
ap-490	207	23	engineering	engineering	NOUN
ap-490	207	24	czech	czech	PROPN
ap-490	207	25	technical	technical	PROPN
ap-490	207	26	university	university	PROPN
ap-490	207	27	in	in	ADP
ap-490	207	28	prague	prague	PROPN
ap-490	207	29	faculty	faculty	NOUN
ap-490	207	30	of	of	ADP
ap-490	207	31	electrical	electrical	ADJ
ap-490	207	32	engineering	engineering	NOUN
ap-490	207	33	karlovo	karlovo	PROPN
ap-490	207	34	nám	nám	PROPN
ap-490	207	35	.	.	PUNCT
ap-490	208	1	13	13	NUM
ap-490	208	2	121	121	NUM
ap-490	208	3	35	35	NUM
ap-490	208	4	prague	prague	NOUN
ap-490	208	5	2	2	NUM
ap-490	208	6	,	,	PUNCT
ap-490	208	7	czech	czech	PROPN
ap-490	208	8	republic	republic	NOUN
ap-490	208	9	©	©	PROPN
ap-490	208	10	czech	czech	PROPN
ap-490	208	11	technical	technical	PROPN
ap-490	208	12	university	university	PROPN
ap-490	208	13	publishing	publishing	NOUN
ap-490	208	14	house	house	NOUN
ap-490	208	15	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-490	208	16	21	21	NUM
ap-490	208	17	acta	acta	PROPN
ap-490	208	18	polytechnica	polytechnica	PROPN
ap-490	208	19	vol	vol	NOUN
ap-490	208	20	.	.	PUNCT
ap-490	209	1	43	43	NUM
ap-490	209	2	no	no	NOUN
ap-490	209	3	.	.	PUNCT
ap-490	210	1	6/2003	6/2003	NUM
ap-490	210	2	algorithm	algorithm	NOUN
ap-490	210	3	complexity	complexity	NOUN
ap-490	210	4	hlfet	hlfet	NOUN
ap-490	211	1	o	o	INTJ
ap-490	211	2	pv	pv	INTJ
ap-490	211	3	(	(	PUNCT
ap-490	211	4	)	)	PUNCT
ap-490	211	5	2	2	NUM
ap-490	211	6	mcp	mcp	PROPN
ap-490	211	7	o	o	X
ap-490	211	8	pv	pv	INTJ
ap-490	211	9	(	(	PUNCT
ap-490	211	10	)	)	PUNCT
ap-490	211	11	2	2	NUM
ap-490	211	12	etf	etf	NOUN
ap-490	211	13	o	o	NOUN
ap-490	211	14	pv	pv	NOUN
ap-490	211	15	(	(	PUNCT
ap-490	211	16	)	)	PUNCT
ap-490	211	17	3	3	NUM
ap-490	211	18	dls	dls	NOUN
ap-490	211	19	o	o	PROPN
ap-490	212	1	pv	pv	INTJ
ap-490	212	2	(	(	PUNCT
ap-490	212	3	)	)	PUNCT
ap-490	212	4	3	3	NUM
ap-490	212	5	table	table	NOUN
ap-490	212	6	6	6	NUM
ap-490	212	7	:	:	PUNCT
ap-490	212	8	algorithms	algorithm	VERB
ap-490	212	9	complexity	complexity	NOUN
ap-490	212	10	hlfet	hlfet	NOUN
ap-490	212	11	mcp	mcp	PROPN
ap-490	212	12	etf	etf	PROPN
ap-490	212	13	dls	dls	PROPN
ap-490	212	14	b	b	PROPN
ap-490	212	15	49.15	49.15	NUM
ap-490	212	16	%	%	NOUN
ap-490	212	17	60.12	60.12	NUM
ap-490	212	18	%	%	NOUN
ap-490	212	19	64.79	64.79	NUM
ap-490	212	20	%	%	NOUN
ap-490	212	21	hlfet	hlfet	NOUN
ap-490	212	22	e	e	NOUN
ap-490	212	23	12.47	12.47	NUM
ap-490	212	24	%	%	NOUN
ap-490	212	25	w	w	NOUN
ap-490	212	26	38.39	38.39	NUM
ap-490	212	27	%	%	NOUN
ap-490	212	28	39.89	39.89	NUM
ap-490	212	29	%	%	NOUN
ap-490	212	30	35.22	35.22	NUM
ap-490	212	31	%	%	NOUN
ap-490	212	32	b	b	NOUN
ap-490	212	33	38.39	38.39	NUM
ap-490	212	34	%	%	NOUN
ap-490	212	35	46.68	46.68	NUM
ap-490	212	36	%	%	NOUN
ap-490	212	37	44.76	44.76	NUM
ap-490	212	38	%	%	NOUN
ap-490	212	39	mcp	mcp	PROPN
ap-490	212	40	e	e	PROPN
ap-490	212	41	12.47	12.47	NUM
ap-490	212	42	%	%	NOUN
ap-490	212	43	w	w	NOUN
ap-490	212	44	49.15	49.15	NUM
ap-490	212	45	%	%	NOUN
ap-490	212	46	53.33	53.33	NUM
ap-490	212	47	%	%	NOUN
ap-490	212	48	55.24	55.24	NUM
ap-490	212	49	%	%	NOUN
ap-490	212	50	b	b	NOUN
ap-490	212	51	39.89	39.89	NUM
ap-490	212	52	%	%	NOUN
ap-490	212	53	53.33	53.33	NUM
ap-490	212	54	%	%	NOUN
ap-490	212	55	26.93	26.93	NUM
ap-490	212	56	%	%	NOUN
ap-490	212	57	etf	etf	NOUN
ap-490	212	58	e	e	PROPN
ap-490	212	59	39.53	39.53	NUM
ap-490	212	60	%	%	NOUN
ap-490	212	61	w	w	PROPN
ap-490	212	62	60.12	60.12	NUM
ap-490	212	63	%	%	NOUN
ap-490	212	64	46.68	46.68	NUM
ap-490	212	65	%	%	NOUN
ap-490	212	66	33.54	33.54	NUM
ap-490	212	67	%	%	NOUN
ap-490	212	68	b	b	PROPN
ap-490	212	69	35.22	35.22	NUM
ap-490	212	70	%	%	NOUN
ap-490	212	71	55.24	55.24	NUM
ap-490	212	72	%	%	NOUN
ap-490	212	73	33.54	33.54	NUM
ap-490	212	74	%	%	NOUN
ap-490	212	75	dls	dls	PROPN
ap-490	212	76	e	e	X
ap-490	212	77	39.53	39.53	NUM
ap-490	212	78	%	%	NOUN
ap-490	212	79	w	w	PROPN
ap-490	212	80	64.79	64.79	NUM
ap-490	212	81	%	%	NOUN
ap-490	212	82	44.76	44.76	NUM
ap-490	212	83	%	%	NOUN
ap-490	212	84	26.93	26.93	NUM
ap-490	212	85	%	%	NOUN
ap-490	212	86	table	table	NOUN
ap-490	212	87	7	7	NUM
ap-490	212	88	:	:	PUNCT
ap-490	212	89	pair	pair	NOUN
ap-490	212	90	-	-	PUNCT
ap-490	212	91	wise	wise	ADJ
ap-490	212	92	comparison	comparison	NOUN
ap-490	212	93	of	of	ADP
ap-490	212	94	scheduling	scheduling	NOUN
ap-490	212	95	algorithms	algorithm	NOUN
ap-490	212	96	complexity	complexity	NOUN
ap-490	212	97	based	base	VERB