we 0.287849361653476 0 0.162826321716352 paper 0.148429332393742 this_paper 0.132833722247361 in_this_paper 0.0977496223888988 present 0.0945670512130806 we_present 0.0761181383884789 our 0.0758365839485831 in_this_paper_we 0.0754256586521323 paper_we 0.0754256586521323 this_paper_we 0.0754256586521323 in_this 0.0738128688476055 1 0.0590856468269715 is 0.048213932348856 however 0.046567249046 many 0.0450128871022727 propose 0.044063847429991 we_also 0.0422930511561419 we_propose 0.0422930511561419 been 0.0418896447219114 this 0.0405956621833504 6 0.0405811123161522 applications 0.0395240971861901 0_we 0.0386926417005733 show_that 0.0374168240947461 each 0.0363084209429516 presents 0.0351064658707161 we_show_that 0.0351064658707161 we_show 0.0338298815448767 0_the 0.0333432936034677 for 0.0333401673242057 show 0.0329932468951838 problems 0.0324614398445529 2_in_this 0.031534394125535 2_in_this_paper 0.031534394125535 present_a 0.031534394125535 0_many 0.0311810011208626 the 0.0311325262390167 algorithms 0.0308396996637473 important 0.0299549744785295 2_we 0.0297900110603929 presented 0.0297900110603929 4 0.029270932857402 5 0.0287701679803219 7 0.0284727032852288 fundamental 0.028178939008969 has_been 0.0280577905937449 2_in_this_paper_we 0.0279762988936931 paper_presents 0.0279762988936931 propose_a 0.0279762988936931 computing 0.0272882490999216 a_new 0.0263579319574028 results 0.0259056945383238 distributed 0.0258884162630775 previous 0.0253808352101123 has 0.02522753946974 one_of_the 0.0251404681837234 bound 0.0247851567135078 one_of 0.0246594746723691 0_this 0.0244320545305388 0_this_paper 0.0244320545305388 algorithm_that 0.0244320545305388 describe_a 0.0244320545305388 this_paper_presents 0.0244320545305388 we_propose_a 0.0244320545305388 contribution 0.0243220337221644 critical 0.0241741387062694 efficient 0.0239009126653592 4_these 0.0236945464791254 to_be 0.0234066796473702 program 0.0232867957114487 is_to 0.0232611177165119 describe 0.0232130949662636 systems 0.0227832540280926 8 0.0225737897493741 often 0.0224877576947473 by 0.0221402999342565 the_proposed 0.0218298350938988 better 0.0218166589514845 also 0.0215857702045455 interconnection 0.0213461507501141 a 0.0213050939974024 1_the 0.0211727678917248 than 0.0210926485379809 optimal 0.0210559519317266 0_we_present 0.0209015372763321 fault_tolerant 0.0209015372763321 in_this_paper_we_propose 0.0209015372763321 paper_we_propose 0.0209015372763321 this_paper_we_propose 0.0209015372763321 tolerant 0.0209015372763321 we_describe 0.0209015372763321 we_describe_a 0.0209015372763321 we_present_a 0.0209015372763321 have_been 0.0209007059365808 p 0.0208476634879485 implemented 0.0207627487318335 is_a 0.0206428292849838 less 0.0205471039917048 main_contribution 0.0205471039917048 algorithm 0.0205309994153063 not 0.0203370835461946 1_a 0.0197272326888791 2 0.0196619906242513 compared 0.0195588297947348 with_the 0.019549107896591 performance 0.0194813076785095 2_in 0.019099971144591 the_processors 0.0190188520104186 algorithms_for 0.0188796358516081 3_we 0.0188145768072492 of_the_proposed 0.0181905382414936 new 0.0179655456686272 have 0.0176572234854348 small 0.017621775257784 5_we 0.0175310422478263 5_the 0.0175083182790217 significant 0.0174740062627402 0_this_paper_presents 0.0173846252156542 are_presented 0.0173846252156542 discussed 0.0173846252156542 is_proposed 0.0173846252156542 propose_an 0.0173846252156542 resource 0.017175890908266 performance_of_the 0.0170885950700196 the_performance_of_the 0.0170885950700196 graphs 0.0169471236157732 contribution_is 0.0168526771293731 contribution_is_to 0.0168526771293731 main_contribution_is 0.0168526771293731 main_contribution_is_to 0.0168526771293731 4_in_this 0.0168385625114792 4_in_this_paper 0.0168385625114792 in_many 0.0167868406920125 variety 0.0167494528974874 variety_of 0.0167494528974874 3_the 0.0164818390304532 a_message 0.0164785632574095 enables 0.016265840115496 2_however 0.0162022724191315 a_major 0.0162022724191315 a_major_problem 0.0162022724191315 difficult_to 0.0162022724191315 is_often 0.0162022724191315 major 0.0162022724191315 major_problem 0.0162022724191315 transmitting 0.0162022724191315 main 0.0161165684201125 and_is 0.0161108489423467 0_a 0.0160167898985254 needed_to 0.0160003428341619 task_migration 0.0160003428341619 these_problems 0.0159680737064136 applications_in 0.0159598619391827 of_a 0.0159526891973974 performance_of 0.0158796001460165 the_performance_of 0.0158796001460165 on_an 0.0158775453486299 show_that_the 0.0158129167411082 for_the 0.0158106641668567 among 0.0156900824686733 was 0.0156630148082511 set 0.0156537159490198 of_the 0.0156396934276244 0_in 0.0156366803214781 simulation 0.0155779353570517 point 0.0155118590262345 source 0.015500674054294 it 0.0154997186369823 0_many_time 0.0154090343705948 0_many_time_critical 0.0154090343705948 0_many_time_critical_applications 0.0154090343705948 alternative_to_the 0.0154090343705948 an_attractive 0.0154090343705948 an_attractive_alternative 0.0154090343705948 an_attractive_alternative_to 0.0154090343705948 an_attractive_alternative_to_the 0.0154090343705948 applications_require 0.0154090343705948 as_an_attractive 0.0154090343705948 as_an_attractive_alternative 0.0154090343705948 as_an_attractive_alternative_to 0.0154090343705948 attractive_alternative 0.0154090343705948 attractive_alternative_to 0.0154090343705948 attractive_alternative_to_the 0.0154090343705948 critical_applications 0.0154090343705948 critical_applications_require 0.0154090343705948 fundamental_tasks 0.0154090343705948 have_many 0.0154090343705948 image_processing_pattern 0.0154090343705948 image_processing_pattern_recognition 0.0154090343705948 in_image 0.0154090343705948 in_image_processing 0.0154090343705948 in_image_processing_pattern 0.0154090343705948 in_image_processing_pattern_recognition 0.0154090343705948 is_one_of 0.0154090343705948 is_one_of_the 0.0154090343705948 location 0.0154090343705948 many_time 0.0154090343705948 many_time_critical 0.0154090343705948 many_time_critical_applications 0.0154090343705948 many_time_critical_applications_require 0.0154090343705948 network_design 0.0154090343705948 network_design_and 0.0154090343705948 of_the_fundamental 0.0154090343705948 of_the_fundamental_tasks 0.0154090343705948 one_of_the_fundamental 0.0154090343705948 one_of_the_fundamental_tasks 0.0154090343705948 pattern_recognition 0.0154090343705948 predictable 0.0154090343705948 predictable_performance 0.0154090343705948 processing_pattern 0.0154090343705948 processing_pattern_recognition 0.0154090343705948 recognition 0.0154090343705948 the_fundamental 0.0154090343705948 the_fundamental_tasks 0.0154090343705948 time_critical 0.0154090343705948 time_critical_applications 0.0154090343705948 time_critical_applications_require 0.0154090343705948 difficult 0.015322315306891 technologies 0.0152071047856247 interconnection_networks 0.0151748356578773 4_in 0.0151308917257652 a_set 0.0151067691106458 a_set_of 0.0151067691106458 using 0.0150873321557064 wormhole 0.0150767672223217 because 0.0150314230130216 used 0.0149868433804005 use 0.0147127331725697 6_we 0.0146661156441714 monotone 0.0146231230770474 alternative 0.0145290772583543 alternative_to 0.0145290772583543 attractive 0.0145290772583543 engineering 0.0145290772583543 s 0.0144708623463957 compare 0.0144493786222947 2_the 0.0143773982875929 we_have 0.0142352394945774 been_proposed 0.0142270380927179 been_used 0.0142270380927179 constraints 0.0142270380927179 our_algorithm 0.0141980447380142 pram 0.0141429461297145 cube_is 0.0140352078925742 set_of 0.013951754622182 in_parallel 0.013939821753893 the_paper 0.0138811982379665 this_paper_presents_a 0.0138811982379665 this_paper_we_present 0.0138811982379665 we_introduce 0.0138811982379665 we_propose_an 0.0138811982379665 we_show_that_the 0.0138811982379665 0_in_this 0.0138811982379665 0_in_this_paper 0.0138811982379665 1_in_this_paper 0.0138811982379665 1_in_this_paper_we 0.0138811982379665 approach_for 0.0138811982379665 finally 0.0138811982379665 in_this_paper_we_present 0.0138811982379665 introduce 0.0138811982379665 paper_presents_a 0.0138811982379665 paper_we_present 0.0138811982379665 present_an 0.0138811982379665 presents_a 0.0138811982379665 sorting 0.0138367147733065 computing_the 0.0138365975220068 is_one 0.0138365975220068 of_computing_the 0.0138365975220068 problem_of_computing 0.0138365975220068 problem_of_computing_the 0.0138365975220068 the_problem_of_computing 0.0138365975220068 the_problem_of_computing_the 0.0138365975220068 text 0.0138365975220068 approaches 0.0138110939398693 4_in_this_paper_we 0.0137568988859473 destination 0.0137054886205292 a_network 0.0136430563841405 memory 0.0135797742013815 servers 0.0135390612642582 algorithm_for 0.0135202641355431 efficiency 0.0134831580199408 6_the 0.0134698711854931 tsp 0.0134640915508406 used_to 0.0133957099866417 the_problem 0.0133807983976694 long 0.0133732769136311 dimensional 0.0133345215751191 first 0.0132701072684221 8_the 0.0132637780036019 effectiveness 0.0132637780036019 an_important 0.0132526158134299 real_time 0.0131820101478537 a_variety 0.0131605537717171 a_variety_of 0.0131605537717171 flexible 0.0131605537717171 results_show 0.0131605537717171 problem_of 0.0131189960975945 the_problem_of 0.0131189960975945 thus 0.0130521925722707 scheme 0.0129844916877799 in_the_literature 0.0129783190732803 broadcasting 0.0129706263353819 features 0.0129514415132323 design 0.012861985637417 checkpointing 0.0128134187560721 design_and 0.0127620290504454 image 0.0127620290504454 interconnection_network 0.0127620290504454 tasks_in 0.0127620290504454 embedded 0.0127562178977492 is_usually 0.0127562178977492 of_computing 0.0127562178977492 real 0.012663963371221 deadlock_free 0.0126426631639675 studied 0.0126426631639675 process 0.0126187043882809 2_a 0.0125901505205593 rollback 0.0125901505205593 can 0.0125787348936217 path 0.0125462341496419 multiple 0.012506434349005 literature 0.0124973255619256 the_literature 0.0124973255619256 proposed 0.012490147079249 link 0.0124439084793922 if 0.012340782299297 failures 0.012340782299297 completion 0.012330895117014 during 0.012330895117014 coteries 0.012253703602423 for_solving_the 0.012253703602423 solving_the 0.012253703602423 points_in 0.0122011909590153 recently 0.0122011909590153 as_an 0.012181414602364 image_processing 0.012181414602364 and_compared 0.012172642289427 effectiveness_of_the 0.012172642289427 effectiveness_of_the_proposed 0.012172642289427 feature 0.012172642289427 indicate 0.012172642289427 interaction_fairness 0.012172642289427 is_the_first 0.012172642289427 is_the_first_algorithm 0.012172642289427 our_knowledge 0.012172642289427 over_the 0.012172642289427 regular 0.012172642289427 results_show_that 0.012172642289427 strong_interaction 0.012172642289427 strong_interaction_fairness 0.012172642289427 than_a 0.012172642289427 than_previous 0.012172642289427 the_effectiveness_of_the 0.012172642289427 the_effectiveness_of_the_proposed 0.012172642289427 fairness 0.012172642289427 is_that 0.0121547839555698 faulty 0.012146419157805 algorithm_and 0.012146419157805 worms 0.012146419157805 in_these 0.0121410674047107 rcpps 0.0121410674047107 web_servers 0.0121410674047107 fault 0.0121282374831823 over 0.012088872005633 based_on 0.0120790421120846 is_an 0.0120781903704788 pattern 0.0120781903704788 require 0.0120781903704788 3 0.0120507504499082 partition 0.0119419355554695 the_first 0.0119354285686597 data_structure 0.0118793754367281 states 0.0118793754367281 deadlock 0.0118505976170483 disjoint 0.0118505976170483 experimental 0.0118271147148086 cache 0.0117761512048419 contain 0.0117761512048419 is_available 0.0117761512048419 is_used 0.0117293124706791 is_used_to 0.0117293124706791 high 0.0116513330976358 connected 0.0115926415271954 basic 0.0115597155951351 work 0.0115497811254841 that 0.0114937456720203 sa 0.0114221053422251 needed 0.0113832966796218 solution 0.0112818421981691 o 0.0112718526236246 the_system 0.0112677094503516 because_it 0.0112611102924702 such_as 0.0112570366636831 compaction 0.0112398735707393 practical 0.0112398735707393 and_in 0.0112273695881772 server 0.0111477556002636 the_model 0.0110922626651685 strong 0.0110922626651685 makes 0.0110909042626457 these_algorithms 0.0110512849434087 as 0.0110389542859568 than_the 0.0110065589375129 support 0.0109529100177851 of_our 0.0108581254330909 studies 0.0108406005551939 a_monotone 0.0108384100266327 a_monotone_matrix 0.0108384100266327 monotone_matrix 0.0108384100266327 vlsi 0.0108384100266327 they 0.0108317433690304 addressed 0.0108317433690304 usually 0.0108288415087167 global 0.0108231023126505 1_in_this 0.0107759118941876 an_n 0.0107759118941876 are_also 0.0107759118941876 develop 0.0107759118941876 study 0.0107672518421328 different 0.010707964363559 can_be 0.0106949238131041 problems_in 0.0106718547880085 information 0.0106522246432394 loop 0.0106159585424036 no 0.0105700739666052 processing 0.0105624694470741 7_the 0.0105537344890091 amount 0.0105473938343918 amount_of 0.0105473938343918 a_mesh 0.0105412545521568 databases 0.0105412545521568 found 0.0105213517641454 of_each 0.0105202039011003 well_known 0.0105189245222615 scheduling 0.0104907273388697 existing 0.0104813479269547 constant 0.0104634773867222 user 0.0104620294389469 minimize 0.0104620294389469 routers 0.0104620294389469 safety 0.0104620294389469 safety_vector 0.0104620294389469 specific 0.0104620294389469 to_minimize 0.0104620294389469 work_time 0.0104620294389469 ability 0.0104427838074868 a_large 0.0104380303202712 virtual 0.0104341427511064 to 0.0104192679327251 scheduler 0.0104055940815182 simulation_studies 0.0104055940815182 0_in_this_paper_we 0.0103911379992758 0_this_paper_presents_a 0.0103911379992758 2_we_present 0.0103911379992758 4_we_present 0.0103911379992758 8_we 0.0103911379992758 also_discussed 0.0103911379992758 also_present 0.0103911379992758 analytically 0.0103911379992758 designed 0.0103911379992758 duplication 0.0103911379992758 efficient_parallel 0.0103911379992758 even_number 0.0103911379992758 finally_we 0.0103911379992758 identify 0.0103911379992758 in_this_paper_we_describe 0.0103911379992758 introduce_a 0.0103911379992758 model_for 0.0103911379992758 multiprocessor_systems 0.0103911379992758 paper_we_describe 0.0103911379992758 paper_we_describe_a 0.0103911379992758 paper_we_propose_a 0.0103911379992758 paper_we_propose_an 0.0103911379992758 present_a_new 0.0103911379992758 problem_are 0.0103911379992758 proposed_for 0.0103911379992758 this_paper_we_describe 0.0103911379992758 this_paper_we_describe_a 0.0103911379992758 this_paper_we_propose_a 0.0103911379992758 this_paper_we_propose_an 0.0103911379992758 to_compute 0.0103911379992758 we_also_present 0.0103911379992758 we_compare 0.0103911379992758 we_develop 0.0103911379992758 we_introduce_a 0.0103911379992758 we_present_a_new 0.0103911379992758 we_present_an 0.0103911379992758 we_study 0.0103911379992758 on_the 0.0103864847997565 wormhole_routing 0.0103434112903173 partial 0.0102424878645691 since 0.0102424878645691 the_performance 0.0102314157964216 and_the 0.010204253835651 knowledge 0.0101984503112709 and 0.0101678153319663 because_of 0.0101469899639182 more_than 0.0101469899639182 message 0.0101439504322606 the_data 0.0101392636326834 np 0.0101392636326834 structures 0.0101392636326834 extended 0.0101126629914345 10_the 0.0100793699523223 1_our 0.0100793699523223 adaptive_routers 0.0100793699523223 and_can 0.0100793699523223 each_task 0.0100793699523223 hold 0.0100793699523223 hold_for 0.0100793699523223 indicates 0.0100793699523223 indicates_that 0.0100793699523223 into_a 0.0100793699523223 is_small 0.0100793699523223 model_the 0.0100793699523223 o_n 0.0100793699523223 of_its 0.0100793699523223 parallel_machines 0.0100793699523223 safety_vector_of 0.0100793699523223 takes 0.0100793699523223 the_bound 0.0100793699523223 two_dimensional 0.0100793699523223 upon_the 0.0100793699523223 vector_of 0.0100793699523223 the_source 0.0100793699523223 length 0.0100793699523223 based 0.010076419796051 , 0.0100663767031249 . 0.0100663767031249 paths 0.0100595391715601 algorithms_to 0.0100443030888456 and_to 0.0100443030888456 arriving 0.0100443030888456 deadlock_free_routing 0.0100443030888456 free_routing 0.0100443030888456 of_all 0.0100443030888456 it_is 0.0100088879247411 fibonacci 0.00992906855823748 parallelization 0.00992709685754091 degree 0.00992521584319122 4_this 0.00991808850958205 system 0.00990012851058299 protocol 0.00987614894138766 method 0.00986807505479615 address 0.00985352830302459 coterie 0.00985352830302459 for_solving 0.00984089699499109 and_destination 0.00983715931859874 completion_time 0.00983715931859874 form 0.00983715931859874 limited 0.00983715931859874 may_not 0.00983715931859874 source_and 0.00983715931859874 source_and_destination 0.00983715931859874 symbolic 0.00983715931859874 the_network 0.00983715931859874 use_the 0.00983715931859874 the_effectiveness 0.00982497963343636 the_effectiveness_of 0.00982497963343636 the_results 0.00982497963343636 7_our 0.00982497963343636 9_the 0.00982497963343636 effectiveness_of 0.00982497963343636 less_than 0.00982497963343636 results_of 0.00982497963343636 algorithm_is 0.00980991531224066 completely 0.00980715629069849 improved 0.00980715629069849 in_a 0.00979647063113392 factor 0.00975803040237459 this_algorithm 0.00974912343737916 optical 0.00974148031332668 algorithms_are 0.00973384237770385 the_first_algorithm 0.00972175540155111 the_smlh 0.00972175540155111 this_is 0.00972175540155111 policy 0.00972175540155111 extensive 0.00972175540155111 extensive_simulation 0.00972175540155111 first_algorithm 0.00972175540155111 implemented_in 0.00972175540155111 improvement 0.00972175540155111 interaction 0.00972175540155111 level 0.00972175540155111 model_is 0.00972175540155111 enhance 0.00965534352730157 in_multiprocessor 0.00965534352730157 nondominated 0.00965534352730157 star_networks 0.00965534352730157 the_convex 0.00965534352730157 the_well 0.00965534352730157 the_well_known 0.00965534352730157 compared_with 0.00963605167389545 disjoint_paths 0.00953737682018859 methods 0.00952513470411138 by_the 0.00952474329144908 result 0.00950214735293958 transformations 0.0094953882437445 two 0.00946432243348287 in_p 0.00946017531657928 resource_constraints 0.00946017531657928 successive 0.00946017531657928 0_in_a 0.00946017531657928 1_such 0.00946017531657928 1_these 0.00946017531657928 3_these 0.00946017531657928 a_coterie 0.00946017531657928 a_number_of_applications 0.00946017531657928 a_number_of_applications_in 0.00946017531657928 a_progressive 0.00946017531657928 able_to_support 0.00946017531657928 adopted 0.00946017531657928 approximation_approaches 0.00946017531657928 at_an 0.00946017531657928 available_and 0.00946017531657928 be_decomposed 0.00946017531657928 been_adopted 0.00946017531657928 been_proposed_in 0.00946017531657928 been_used_for 0.00946017531657928 broadcasting_is 0.00946017531657928 calls 0.00946017531657928 capabilities 0.00946017531657928 case_of 0.00946017531657928 collisions 0.00946017531657928 contain_a 0.00946017531657928 decomposed 0.00946017531657928 different_types 0.00946017531657928 different_types_of 0.00946017531657928 distance_calls 0.00946017531657928 failure 0.00946017531657928 growing 0.00946017531657928 has_been_proposed 0.00946017531657928 have_been_used 0.00946017531657928 have_been_used_for 0.00946017531657928 hit 0.00946017531657928 hit_rates 0.00946017531657928 hit_rates_are 0.00946017531657928 in_that 0.00946017531657928 link_failures 0.00946017531657928 long_distance 0.00946017531657928 long_distance_calls 0.00946017531657928 mesh_is 0.00946017531657928 misrouting 0.00946017531657928 mixed 0.00946017531657928 model_on 0.00946017531657928 network_can 0.00946017531657928 number_of_applications 0.00946017531657928 number_of_applications_in 0.00946017531657928 of_a_coterie 0.00946017531657928 of_a_network 0.00946017531657928 of_applications 0.00946017531657928 of_applications_in 0.00946017531657928 one_can 0.00946017531657928 points_in_p 0.00946017531657928 prakash 0.00946017531657928 prakash_singhal 0.00946017531657928 prakash_singhal_algorithm 0.00946017531657928 previously_the 0.00946017531657928 problem_is_to 0.00946017531657928 profitable 0.00946017531657928 progressive 0.00946017531657928 proximate_point 0.00946017531657928 rates 0.00946017531657928 rates_are 0.00946017531657928 reading 0.00946017531657928 said 0.00946017531657928 said_to 0.00946017531657928 said_to_be 0.00946017531657928 scheduling_of_tasks 0.00946017531657928 since_it 0.00946017531657928 singhal 0.00946017531657928 singhal_algorithm 0.00946017531657928 stages 0.00946017531657928 sublogarithmic 0.00946017531657928 submesh_of 0.00946017531657928 successive_approximation 0.00946017531657928 successive_approximation_approaches 0.00946017531657928 the_data_structure 0.00946017531657928 the_prakash 0.00946017531657928 the_prakash_singhal 0.00946017531657928 the_prakash_singhal_algorithm 0.00946017531657928 to_all_the 0.00946017531657928 types 0.00946017531657928 types_of 0.00946017531657928 unicast_v 0.00946017531657928 unicast_v_is 0.00946017531657928 volume 0.00946017531657928 volume_of 0.00946017531657928 with_a_single 0.00946017531657928 years 0.00946017531657928 exchange 0.0094481997570538 homogeneous 0.0094481997570538 larger 0.0094481997570538 of_adaptive 0.0094481997570538 sets 0.0094481997570538 while 0.00942693941541022 required 0.00941536400230576 schedule 0.0093870074672741 allocation 0.00935968009048607