{"id":"https://openalex.org/W4235719931","doi":"https://doi.org/10.1109/icppw.2004.1328065","title":"A graph matching based integrated scheduling framework for clustered VLIW processors","display_name":"A graph matching based integrated scheduling framework for clustered VLIW processors","publication_year":2005,"publication_date":"2005-04-05","ids":{"openalex":"https://openalex.org/W4235719931","doi":"https://doi.org/10.1109/icppw.2004.1328065"},"language":"en","primary_location":{"id":"doi:10.1109/icppw.2004.1328065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2004.1328065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshops on Mobile and Wireless Networking/High Performance Scientific, Engineering Computing/Network Design and Architecture/Optical Networks Control and Management/Ad Hoc and Sensor Networks/Compile and Run Time Techniques for Parallel Computing ICPP 2004","raw_type":"proceedings-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/A5011445666","display_name":"Rahul Nagpal","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"R. Nagpal","raw_affiliation_strings":["Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060267690","display_name":"Y. N. Srikant","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Y.N. Srikant","raw_affiliation_strings":["Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011445666"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.7734,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76403061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"530","last_page":"537"},"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.9987999796867371,"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.9987999796867371,"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.9983999729156494,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9891999959945679,"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/very-long-instruction-word","display_name":"Very long instruction word","score":0.93085777759552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8653075098991394},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6917338967323303},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6551979184150696},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.5811315178871155},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5548549294471741},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.537479043006897},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5050893425941467},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49749353528022766},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.3749697208404541},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.2815955877304077},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.20767459273338318},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0822691023349762},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.07968229055404663}],"concepts":[{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.93085777759552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8653075098991394},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6917338967323303},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6551979184150696},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.5811315178871155},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5548549294471741},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.537479043006897},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5050893425941467},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49749353528022766},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.3749697208404541},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2815955877304077},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.20767459273338318},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0822691023349762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.07968229055404663},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icppw.2004.1328065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2004.1328065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshops on Mobile and Wireless Networking/High Performance Scientific, Engineering Computing/Network Design and Architecture/Optical Networks Control and Management/Ad Hoc and Sensor Networks/Compile and Run Time Techniques for Parallel Computing ICPP 2004","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W82951293","https://openalex.org/W105128281","https://openalex.org/W2023200270","https://openalex.org/W2056497280","https://openalex.org/W2069763700","https://openalex.org/W2093650773","https://openalex.org/W2129207930","https://openalex.org/W2132148829","https://openalex.org/W2141173785","https://openalex.org/W2156417149","https://openalex.org/W3147835733","https://openalex.org/W4235719931","https://openalex.org/W4237382706","https://openalex.org/W4246160707","https://openalex.org/W4246289115","https://openalex.org/W4249006057","https://openalex.org/W4298132153","https://openalex.org/W6603402581","https://openalex.org/W6604335647","https://openalex.org/W6793159789"],"related_works":["https://openalex.org/W2734211308","https://openalex.org/W1506210504","https://openalex.org/W2103250493","https://openalex.org/W2353958330","https://openalex.org/W4213212800","https://openalex.org/W2134136106","https://openalex.org/W4242411138","https://openalex.org/W89872709","https://openalex.org/W2684728181","https://openalex.org/W1590524758"],"abstract_inverted_index":{"Scheduling":[0],"for":[1,40],"clustered":[2,20,89],"architectures":[3],"involves":[4],"spatial":[5],"concerns":[6,14],"(where":[7],"to":[8,16,33,59],"schedule)":[9,17],"as":[10,12],"well":[11],"temporal":[13],"(when":[15],"and":[18,25,53,81,104,115],"various":[19,95],"VLIW":[21,90],"configurations,":[22],"connectivity":[23],"types,":[24],"inter-cluster":[26],"communication":[27,56],"models":[28],"present":[29],"different":[30],"performance":[31,62,109],"trade-offs":[32],"a":[34,71,88,116],"scheduler.":[35],"The":[36],"scheduler":[37],"is":[38],"responsible":[39],"resolving":[41],"the":[42,47,51,55,65,79,108],"conflicting":[43],"requirements":[44],"of":[45,98],"exploiting":[46],"parallelism":[48],"offered":[49],"by":[50,92],"hardware":[52],"limiting":[54],"among":[57],"clusters":[58],"achieve":[60],"better":[61],"without":[63,120],"stretching":[64],"overall":[66],"schedule.":[67],"This":[68],"paper":[69],"proposes":[70],"generic":[72],"graph":[73],"matching":[74],"based":[75],"framework":[76],"that":[77],"resolves":[78],"phase-ordering":[80],"fixedordering":[82],"problems":[83],"associated":[84],"with":[85],"scheduling":[86,96],"on":[87],"processor":[91],"simultaneously":[93],"considering":[94],"alternatives":[97],"instructions.":[99],"We":[100],"observe":[101],"approximately":[102],"16%":[103],"28%":[105],"improvement":[106],"in":[107],"over":[110],"an":[111],"earlier":[112],"integrated":[113],"scheme":[114,118],"phase-decoupled":[117],"respectively":[119],"extra":[121],"code":[122],"size":[123],"penalty.":[124]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}