{"id":"https://openalex.org/W3144161048","doi":"https://doi.org/10.1109/date.2007.364567","title":"A Decomposition-based Constraint Optimization Approach for Statically Scheduling Task Graphs with Communication Delays to Multiprocessors","display_name":"A Decomposition-based Constraint Optimization Approach for Statically Scheduling Task Graphs with Communication Delays to Multiprocessors","publication_year":2007,"publication_date":"2007-04-01","ids":{"openalex":"https://openalex.org/W3144161048","doi":"https://doi.org/10.1109/date.2007.364567","mag":"3144161048"},"language":"en","primary_location":{"id":"doi:10.1109/date.2007.364567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2007.364567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Design, Automation &amp; Test in Europe Conference &amp; Exhibition","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/A5111985072","display_name":"Nadathur Satish","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nadathur Satish","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069949620","display_name":"Kaushik Ravindran","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaushik Ravindran","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047285420","display_name":"Kurt Keutzer","orcid":"https://orcid.org/0000-0003-3868-8501"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kurt Keutzer","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3474,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84668419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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.9984999895095825,"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.9969000220298767,"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.7570191621780396},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.674113929271698},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6706274151802063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6195216178894043},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5897728800773621},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.549475371837616},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5264747142791748},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5183321237564087},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.516715943813324},{"id":"https://openalex.org/keywords/extensibility","display_name":"Extensibility","score":0.49212926626205444},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.4584370255470276},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4501804709434509},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40693193674087524},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.392054945230484},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37031057476997375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15362167358398438},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.12430503964424133},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11713644862174988},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09260246157646179},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.07246625423431396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7570191621780396},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.674113929271698},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6706274151802063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6195216178894043},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5897728800773621},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.549475371837616},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5264747142791748},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5183321237564087},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.516715943813324},{"id":"https://openalex.org/C32833848","wikidata":"https://www.wikidata.org/wiki/Q4115054","display_name":"Extensibility","level":2,"score":0.49212926626205444},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.4584370255470276},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4501804709434509},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40693193674087524},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.392054945230484},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37031057476997375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15362167358398438},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.12430503964424133},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11713644862174988},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09260246157646179},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.07246625423431396},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2007.364567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2007.364567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 Design, Automation &amp; Test in Europe Conference &amp; Exhibition","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1503117285","https://openalex.org/W1607435899","https://openalex.org/W2040466547","https://openalex.org/W2043331236","https://openalex.org/W2084327596","https://openalex.org/W2097911714","https://openalex.org/W2120431055","https://openalex.org/W2131167145","https://openalex.org/W2141628696","https://openalex.org/W4243414876","https://openalex.org/W4249472430","https://openalex.org/W6630022660","https://openalex.org/W6636275648"],"related_works":["https://openalex.org/W2097415053","https://openalex.org/W1514298554","https://openalex.org/W1486916474","https://openalex.org/W4243324743","https://openalex.org/W1531664660","https://openalex.org/W2120647900","https://openalex.org/W1496100162","https://openalex.org/W4303044088","https://openalex.org/W1504425306","https://openalex.org/W2144661158"],"abstract_inverted_index":{"The":[0,91],"paper":[1],"presents":[2],"a":[3,12,83,100,107],"decomposition":[4,56,101],"strategy":[5,57],"to":[6,35,61],"speed":[7],"up":[8],"constraint":[9,59,73,104],"optimization":[10,60,105],"for":[11,89,110],"representative":[13],"multiprocessor":[14,115],"scheduling":[15,113],"problem.":[16],"In":[17],"the":[18,29,37,70],"manner":[19],"of":[20,28,72,85],"Benders":[21],"decomposition,":[22],"our":[23],"technique":[24],"solves":[25],"relaxed":[26],"versions":[27],"problem":[30],"and":[31,78,114],"iteratively":[32],"learns":[33],"constraints":[34],"prune":[36],"solution":[38],"space.":[39],"Typical":[40],"formulations":[41,74],"suffer":[42],"prohibitive":[43],"run":[44,97],"times":[45,98],"even":[46],"on":[47],"medium-sized":[48],"problems":[49],"with":[50,65,95],"less":[51],"than":[52],"30":[53],"tasks.":[54,68],"Our":[55],"enhances":[58],"robustly":[62],"handle":[63],"instances":[64],"over":[66],"100":[67],"Moreover,":[69],"extensibility":[71],"permits":[75],"realistic":[76],"application":[77],"resource":[79,111],"constraints,":[80],"which":[81],"is":[82],"limitation":[84],"common":[86],"heuristic":[87],"methods":[88],"scheduling.":[90],"inherent":[92],"extensibility,":[93],"coupled":[94],"improved":[96],"from":[99],"strategy,":[102],"posit":[103],"as":[106],"powerful":[108],"tool":[109],"constrained":[112],"design":[116],"space":[117],"exploration":[118]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
