{"id":"https://openalex.org/W1966506775","doi":"https://doi.org/10.1016/0141-9331(93)90056-d","title":"Optimal algorithms for the many-to-one routing problem on two-dimensional meshes","display_name":"Optimal algorithms for the many-to-one routing problem on two-dimensional meshes","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W1966506775","doi":"https://doi.org/10.1016/0141-9331(93)90056-d","mag":"1966506775"},"language":"en","primary_location":{"id":"doi:10.1016/0141-9331(93)90056-d","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0141-9331(93)90056-d","pdf_url":null,"source":{"id":"https://openalex.org/S195663827","display_name":"Microprocessors and Microsystems","issn_l":"0141-9331","issn":["0141-9331","1872-9436"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Microprocessors and Microsystems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/0141-9331(93)90056-d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044363105","display_name":"Fillia Makedon","orcid":"https://orcid.org/0009-0001-8831-6872"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fillia Makedon","raw_affiliation_strings":["Department of Mathematics and Computer Science, Dartmouth College, 6188 Bradley Hall, Room 305, Hanover, NH 03755-3551, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Dartmouth College, 6188 Bradley Hall, Room 305, Hanover, NH 03755-3551, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011976306","display_name":"Antonios Symvonis","orcid":"https://orcid.org/0000-0002-0280-741X"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Antonios Symvonis","raw_affiliation_strings":["Basser Department of Computer Science, University of Sydney, Sydney, NSW 2006, Australia","Basser Department of Computer Science, University of Sydney, Sydney, NSW 2006, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"Basser Department of Computer Science, University of Sydney, Sydney, NSW 2006, Australia","institution_ids":["https://openalex.org/I129604602"]},{"raw_affiliation_string":"Basser Department of Computer Science, University of Sydney, Sydney, NSW 2006, Australia#TAB#","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011976306","https://openalex.org/A5044363105"],"corresponding_institution_ids":["https://openalex.org/I107672454","https://openalex.org/I129604602"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":{"value":2200,"currency":"USD","value_usd":2200},"fwci":1.92,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86186083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"6","first_page":"361","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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.9998999834060669,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.9957000017166138,"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/computer-science","display_name":"Computer science","score":0.8853971362113953},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6031484007835388},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.600490391254425},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5893095135688782},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.5601156949996948},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4829230010509491},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4618716537952423},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4385642409324646},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.41686874628067017},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38942500948905945},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.38483449816703796},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3694472908973694},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3190229535102844},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.20055797696113586}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8853971362113953},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6031484007835388},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.600490391254425},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5893095135688782},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.5601156949996948},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4829230010509491},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4618716537952423},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4385642409324646},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.41686874628067017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38942500948905945},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.38483449816703796},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3694472908973694},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3190229535102844},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20055797696113586},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0141-9331(93)90056-d","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0141-9331(93)90056-d","pdf_url":null,"source":{"id":"https://openalex.org/S195663827","display_name":"Microprocessors and Microsystems","issn_l":"0141-9331","issn":["0141-9331","1872-9436"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Microprocessors and Microsystems","raw_type":"journal-article"},{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/23598","is_oa":true,"landing_page_url":"http://doi.org/10.1016/0141-9331(93)90056-D","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Microprocessors and Microsystems","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/0141-9331(93)90056-d","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0141-9331(93)90056-d","pdf_url":null,"source":{"id":"https://openalex.org/S195663827","display_name":"Microprocessors and Microsystems","issn_l":"0141-9331","issn":["0141-9331","1872-9436"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Microprocessors and Microsystems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1519425125","https://openalex.org/W1968312484","https://openalex.org/W1968358793","https://openalex.org/W1980907788","https://openalex.org/W2012216209","https://openalex.org/W2150586297","https://openalex.org/W6631141732","https://openalex.org/W6631918114","https://openalex.org/W6653590448","https://openalex.org/W6682476947"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W3035942111","https://openalex.org/W2347665962","https://openalex.org/W2138640781","https://openalex.org/W2351097701","https://openalex.org/W1971663816","https://openalex.org/W2555559350","https://openalex.org/W2162880363","https://openalex.org/W2001312276","https://openalex.org/W4237143639"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,118],"consider":[4,119],"the":[5,11,24,36,56,72,87,109,113,123,129,139,143,149],"many-to-one":[6,57,124],"packet":[7,58,125],"routing":[8,59,64,126],"problem":[9,16,60,88],"on":[10,35,40],"mesh":[12,114],"parallel":[13,46],"architecture.":[14],"This":[15,102],"has":[17],"not":[18,134],"been":[19],"considered":[20],"before.":[21],"It":[22],"models":[23],"communication":[25],"pattern":[26],"that":[27,50,61,85,145],"occurs":[28],"when":[29],"many":[30],"processors":[31],"try":[32],"to":[33,66,111],"write":[34],"same":[37,150],"memory":[38,45],"location":[39],"a":[41,77],"concurrent-read":[42],"concurrent-write":[43],"shared":[44],"machine.":[47],"We":[48,81],"show":[49],"there":[51],"is":[52,71,105,115,133,152],"an":[53,83],"instance":[54],"of":[55,75,98,122],"requires":[62],"n\u221ak/2":[63],"steps":[65],"be":[67],"solved,":[68],"where":[69,131,141],"k":[70,132],"maximum":[73],"number":[74],"packets":[76,144],"processor":[78,151],"can":[79],"receive.":[80],"give":[82],"algorithm":[84,95],"solves":[86],"in":[89,136],"asymptotically":[90],"optimal":[91],"time.":[92],"Furthermore,":[93],"our":[94],"uses":[96],"queues":[97],"small":[99],"constant":[100],"size.":[101],"queue":[103],"bound":[104],"very":[106],"important":[107],"since":[108],"ability":[110],"expand":[112],"preserved.":[116],"Finally,":[117],"two":[120],"variations":[121],"problem,":[127],"namely,":[128],"case":[130,140],"known":[135],"advance,":[137],"and":[138],"combining":[142],"are":[146],"destined":[147],"for":[148],"allowed.":[153]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}