{"id":"https://openalex.org/W2036687003","doi":"https://doi.org/10.1080/10798587.2011.10643172","title":"Fast Navigation-Placement Tree Algorithm For Reconfigurable Computing System","display_name":"Fast Navigation-Placement Tree Algorithm For Reconfigurable Computing System","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2036687003","doi":"https://doi.org/10.1080/10798587.2011.10643172","mag":"2036687003"},"language":"en","primary_location":{"id":"doi:10.1080/10798587.2011.10643172","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10798587.2011.10643172","pdf_url":null,"source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation &amp; Soft Computing","raw_type":"journal-article"},"type":"article","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/A5052285379","display_name":"Huanhuan Song","orcid":"https://orcid.org/0000-0001-8591-6939"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Huan-Huan Song","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010474232","display_name":"Wang Shu-zong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shu-Zong Wang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019852123","display_name":"Shao Li-bing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li-Bing Shao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100379245","display_name":"Li Chen","orcid":"https://orcid.org/0000-0002-4228-7885"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li Chen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100782565","display_name":"Xiaofang Zhang","orcid":"https://orcid.org/0000-0002-8667-0456"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao-Fang Zhang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5052285379"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09706977,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"5","first_page":"583","last_page":"593"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.9285967350006104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5667970776557922},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3809363842010498}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9285967350006104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5667970776557922},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3809363842010498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10798587.2011.10643172","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10798587.2011.10643172","pdf_url":null,"source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation &amp; Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1497869708","https://openalex.org/W2006909200","https://openalex.org/W2029243826","https://openalex.org/W2079543149","https://openalex.org/W2097869799","https://openalex.org/W2115294662","https://openalex.org/W2149935414","https://openalex.org/W2253312567"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2317200988","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829"],"abstract_inverted_index":{"Abstract":[0],"Due":[1],"to":[2,5,60,89],"its":[3],"potential":[4],"greatly":[6],"accelerate":[7],"a":[8,17,20],"wide":[9],"variety":[10],"of":[11,19,23,33,68,92,105],"applications,":[12],"reconfigurable":[13],"computing":[14],"has":[15],"become":[16],"subject":[18],"great":[21],"deal":[22],"research.":[24],"In":[25],"this":[26],"paper,":[27],"we":[28,41],"explore":[29],"the":[30,45,62,75,78,90,100,106],"representation":[31,51],"models":[32],"1D":[34],"routing":[35,39],"structure":[36],"and":[37,77,87,102],"2D":[38],"structure,":[40],"also":[42],"focus":[43],"on":[44,85,95],"task":[46],"scheduling":[47,63,67],"that":[48],"targets":[49],"these":[50],"models.":[52],"A":[53],"fast":[54],"navigation-placement":[55],"tree":[56],"algorithm":[57],"is":[58],"proposed":[59,107],"formulate":[61],"problem":[64,91],"for":[65],"guarantee-based":[66],"hardware":[69],"tasks.":[70],"We":[71],"present":[72],"two":[73],"heuristics,":[74],"horizon":[76],"vertical":[79],"technique,":[80],"which":[81],"can":[82],"be":[83],"summarized":[84],"bin-packing":[86],"applied":[88],"placing":[93],"tasks":[94],"guarantees.":[96],"Simulation":[97],"experiments":[98],"evaluate":[99],"performance":[101],"runtime":[103],"efficiency":[104],"algorithm.":[108]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
