{"id":"https://openalex.org/W2165418644","doi":"https://doi.org/10.3217/jucs-014-21-3465","title":"Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor","display_name":"Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2165418644","doi":"https://doi.org/10.3217/jucs-014-21-3465","mag":"2165418644"},"language":"en","primary_location":{"id":"pmh:oai:americanae.aecid.es:2833267","is_oa":true,"landing_page_url":"http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/60288","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Web of Science","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/60288","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034422755","display_name":"Ricardo Santos","orcid":"https://orcid.org/0000-0002-2955-8011"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ricardo Santos","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2955-8011","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005402339","display_name":"Rodolfo Azevedo","orcid":"https://orcid.org/0000-0002-8803-0401"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rodolfo Azevedo","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8803-0401","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067675731","display_name":"Guido Ara\u00fajo","orcid":"https://orcid.org/0000-0003-4869-5190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guido Ara\u00fajo","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4869-5190","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13995555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":null,"first_page":"3465","last_page":"3480"},"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.9987000226974487,"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.9987000226974487,"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.9980000257492065,"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.9968000054359436,"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.865479588508606},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7834513187408447},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7564773559570312},{"id":"https://openalex.org/keywords/very-long-instruction-word","display_name":"Very long instruction word","score":0.7537531852722168},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5834219455718994},{"id":"https://openalex.org/keywords/instruction-scheduling","display_name":"Instruction scheduling","score":0.4988999366760254},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.489153653383255},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4511808156967163},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4124515652656555},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.290224552154541},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.27988481521606445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2730870246887207},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.20509088039398193},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1345687210559845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11085540056228638},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10768464207649231},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.07616668939590454},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07412028312683105}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.865479588508606},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7834513187408447},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7564773559570312},{"id":"https://openalex.org/C170595534","wikidata":"https://www.wikidata.org/wiki/Q249743","display_name":"Very long instruction word","level":2,"score":0.7537531852722168},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5834219455718994},{"id":"https://openalex.org/C73564150","wikidata":"https://www.wikidata.org/wiki/Q11417093","display_name":"Instruction scheduling","level":5,"score":0.4988999366760254},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.489153653383255},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4511808156967163},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4124515652656555},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.290224552154541},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.27988481521606445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2730870246887207},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.20509088039398193},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1345687210559845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11085540056228638},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10768464207649231},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.07616668939590454},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07412028312683105}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:americanae.aecid.es:2833267","is_oa":true,"landing_page_url":"http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/60288","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Web of Science","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:zenodo.org:7000571","is_oa":true,"landing_page_url":"https://zenodo.org/record/7000571","pdf_url":"https://zenodo.org/record/7000571","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"JUCS - Journal of Universal Computer Science 14((21)) 3465-3480","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.1559","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.1559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_14_21/instruction_scheduling_based_on/jucs_14_21_3465_3480_santos.pdf","raw_type":"text"},{"id":"mag:2165418644","is_oa":false,"landing_page_url":"http://www.jucs.org/jucs_14_21/instruction_scheduling_based_on/jucs_14_21_3465_3480_santos.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S58563349","display_name":"JUCS - Journal of Universal Computer Science","issn_l":"0948-695X","issn":["0948-695X","0948-6968"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317875","host_organization_name":"Verlag der Technischen Universit\u00e4t Graz","host_organization_lineage":["https://openalex.org/P4310317875"],"host_organization_lineage_names":["Verlag der Technischen Universit\u00e4t Graz"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"JUCS - Journal of Universal Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:americanae.aecid.es:2833267","is_oa":true,"landing_page_url":"http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/60288","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Web of Science","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W135031542","https://openalex.org/W2011039300","https://openalex.org/W2016628444","https://openalex.org/W2048905935","https://openalex.org/W2092904196","https://openalex.org/W2116299797","https://openalex.org/W2117285153","https://openalex.org/W2123502373","https://openalex.org/W2126359798","https://openalex.org/W2137991591","https://openalex.org/W2144624157","https://openalex.org/W2152958194","https://openalex.org/W2153633722","https://openalex.org/W2160401437","https://openalex.org/W2891212941"],"related_works":["https://openalex.org/W2041909047","https://openalex.org/W2110250220","https://openalex.org/W2120594251","https://openalex.org/W2132681076","https://openalex.org/W2098441418","https://openalex.org/W2063024682","https://openalex.org/W2382683541","https://openalex.org/W2015261337","https://openalex.org/W2093375142","https://openalex.org/W1581566161","https://openalex.org/W2144842569","https://openalex.org/W2126675596","https://openalex.org/W2020234097","https://openalex.org/W2159324394","https://openalex.org/W2038076412","https://openalex.org/W2113977546","https://openalex.org/W1832975005","https://openalex.org/W1843331169","https://openalex.org/W2095265034","https://openalex.org/W3005576145"],"abstract_inverted_index":{"Abstract:":[0],"This":[1],"paper":[2],"1":[3],"presents":[4],"an":[5],"instruction":[6],"scheduling":[7,88,131],"algorithm":[8,23,83,115],"based":[9],"on":[10],"the":[11,50,53,69,93,101,123,129],"Subgraph":[12],"Isomorphism":[13],"Problem.":[14],"Given":[15],"a":[16,26,32,57,85],"Directed":[17],"Acyclic":[18],"Graph":[19],"(DAG)":[20],"G1,":[21],"our":[22,99,114],"looks":[24],"for":[25],"subgraph":[27],"G":[28,38,65],"\u2032":[29,39,66],"2":[30,40,67],"in":[31,79],"base":[33,46],"graph":[34,47],"G2,":[35],"such":[36],"that":[37],"is":[41,68],"isomorphic":[42],"to":[43,76],"G1.":[44,80],"The":[45],"G2":[48],"represents":[49],"arrangement":[51],"of":[52,56,71,92],"processing":[54,73],"elements":[55,74],"high":[58],"performance":[59],"computer":[60],"architecture":[61],"named":[62],"2D-VLIW":[63],"and":[64,95,107,118,125],"set":[70],"those":[72],"required":[75],"execute":[77],"operations":[78],"Wehavecompared":[81],"this":[82],"with":[84],"greedy":[86],"list":[87,130],"strategy":[89],"using":[90],"programs":[91],"SPEC":[94],"MediaBench":[96],"suites.":[97],"In":[98],"experiments,":[100],"average":[102],"Operation":[103],"Per":[104,109],"Cycle":[105],"(OPC)":[106],"Operations":[108],"Instruction":[110],"(OPI)":[111],"achieved":[112],"by":[113,128],"are":[116],"1.45":[117],"1.40":[119],"times":[120],"better":[121],"than":[122],"OPC":[124],"OPI":[126],"obtained":[127],"algorithm.":[132]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2025-10-10T00:00:00"}