{"id":"https://openalex.org/W2053602868","doi":"https://doi.org/10.1109/hpcsim.2012.6266917","title":"Rectangular vs. triangular minimal routing and performance study","display_name":"Rectangular vs. triangular minimal routing and performance study","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2053602868","doi":"https://doi.org/10.1109/hpcsim.2012.6266917","mag":"2053602868"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2012.6266917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5041529030","display_name":"Dominique D\u00e9s\u00e9rable","orcid":"https://orcid.org/0000-0002-0776-8245"},"institutions":[{"id":"https://openalex.org/I28221208","display_name":"Institut National des Sciences Appliqu\u00e9es de Rennes","ror":"https://ror.org/04xaa4j22","country_code":"FR","type":"education","lineage":["https://openalex.org/I28221208"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique Deserable","raw_affiliation_strings":["Institut National des Sciences Appliqu\u00e9es, Rennes, France","Institut National des Sciences Appliqu\u00e9es, Campus Universitaire de Beaulieu, 35043 Rennes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut National des Sciences Appliqu\u00e9es, Rennes, France","institution_ids":["https://openalex.org/I28221208"]},{"raw_affiliation_string":"Institut National des Sciences Appliqu\u00e9es, Campus Universitaire de Beaulieu, 35043 Rennes, France","institution_ids":["https://openalex.org/I28221208"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012322074","display_name":"Rolf Hoffmann","orcid":"https://orcid.org/0000-0002-1307-4290"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Hoffmann","raw_affiliation_strings":["FB Informatik, FG Rechnerarchitektur, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","Technische Universit\u00e4t Darmstadt, FB Informatik, FG Rechnerarchitektur, Hochschulstra\u00dfe 10, 64289 Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB Informatik, FG Rechnerarchitektur, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt, FB Informatik, FG Rechnerarchitektur, Hochschulstra\u00dfe 10, 64289 Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1572127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"231","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6161714792251587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5354284048080444},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3671634793281555}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6161714792251587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5354284048080444},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3671634793281555}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2012.6266917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W88419225","https://openalex.org/W1574786313","https://openalex.org/W1984520032","https://openalex.org/W1998511581","https://openalex.org/W2021061679","https://openalex.org/W2030013534","https://openalex.org/W2092060716","https://openalex.org/W2105484323","https://openalex.org/W2131672763","https://openalex.org/W2400392393","https://openalex.org/W2408519534","https://openalex.org/W2662764766","https://openalex.org/W4298075269","https://openalex.org/W6604195240","https://openalex.org/W6728882165"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,47,104,107,128,173],"comparative":[4],"study":[5],"of":[6,71,197],"the":[7,11,18,22,81,111,115,150,158,192],"XY-routing":[8],"protocol":[9,20],"in":[10,21,46,68,103,114,147,176,195],"square":[12],"grid":[13,24,152],"\u201cS\u201d":[14],"examined":[15,27],"herein":[16],"with":[17,30,52,74,80,170,180],"XYZ":[19],"triangular":[23],"\u201cT":[25],"\u201d":[26],"elsewhere,":[28],"both":[29,148],"toroidal":[31],"connections":[32],"and":[33,99,182],"N":[34,72],"nodes.":[35],"The":[36,66,162],"routing":[37,165],"problem":[38],"(also":[39,131],"called":[40,132],"multiple":[41],"target":[42,130],"searching)":[43],"is":[44,144,153,185],"performed":[45],"partitioned":[48],"cellular":[49],"automata":[50],"network":[51,67],"agents":[53,124,137,171],"(or":[54],"messages)":[55],"moving":[56,126,139],"from":[57],"sources":[58],"to":[59,86,127,140,178],"targets,":[60],"preferably":[61],"on":[62],"their":[63,87],"minimal":[64,164],"routes.":[65],"S":[69,159],"consists":[70],"nodes":[73,89],"4":[75],"buffers":[76],"per":[77],"node.":[78,117],"Buffers":[79],"same":[82],"names":[83],"are":[84,120,125,138],"connected":[85],"neighboring":[88],"via":[90],"unidirectional":[91],"links.":[92],"Each":[93],"buffer":[94,105,113],"may":[95],"host":[96],"an":[97],"agent":[98,101],"each":[100],"situated":[102],"has":[106],"computed":[108],"direction":[109,175],"defining":[110],"new":[112],"adjacent":[116],"Two":[118],"scenarios":[119],"examined:":[121],"(i)":[122],"N-1":[123],"common":[129],"\u201call-to-one":[133],"gathering\u201d)":[134],"(ii)":[135],"N/2":[136,141],"targets.":[142],"It":[143,184],"shown":[145,186],"that":[146,187],"cases":[149],"T":[151],"1.5":[154],"times":[155],"faster":[156],"than":[157],"grid.":[160],"-":[161],"deterministic":[163],"protocols":[166],"were":[167],"also":[168],"randomized,":[169],"choosing":[172],"random":[174],"order":[177],"cope":[179],"congestion":[181],"deadlocks.":[183],"randomization":[188],"can":[189,203],"slightly":[190],"shorten":[191],"transfer":[193],"time":[194],"case":[196],"congestion,":[198],"but,":[199],"more":[200],"important,":[201],"deadlocks":[202],"be":[204],"resolved.":[205]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}