we 0.285666606839885
0 0.164491964028181
paper 0.145676294557969
this_paper 0.130029612124791
in_this_paper 0.0947448351971989
present 0.091715723860776
our 0.0772151426195129
we_present 0.0767904574960938
in_this_paper_we 0.0760212895778873
paper_we 0.0760212895778873
this_paper_we 0.0760212895778873
in_this 0.07098570973276
1 0.0608635207068829
is 0.0478833128692293
many 0.0444871995136338
been 0.0430587576537733
we_also 0.0426533312316084
this 0.0415840993862393
6 0.0411843860107619
propose 0.0409827156572942
however 0.039338858980592
applications 0.0391358836877043
0_we 0.0390215260268261
we_propose 0.0390215260268261
show_that 0.0366203037152197
each 0.0362557995905032
we_show_that 0.0354042150986098
presents 0.0354042150986094
we_show 0.0341318745800067
0_the 0.0338776053872163
problems 0.0330467881295681
show 0.0322972627585099
for 0.0322839611289201
2_in_this 0.0318012654211608
2_in_this_paper 0.0318012654211608
0_many 0.0314437206684244
algorithms 0.0313633515230545
the 0.0309997766427956
important 0.0303079691396459
presented 0.0299872589934269
2_we 0.0299872589934269
4 0.0290167675552905
7 0.0288994069580957
has_been 0.0287564671478982
5 0.02864421988654
fundamental 0.0283885988164464
2_in_this_paper_we 0.0282125460070684
paper_presents 0.0282125460070684
present_a 0.0282125460070684
computing 0.0274393134681041
results 0.0265313689013376
previous 0.0261378777228218
one_of_the 0.0253288134653584
bound 0.024881239391922
contribution 0.0248721730852694
one_of 0.0248086584823719
0_this_paper 0.024637927862468
algorithm_that 0.024637927862468
propose_a 0.024637927862468
this_paper_presents 0.024637927862468
0_this 0.0246379278624675
describe_a 0.0246379278624675
to_be 0.0244347873771256
efficient 0.0242967252772388
critical 0.024285048154598
is_to 0.0238941452776742
4_these 0.0237635996177419
by 0.0237183088829767
a_new 0.0236190417593263
also 0.0233777490455161
describe 0.0233559527284957
program 0.0232761495684954
8 0.0231076806824819
systems 0.0229914313991368
often 0.0229478781088098
distributed 0.0229191652180531
the_proposed 0.0222193063711104
better 0.0221704406086661
than 0.0219265129154298
a 0.0217523169724072
has 0.0217434531873546
1_the 0.0216198498425566
have_been 0.0213366344744404
p 0.0212904368031066
interconnection 0.0211707449081235
is_a 0.021090998146382
0_we_present 0.0210772839434918
fault_tolerant 0.0210772839434918
in_this_paper_we_propose 0.0210772839434918
paper_we_propose 0.0210772839434918
this_paper_we_propose 0.0210772839434918
tolerant 0.0210772839434918
we_describe 0.0210772839434918
we_describe_a 0.0210772839434918
we_present_a 0.0210772839434918
we_propose_a 0.0210772839434918
not 0.0210515265321281
main_contribution 0.0210110110978392
less 0.0210110110978391
optimal 0.0209246225707211
2 0.020164628253008
1_a 0.0200473115732479
with_the 0.0200196792210954
compared 0.0200155798066968
the_processors 0.01936741234291
2_in 0.0191351565902192
algorithms_for 0.0190856289324612
algorithm 0.019059828128799
performance 0.0189392482270586
3_we 0.0188831226242456
of_the_proposed 0.0186146940602843
small 0.0185324845487182
resource 0.0181661214961667
have 0.018096377212858
new 0.0180591394651919
process 0.0180215133058587
significant 0.0178059408570484
5_we 0.0176990559342854
0_this_paper_presents 0.0175304891139785
are_presented 0.0175304891139785
is_proposed 0.0175304891139785
propose_an 0.0175304891139785
discussed 0.017530489113978
5_the 0.0174572340056528
performance_of_the 0.017440675765962
the_performance_of_the 0.017440675765962
main_contribution_is_to 0.0172319607230672
contribution_is 0.0172319607230667
contribution_is_to 0.0172319607230667
main_contribution_is 0.0172319607230667
variety 0.0171095954807679
variety_of 0.0171095954807678
graphs 0.0169402072188054
4_in_this 0.0169298880160794
4_in_this_paper 0.0169298880160794
3_the 0.0168441598458785
a_message 0.0168426443509529
main 0.0166361317808352
enables 0.0166154733530148
is_often 0.0165632769718669
2_however 0.0165632769718664
difficult_to 0.0165632769718664
transmitting 0.0165632769718664
task_migration 0.0163848042560456
0_a 0.0163122904909324
these_problems 0.0162961652862124
performance_of 0.0161567865358795
the_performance_of 0.0161567865358791
on_an 0.0161107286415878
show_that_the 0.0160967026987826
simulation 0.0160500305493324
of_a 0.0159730016308841
among 0.0159179977834301
point 0.015901642447028
of_the 0.0158686775411148
in_many 0.015829680129023
0_in 0.0158214621207447
difficult 0.0157072942188224
source 0.0155441797973704
0_many_time_critical 0.0155382194032772
applications_require 0.0155382194032772
many_time 0.0155382194032772
0_many_time 0.0155382194032767
0_many_time_critical_applications 0.0155382194032767
alternative_to_the 0.0155382194032767
an_attractive 0.0155382194032767
an_attractive_alternative 0.0155382194032767
an_attractive_alternative_to 0.0155382194032767
an_attractive_alternative_to_the 0.0155382194032767
as_an_attractive 0.0155382194032767
as_an_attractive_alternative 0.0155382194032767
as_an_attractive_alternative_to 0.0155382194032767
attractive_alternative 0.0155382194032767
attractive_alternative_to 0.0155382194032767
attractive_alternative_to_the 0.0155382194032767
critical_applications 0.0155382194032767
critical_applications_require 0.0155382194032767
fundamental_tasks 0.0155382194032767
have_many 0.0155382194032767
image_processing_pattern 0.0155382194032767
image_processing_pattern_recognition 0.0155382194032767
in_image 0.0155382194032767
in_image_processing 0.0155382194032767
in_image_processing_pattern 0.0155382194032767
in_image_processing_pattern_recognition 0.0155382194032767
is_one_of 0.0155382194032767
is_one_of_the 0.0155382194032767
location 0.0155382194032767
many_time_critical 0.0155382194032767
many_time_critical_applications 0.0155382194032767
many_time_critical_applications_require 0.0155382194032767
of_the_fundamental 0.0155382194032767
of_the_fundamental_tasks 0.0155382194032767
one_of_the_fundamental 0.0155382194032767
one_of_the_fundamental_tasks 0.0155382194032767
pattern_recognition 0.0155382194032767
predictable 0.0155382194032767
predictable_performance 0.0155382194032767
processing_pattern 0.0155382194032767
processing_pattern_recognition 0.0155382194032767
recognition 0.0155382194032767
the_fundamental 0.0155382194032767
the_fundamental_tasks 0.0155382194032767
time_critical 0.0155382194032767
time_critical_applications 0.0155382194032767
time_critical_applications_require 0.0155382194032767
set 0.0155376726830463
applications_in 0.0155233875543459
because 0.0154806886209329
wormhole 0.0153786983072277
technologies 0.015359746687456
4_in 0.0151784815407017
implemented 0.0151119866888921
a_set 0.0150215797642468
a_set_of 0.0150215797642468
6_we 0.0148479951104225
monotone 0.014838989994769
alternative_to 0.0146822366502328
engineering 0.0146822366502328
alternative 0.0146822366502327
attractive 0.0146822366502327
use 0.0146743917115284
we_have 0.0146017644060287
compare 0.0145930690051892
2_the 0.0145466083359667
using 0.0145048542297585
been_proposed 0.0144870377259303
been_used 0.0144870377259303
constraints 0.0144870377259299
s 0.0144864603543993
cube_is 0.0142868977902463
it 0.0142398963877715
pram 0.0142277840803891
such_as 0.0142217180723525
approaches 0.0141939260133785
for_the 0.0141884767031901
used 0.0141824543813494
in_parallel 0.0140354339743254
interconnection_networks 0.0140354339743254
sorting 0.0140265666888428
this_paper_presents_a 0.0139974201043698
this_paper_we_present 0.0139974201043698
we_propose_an 0.0139974201043698
we_show_that_the 0.0139974201043698
0_in_this 0.0139974201043698
0_in_this_paper 0.0139974201043698
1_in_this_paper 0.0139974201043698
1_in_this_paper_we 0.0139974201043698
finally 0.0139974201043698
in_this_paper_we_present 0.0139974201043698
paper_presents_a 0.0139974201043698
paper_we_present 0.0139974201043698
present_an 0.0139974201043698
the_paper 0.0139974201043698
presents_a 0.0139974201043693
practical 0.0139924099490818
a_network 0.0139662810332432
computing_the 0.0139130687320268
of_computing_the 0.0139130687320264
problem_of_computing 0.0139130687320264
the_problem_of_computing 0.0139130687320264
text 0.0139130687320264
is_one 0.0139130687320262
problem_of_computing_the 0.0139130687320262
the_problem_of_computing_the 0.0139130687320262
destination 0.0138752439034424
4_in_this_paper_we 0.0138239010869827
algorithm_for 0.0138229406159267
set_of 0.0138213204875561
6_the 0.0136959881229175
long 0.0136651572566761
servers 0.0136544412968349
efficiency 0.0136467425307498
8_the 0.0135603515010376
effectiveness 0.0135603515010376
very 0.0135244384448479
the_problem 0.0135203518588087
tsp 0.0135029512301887
thus 0.0134598389980982
first 0.0134448267486151
a_variety 0.0134379862587385
a_variety_of 0.0134379862587385
results_show 0.0134379862587385
used_to 0.0134310211827087
an_important 0.0133923120393393
real_time 0.0133462536368354
broadcasting 0.0133228210174989
dimensional 0.0132967543879059
in_the_literature 0.0132525051398438
problem_of 0.0132217164073625
the_problem_of 0.0132217164073625
checkpointing 0.0132195916444839
scheme 0.0131805145428219
memory 0.0130925848853294
and_is 0.0130845647956539
proposed 0.0129992526483047
rollback 0.0128777900770416
2_a 0.012877790077041
can 0.0128752008485757
interconnection_network 0.0128627885415524
image 0.0128627885415518
real 0.0128572308121066
is_usually 0.012844987138193
of_computing 0.012844987138193
embedded 0.0128449871381928
deadlock_free 0.0128335620968101
studied 0.0128335620968101
link 0.0127999237809621
multiple 0.0127466838943946
was 0.012741446094874
literature 0.0127323501568584
the_literature 0.0127323501568579
3 0.0126628535795874
if 0.0126092192854282
failures 0.0126092192854279
path 0.0124832143553655
closed 0.0124639737928014
during 0.0124639737928014
completion 0.0124639737928013
over 0.0124361905679791
effectiveness_of_the_proposed 0.0124337027411987
fairness 0.0124337027411987
and_compared 0.0124337027411983
effectiveness_of_the 0.0124337027411983
feature 0.0124337027411983
indicate 0.0124337027411983
interaction_fairness 0.0124337027411983
is_the_first 0.0124337027411983
is_the_first_algorithm 0.0124337027411983
over_the 0.0124337027411983
regular 0.0124337027411983
results_show_that 0.0124337027411983
strong_interaction 0.0124337027411983
strong_interaction_fairness 0.0124337027411983
than_a 0.0124337027411983
than_previous 0.0124337027411983
the_effectiveness_of_the_proposed 0.0124337027411983
the_effectiveness_of_the 0.0124337027411978
fault 0.0123930450541332
points_in 0.012375378501067
recently 0.0123753785010665
our_algorithm 0.0123543557687644
rcpps 0.0123374977989497
web_servers 0.0123374977989497
solving_the 0.0123311505208346
coteries 0.0123311505208344
for_solving_the 0.0123311505208344
as_an 0.0122898423432689
image_processing 0.0122898423432689
faulty 0.0122666109655222
worms 0.0122666109655221
the_first 0.0121863528360045
pattern 0.0121674771009701
is_an 0.0121674771009698
require 0.0121674771009697
based_on 0.0121204915785141
data_structure 0.0120946434189664
states 0.0120946434189662
experimental 0.0120387971873468
disjoint 0.0119837111573828
deadlock 0.0119837111573826
cache 0.0119722781766676
contain 0.0119722781766674
is_available 0.011972278176667
partition 0.0119615622168257
high 0.0119113656367715
is_used 0.0117721420913416
is_used_to 0.0117721420913416
sa 0.0117341875142434
connected 0.0116844498031459
based 0.0116166381194507
compaction 0.0115840907730116
work 0.0115537131904688
is_that 0.0115324751893762
and_in 0.0115158824802419
because_it 0.0114815150459057
solution 0.0113945312252688
makes 0.0113823784481444
strong 0.0113656211473652
the_model 0.0113656211473652
than_the 0.0113004414294715
o 0.011280418879235
support 0.0112478291448593
design 0.0112159820347641
addressed 0.0111321984459851
they 0.0111321984459849
these_algorithms 0.0110946320541188
global 0.0110583419683607
basic 0.0110540087644749
vlsi 0.0110134709042669
monotone_matrix 0.0110134709042664
a_monotone 0.0110134709042663
a_monotone_matrix 0.0110134709042663
usually 0.0109536434335054
a_mesh 0.0108501023901857
databases 0.0108501023901857
studies 0.0108468504931319
problems_in 0.0108347123699981
an_n 0.010819933010093
develop 0.010819933010093
1_in_this 0.0108199330100929
are_also 0.0108199330100929
loop 0.0108127843779289
study 0.0107853974528022
no 0.0107513886223818
a_large 0.0107277371478869
that 0.0106907812319027
processing 0.0106738601509557
features 0.0106641543043461
existing 0.0106501481559088
7_the 0.0106349778847651
ability 0.0106297868700098
scheduler 0.010614254632518
simulation_studies 0.010614254632518
constant 0.0106099320035882
well_known 0.0106003413819873
virtual 0.0105559303923854
can_be 0.0105440941868133
message 0.0105239723409647
of_each 0.010491674643776
partial 0.0104853957700778
since 0.0104853957700778
large 0.0104810286592631
it_is 0.0104810286592629
0_in_this_paper_we 0.0104779554717869
duplication 0.0104779554717869
paper_we_describe_a 0.0104779554717869
problem_are 0.0104779554717869
this_paper_we_describe 0.0104779554717869
this_paper_we_describe_a 0.0104779554717869
this_paper_we_propose_an 0.0104779554717869
we_also_present 0.0104779554717869
we_introduce 0.0104779554717869
0_this_paper_presents_a 0.0104779554717864
2_we_present 0.0104779554717864
4_we_present 0.0104779554717864
8_we 0.0104779554717864
also_discussed 0.0104779554717864
also_present 0.0104779554717864
analytically 0.0104779554717864
approach_for 0.0104779554717864
designed 0.0104779554717864
efficient_parallel 0.0104779554717864
even_number 0.0104779554717864
finally_we 0.0104779554717864
in_this_paper_we_describe 0.0104779554717864
introduce 0.0104779554717864
model_for 0.0104779554717864
multiprocessor_systems 0.0104779554717864
paper_we_describe 0.0104779554717864
paper_we_propose_a 0.0104779554717864
paper_we_propose_an 0.0104779554717864
present_a_new 0.0104779554717864
proposed_for 0.0104779554717864
this_paper_we_propose_a 0.0104779554717864
to_compute 0.0104779554717864
we_compare 0.0104779554717864
we_develop 0.0104779554717864
we_present_a_new 0.0104779554717864
we_present_an 0.0104779554717864
we_study 0.0104779554717864
user 0.0104478293782116
minimize 0.0104478293782116
routers 0.0104478293782116
safety_vector 0.0104478293782116
safety 0.0104478293782115
specific 0.0104478293782115
to_minimize 0.0104478293782115
work_time 0.0104478293782111
more_than 0.0104478008864081
because_of 0.010447800886408
wormhole_routing 0.0104366679621228
scheduling 0.0104278953053208
to 0.0103927162746468
the_performance 0.0103755187068873
the_data 0.0103630305277786
np 0.0103630305277786
structures 0.0103630305277786
on_the 0.0102997132335649
extended 0.0102685145215431
paths 0.0102667807779084
degree 0.0102359161606572
and_the 0.0102177998276955
algorithms_to 0.0102171910642479
and_to 0.0102171910642479
arriving 0.0102171910642479
deadlock_free_routing 0.0102171910642479
free_routing 0.0102171910642479
of_all 0.0102171910642477
in_a 0.0102003446827631
data 0.0101747545963333
in 0.0101597936820661
found 0.010137412817582
fibonacci 0.0101247891114902
10_the 0.0101083671677786
a_small 0.0101083671677786
into_a 0.0101083671677786
model_the 0.0101083671677786
o_n 0.0101083671677786
safety_vector_of 0.0101083671677786
takes 0.0101083671677786
length 0.0101083671677786
1_our 0.0101083671677782
adaptive_routers 0.0101083671677782
and_can 0.0101083671677782
each_task 0.0101083671677782
hold 0.0101083671677782
hold_for 0.0101083671677782
indicates 0.0101083671677782
indicates_that 0.0101083671677782
is_small 0.0101083671677782
of_its 0.0101083671677782
parallel_machines 0.0101083671677782
the_bound 0.0101083671677782
two_dimensional 0.0101083671677782
upon_the 0.0101083671677782
vector_of 0.0101083671677782
the_source 0.0101083671677782
4_this 0.010055654616731
protocol 0.0100424264531646
7_our 0.0100413084342348
9_the 0.0100413084342348
effectiveness_of 0.0100413084342348
the_effectiveness_of 0.0100413084342348
less_than 0.0100413084342347
results_of 0.0100413084342347
the_effectiveness 0.0100413084342347
the_results 0.0100413084342347
optical 0.00998509561369376
coterie 0.00998298419410275
address 0.0099829841941026
and_destination 0.00997163347381624
completion_time 0.00997163347381624
limited 0.00997163347381624
source_and 0.00997163347381624
use_the 0.00997163347381624
source_and_destination 0.00997163347381608
may_not 0.0099716334738158
the_network 0.0099716334738158
form 0.00997163347381564
symbolic 0.00997163347381564
completely 0.00995719877910028
improved 0.00995719877909984
parallelization 0.00995505544739217
factor 0.00994538931043347
for_solving 0.00992283134476364
extensive 0.00991894319193598
flexible 0.00991894319193598
interaction 0.00991894319193598
level 0.00991894319193598
the_smlh 0.00991894319193598
extensive_simulation 0.00991894319193585
policy 0.00991894319193554
first_algorithm 0.00991894319193554
improvement 0.00991894319193554
model_is 0.00991894319193554
the_first_algorithm 0.00991894319193554
method 0.00989812703388315
compared_with 0.00985376347404161
as 0.00984177699520647
this_algorithm 0.00983846931432442
algorithm_is 0.00982469641861128
methods 0.0098017141093977
by_the 0.0097301695084604
in_multiprocessor 0.00971477948827282
nondominated 0.00971477948827282
star_networks 0.00971477948827282
the_well 0.00971477948827282
the_well_known 0.00971477948827282
the_convex 0.00971477948827266
enhance 0.00971477948827237
algorithms_are 0.00971346161392672
two 0.0096991097561161
required 0.00969483611357527
while 0.00969063086061528
system 0.00968988587593955
disjoint_paths 0.00965607500253314
successive 0.00963257457400646
able_to_support 0.00963257457400646
at_an 0.00963257457400646
broadcasting_is 0.00963257457400646
collisions 0.00963257457400646
have_been_used_for 0.00963257457400646
hit_rates 0.00963257457400646
prakash_singhal 0.00963257457400646
profitable 0.00963257457400646
said_to_be 0.00963257457400646
unicast_v 0.00963257457400646
with_a_single 0.00963257457400646
in_p 0.00963257457400601
resource_constraints 0.00963257457400601
0_in_a 0.00963257457400601
1_such 0.00963257457400601
1_these 0.00963257457400601
3_these 0.00963257457400601
a_coterie 0.00963257457400601
a_number_of_applications 0.00963257457400601
a_number_of_applications_in 0.00963257457400601
a_progressive 0.00963257457400601
adopted 0.00963257457400601
approximation_approaches 0.00963257457400601
available_and 0.00963257457400601
be_decomposed 0.00963257457400601
been_adopted 0.00963257457400601
been_proposed_in 0.00963257457400601
been_used_for 0.00963257457400601
calls 0.00963257457400601
capabilities 0.00963257457400601
case_of 0.00963257457400601
contain_a 0.00963257457400601
decomposed 0.00963257457400601
distance_calls 0.00963257457400601
failure 0.00963257457400601
growing 0.00963257457400601
has_been_proposed 0.00963257457400601
have_been_used 0.00963257457400601
hit 0.00963257457400601
hit_rates_are 0.00963257457400601
in_that 0.00963257457400601
link_failures 0.00963257457400601
long_distance 0.00963257457400601
long_distance_calls 0.00963257457400601
mesh_is 0.00963257457400601
misrouting 0.00963257457400601
mixed 0.00963257457400601
model_on 0.00963257457400601
network_can 0.00963257457400601
number_of_applications 0.00963257457400601
number_of_applications_in 0.00963257457400601
of_a_coterie 0.00963257457400601
of_a_network 0.00963257457400601
of_applications 0.00963257457400601
of_applications_in 0.00963257457400601
one_can 0.00963257457400601
points_in_p 0.00963257457400601
prakash 0.00963257457400601
prakash_singhal_algorithm 0.00963257457400601
previously_the 0.00963257457400601
problem_is_to 0.00963257457400601
progressive 0.00963257457400601
proximate_point 0.00963257457400601
rates 0.00963257457400601
rates_are 0.00963257457400601
said 0.00963257457400601
said_to 0.00963257457400601
scheduling_of_tasks 0.00963257457400601
since_it 0.00963257457400601
singhal 0.00963257457400601
singhal_algorithm 0.00963257457400601
stages 0.00963257457400601
sublogarithmic 0.00963257457400601
submesh_of 0.00963257457400601
successive_approximation 0.00963257457400601
successive_approximation_approaches 0.00963257457400601
the_data_structure 0.00963257457400601
the_prakash 0.00963257457400601
the_prakash_singhal 0.00963257457400601
the_prakash_singhal_algorithm 0.00963257457400601
to_all_the 0.00963257457400601
unicast_v_is 0.00963257457400601
volume 0.00963257457400601
volume_of 0.00963257457400601
years 0.00963257457400601
transformations 0.00958761047509116
diameter 0.00956826561831647
processors 0.00956065475646595
allocation 0.00950524864592803
ga 0.0094742774426777
exchange 0.00946922189784116
larger 0.00946922189784116
sets 0.00946922189784116
homogeneous 0.009469221897841
of_adaptive 0.009469221897841
the_basic 0.00945680083918842
the_main 0.00945087678112897
current 0.00945087678112877
result 0.00944734498177668
1_because_of 0.00941622115606888
at_each_node 0.00941622115606888
these_databases 0.00941622115606888
a_point 0.00941622115606849
1_the_overhead 0.00941622115606849
at_each 0.00941622115606849
facilities 0.00941622115606849
it_does_not 0.00941622115606849
need_to_be 0.00941622115606849
needed_to 0.00941622115606849
np_hard 0.00941622115606849
on_a_smaller 0.00941622115606849
parallel_implementations 0.00941622115606849
point_to 0.00941622115606849
scheduled 0.00941622115606849
that_need 0.00941622115606849
that_need_to 0.00941622115606849
to_tolerate 0.00941622115606849
1_because 0.00941622115606844
a_message_can 0.00941622115606844
a_smaller 0.00941622115606844
do 0.00941622115606844
in_previous 0.00941622115606844
