{"id":"https://openalex.org/W1507537439","doi":"https://doi.org/10.1007/3-540-35767-x_15","title":"Tree Traversal Scheduling: A Global Instruction Scheduling Technique for VLIW/EPIC Processors","display_name":"Tree Traversal Scheduling: A Global Instruction Scheduling Technique for VLIW/EPIC Processors","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1507537439","doi":"https://doi.org/10.1007/3-540-35767-x_15","mag":"1507537439"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-35767-x_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-35767-x_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5072755725","display_name":"Huiyang Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huiyang Zhou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, USA","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085813354","display_name":"Matthew Jennings","orcid":"https://orcid.org/0000-0002-9720-6640"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew D. Jennings","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, USA","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091080889","display_name":"Thomas M. Conte","orcid":"https://orcid.org/0000-0001-7037-2377"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas M. Conte","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, USA","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072755725"],"corresponding_institution_ids":["https://openalex.org/I137902535"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.396,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.54923858,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"238"},"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.9991999864578247,"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.9991999864578247,"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/T11181","display_name":"Advanced Data Storage Technologies","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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9937999844551086,"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.8526496887207031},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6814628839492798},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.6579716205596924},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.648755669593811},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.620606541633606},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.610395610332489},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6092224717140198},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5444990992546082},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5295632481575012},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5221427083015442},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.48147693276405334},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4682508707046509},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4616734981536865},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.45215746760368347},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.401866614818573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29489052295684814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15092632174491882},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1402643620967865},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10565558075904846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08690458536148071}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8526496887207031},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6814628839492798},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.6579716205596924},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.648755669593811},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.620606541633606},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.610395610332489},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6092224717140198},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5444990992546082},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5295632481575012},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5221427083015442},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.48147693276405334},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4682508707046509},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4616734981536865},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.45215746760368347},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.401866614818573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29489052295684814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15092632174491882},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1402643620967865},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10565558075904846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08690458536148071}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-35767-x_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-35767-x_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W12207660","https://openalex.org/W20727985","https://openalex.org/W1489076252","https://openalex.org/W1491178396","https://openalex.org/W1542604854","https://openalex.org/W1576522284","https://openalex.org/W1583243346","https://openalex.org/W1985463181","https://openalex.org/W2008700807","https://openalex.org/W2063255488","https://openalex.org/W2063639637","https://openalex.org/W2106563495","https://openalex.org/W2116299797","https://openalex.org/W2129962996","https://openalex.org/W2130201065","https://openalex.org/W2142685136","https://openalex.org/W2143894108","https://openalex.org/W2162164368","https://openalex.org/W2164228393","https://openalex.org/W2165064225","https://openalex.org/W2177605905","https://openalex.org/W2244332765","https://openalex.org/W4247440369","https://openalex.org/W6629325410","https://openalex.org/W6635043563","https://openalex.org/W6652772740","https://openalex.org/W6835303316","https://openalex.org/W6991605720"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W2404383452","https://openalex.org/W2545511463","https://openalex.org/W1935185185","https://openalex.org/W2557471897","https://openalex.org/W181259032"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}