{"id":"https://openalex.org/W127166643","doi":null,"title":"ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.","display_name":"ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.","publication_year":1987,"publication_date":"1987-12-01","ids":{"openalex":"https://openalex.org/W127166643","mag":"127166643"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.9649","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.9649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/~sahni/papers/paths.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066832967","display_name":"Jing-Fu Jenq","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jing-Fu Jenq","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj K. Sahni","orcid":"https://orcid.org/0000-0002-8129-1676","observed_orcids":["https://orcid.org/0000-0002-8129-1676"]},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sartaj Sahni","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":"https://orcid.org/0000-0002-8129-1676","affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6578,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.89795918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"713","last_page":"716"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.7196999788284302,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.7196999788284302,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.14839999377727509,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.06859999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8510000109672546},{"id":"https://openalex.org/keywords/hypercube-multiprocessors","display_name":"hypercube multiprocessors","score":0.9169999957084656},{"id":"https://openalex.org/keywords/mimd-architecture","display_name":"MIMD architecture","score":0.7110000252723694},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.7139999866485596},{"id":"https://openalex.org/keywords/data-partitioning","display_name":"data partitioning","score":0.8569999933242798},{"id":"https://openalex.org/keywords/striping","display_name":"striping","score":0.6259999871253967},{"id":"https://openalex.org/keywords/floyd-s-algorithm","display_name":"Floyd's algorithm","score":0.9380000233650208},{"id":"https://openalex.org/keywords/interprocessor-communication","display_name":"interprocessor communication","score":0.8790000081062317},{"id":"https://openalex.org/keywords/shared-memory-machines","display_name":"shared memory machines","score":0.6420000195503235}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.8794102668762207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7097232341766357},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6473907828330994},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.616736114025116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34120404720306396}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.9649","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.9649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/~sahni/papers/paths.pdf","raw_type":"text"},{"id":"mag:127166643","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icpp/icpp1987.html#JenqS87","pdf_url":null,"source":{"id":"https://openalex.org/S4210174133","display_name":"Proceedings of the International Conference on Parallel Processing","issn_l":"0190-3918","issn":["0190-3918","2332-5690"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the International Conference on Parallel Processing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1592729824","https://openalex.org/W7100831814","https://openalex.org/W7099070874","https://openalex.org/W7098593505","https://openalex.org/W2127654648","https://openalex.org/W2188144050","https://openalex.org/W3155854636","https://openalex.org/W7095254601","https://openalex.org/W163398820","https://openalex.org/W1911942485"],"abstract_inverted_index":{"this":[0,60],"paper,":[1],"we":[2],"consider":[3,230],"parallel":[4,177],"solutions":[5],"to":[6,134,159,220],"the":[7,21,24,32,81,88,91,131,164,167,171,186,191,202,209,211,216,222,235,238,261,273],"all":[8,33,239,283],"pairs":[9,34,240,284],"problem":[10],"only.":[11],"As":[12],"with":[13,260],"other":[14],"studies,":[15],"our":[16,48],"development":[17],"considers":[18],"finding":[19],"only":[20],"length":[22],"of":[23,59,80,87,90,142,193,204,233,263,272],"shortest":[25],"paths.":[26],"We":[27,229],"are":[28,243,253,257],"interested":[29],"in":[30,40,64,95,225,291],"solving":[31],"problems":[35],"on":[36,52,190,214,270],"an":[37,53,99],"MIMD":[38,100],"hypercube":[39,83,93,103,120,168,172,210,274],"which":[41],"each":[42,119,136,271],"processor":[43,104,121,137,227],"has":[44,138],"local":[45,116,143],"memory.":[46,144],"Specifically,":[47],"experimentation":[49],"is":[50,62,98,105,122,213,289,299],"done":[51],"NCUBE/7":[54],"hypercube.":[55],"A":[56,84],"block":[57],"diagram":[58,79],"computer":[61,206],"shown":[63],"Fig":[65,292],"1.1":[66,77],"External":[67],"Memory":[68,73,75],"Host":[69,74],"Processor":[70,72],"Hypercube":[71],"Figure":[76],"Block":[78],"NCUBE":[82,92],"detailed":[85],"description":[86],"architecture":[89],"appears":[94],"[6].":[96],"This":[97],"computer.":[101],"Each":[102],"a":[106,176,180,205,265],"custom":[107],"32":[108],"bit,":[109],"2":[110,277],"MIPS,":[111],"500,000":[112],"FLOPS":[113],"processor.":[114],"The":[115,145],"memory":[117,182,198],"for":[118,161,179,237,287],"either":[123],"128":[124,139],"K":[125,128,140],"or":[126],"512":[127],"bytes.":[129],"In":[130,201],"configuration":[132],"avaliable":[133],"us,":[135],"bytes":[141],"high":[146],"level":[147],"language":[148],"support":[149],"currently":[150],"includes":[151],"FORTRAN":[152],"and":[153,166,169,247,256],"C.":[154],"Both":[155],"have":[156],"been":[157],"extended":[158],"allow":[160],"communication":[162],"between":[163],"host":[165],"among":[170],"processors.":[173,275],"When":[174],"designing":[175],"algorithm":[178,269,285],"shared":[181],"machine":[183],"such":[184,207],"as":[185,208,219],"HEP,":[187],"one":[188],"focus":[189,212],"creation":[192],"multiple":[194],"processes":[195],"that":[196],"avoid":[197],"access":[199],"coflicts.":[200],"case":[203],"partitioning":[215,234],"data":[217,236],"so":[218],"reduce":[221],"time":[223],"spent":[224],"inter":[226],"communication.":[228],"two":[231,251],"methods":[232,252],"problem.":[241],"These":[242,250],"called:":[244],"by":[245,248],"stripes":[246],"rectangles.":[249],"evaluated":[254],"experimentally":[255],"also":[258],"compared":[259],"alternative":[262],"running":[264],"single":[266],"source":[267],"sequential":[268],"4":[276],"Floyd's":[278,282],"All":[279],"Pairs":[280],"Algorithm":[281],"(see[3]":[286],"e.g.)":[288],"given":[290],"2.1.":[293],"Here":[294],"L":[295],"[i,":[296],"j":[297],"]":[298],"initial...":[300]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}