{"id":"https://openalex.org/W46808044","doi":null,"title":"Mesh Connected Computers With Multiple Fixed Buses: Packet Routing, Sorting and Selection","display_name":"Mesh Connected Computers With Multiple Fixed Buses: Packet Routing, Sorting and Selection","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W46808044","mag":"46808044"},"language":"en","primary_location":{"id":"pmh:oai:repository.upenn.edu:cis_reports-1519","doi":null,"is_oa":true,"landing_page_url":"https://repository.upenn.edu/cgi/viewcontent.cgi?article=1519&context=cis_reports","pdf_url":"https://repository.upenn.edu/cis_reports/498","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Technical Reports (CIS)","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repository.upenn.edu/cis_reports/498","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034177039","display_name":"Sanguthevar Rajasekaran","orcid":"https://orcid.org/0000-0002-0137-4843","observed_orcids":["https://orcid.org/0000-0002-0137-4843"]},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanguthevar Rajasekaran","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"raw_orcid":"https://orcid.org/0000-0002-0137-4843","affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034177039"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00867622,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0006000000284984708,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mesh-connected-computers","display_name":"mesh-connected computers","score":0.8519999980926514},{"id":"https://openalex.org/keywords/packet-routing","display_name":"packet routing","score":0.9459999799728394},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7590000033378601},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.8190000057220459},{"id":"https://openalex.org/keywords/parallel-sorting","display_name":"parallel sorting","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6868538856506348},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6174752116203308},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.6127582788467407},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5568749904632568},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5129582285881042},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4732537865638733},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.45583274960517883},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.442207396030426},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.41185152530670166},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4064335227012634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3835833668708801},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28079837560653687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21886348724365234},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21167117357254028},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:repository.upenn.edu:cis_reports-1519","doi":null,"is_oa":true,"landing_page_url":"https://repository.upenn.edu/cgi/viewcontent.cgi?article=1519&context=cis_reports","pdf_url":"https://repository.upenn.edu/cis_reports/498","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Technical Reports (CIS)","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.493.1036","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.493.1036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:46808044","doi":null,"is_oa":false,"landing_page_url":"http://repository.upenn.edu/cgi/viewcontent.cgi?article=1519&context=cis_reports","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:repository.upenn.edu:cis_reports-1519","doi":null,"is_oa":true,"landing_page_url":"https://repository.upenn.edu/cgi/viewcontent.cgi?article=1519&context=cis_reports","pdf_url":"https://repository.upenn.edu/cis_reports/498","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Technical Reports (CIS)","raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W46808044.pdf","grobid_xml":"https://content.openalex.org/works/W46808044.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W33543630","https://openalex.org/W176338153","https://openalex.org/W177465002","https://openalex.org/W264341842","https://openalex.org/W1481246531","https://openalex.org/W1524866429","https://openalex.org/W1556524945","https://openalex.org/W1677134705","https://openalex.org/W1826472919","https://openalex.org/W1901382610","https://openalex.org/W1967997017","https://openalex.org/W1968312484","https://openalex.org/W1968358793","https://openalex.org/W1969477831","https://openalex.org/W1977908721","https://openalex.org/W1982912667","https://openalex.org/W1988294273","https://openalex.org/W1989640573","https://openalex.org/W2003960430","https://openalex.org/W2012216209","https://openalex.org/W2015102822","https://openalex.org/W2020797856","https://openalex.org/W2033191517","https://openalex.org/W2033568519","https://openalex.org/W2034085201","https://openalex.org/W2042587503","https://openalex.org/W2052565631","https://openalex.org/W2055469140","https://openalex.org/W2057161655","https://openalex.org/W2059813299","https://openalex.org/W2061496873","https://openalex.org/W2063311962","https://openalex.org/W2066104460","https://openalex.org/W2079505536","https://openalex.org/W2089062581","https://openalex.org/W2091030714","https://openalex.org/W2097755092","https://openalex.org/W2101315187","https://openalex.org/W2106821276","https://openalex.org/W2122545984","https://openalex.org/W2126155114","https://openalex.org/W2132419034","https://openalex.org/W2134755328","https://openalex.org/W2148176991","https://openalex.org/W2150586297","https://openalex.org/W2160084563"],"related_works":["https://openalex.org/W1693948240","https://openalex.org/W2100117580","https://openalex.org/W7099164038","https://openalex.org/W1984196828","https://openalex.org/W7098028725","https://openalex.org/W7095428626","https://openalex.org/W2079505536","https://openalex.org/W26092752","https://openalex.org/W2054550057","https://openalex.org/W7097024416"],"abstract_inverted_index":{"Mesh":[0],"connected":[1],"computers":[2],"have":[3,42,203],"become":[4],"attractive":[5],"models":[6,41],"of":[7,10,22,47],"computing":[8],"because":[9],"their":[11],"varied":[12],"special":[13],"features.":[14],"In":[15,66,124,178],"this":[16],"paper":[17],"we":[18,68,126,171,180],"consider":[19],"two":[20],"variations":[21],"the":[23,44,79,186,198],"mesh":[24,28,35,105,164,187],"model:":[25],"1)":[26,86],"a":[27,34,89,103,120,163,169,182],"with":[29,36,165,188],"fixed":[30,166],"buses,":[31],"and":[32,61,72,92,98,119,138,146],"2)":[33,93],"reconfigurable":[37,189],"buses.":[38,167],"Both":[39],"these":[40,64,84],"been":[43],"subject":[45],"matter":[46],"extensive":[48],"previous":[49],"research.":[50],"We":[51,111,151],"solve":[52],"numerous":[53],"important":[54],"problems":[55,81],"related":[56],"to":[57],"packet":[58],"routing,":[59,95,132,134,137],"sorting,":[60,97],"selection":[62,176,183],"on":[63,82,88,102,144,162],"models.":[65],"particular,":[67],"provide":[69,112,181],"lower":[70,149],"bounds":[71,77,207],"very":[73],"nearly":[74],"matching":[75,121,148],"upper":[76],"for":[78,106,116,130,185],"following":[80],"both":[83],"models:":[85],"Routing":[87],"linear":[90],"array;":[91],"k-k":[94,96,133,139],"cut":[99,135],"through":[100,136],"routing":[101,118],"2D":[104],"any":[107],"k":[108],"\u2265":[109],"12.":[110],"an":[113,173],"improved":[114],"algorithm":[115,184],"1-1":[117,131],"sorting":[122,140,155],"algorithm.":[123,177],"addition":[125,179],"present":[127,172],"greedy":[128],"algorithms":[129,202],"that":[141,154],"are":[142],"better":[143,196,205],"average":[145],"supply":[147],"bounds.":[150],"also":[152],"show":[153],"can":[156],"be":[157],"performed":[158],"in":[159],"logarithmic":[160],"time":[161,192,206],"As":[168],"consequence":[170],"optimal":[174],"randomized":[175],"buses":[190],"whose":[191],"bound":[193],"is":[194],"significantly":[195],"than":[197,208],"existing":[199,210],"ones.":[200],"Our":[201],"considerably":[204],"many":[209],"best":[211],"known":[212],"algorithms.":[213]},"counts_by_year":[],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}