{"id":"https://openalex.org/W2050188276","doi":"https://doi.org/10.1137/s0097539792240571","title":"An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems","display_name":"An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2050188276","doi":"https://doi.org/10.1137/s0097539792240571","mag":"2050188276"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792240571","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792240571","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00014","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038728087","display_name":"H\u00e5kan Lennerstad","orcid":"https://orcid.org/0000-0001-5389-6179"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"H\u00c5kan Lennerstad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101593386","display_name":"Lars Lundberg","orcid":"https://orcid.org/0000-0002-5031-8215"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lars Lundberg","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038728087"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5302,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.90192209,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"4","first_page":"751","last_page":"764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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.9973000288009644,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9958000183105469,"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/multiprocessing","display_name":"Multiprocessing","score":0.6734041571617126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5569281578063965},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5405203104019165},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5190263986587524},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.48705461621284485},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46561574935913086},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45718783140182495},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.44344601035118103},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.43813619017601013},{"id":"https://openalex.org/keywords/inter-process-communication","display_name":"Inter-process communication","score":0.42786356806755066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42081016302108765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41235360503196716},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1494663953781128},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1209307610988617}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6734041571617126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5569281578063965},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5405203104019165},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5190263986587524},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.48705461621284485},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46561574935913086},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45718783140182495},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.44344601035118103},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.43813619017601013},{"id":"https://openalex.org/C204156049","wikidata":"https://www.wikidata.org/wiki/Q751436","display_name":"Inter-process communication","level":2,"score":0.42786356806755066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42081016302108765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41235360503196716},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1494663953781128},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1209307610988617},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539792240571","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792240571","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:bth-00014","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00014","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:DiVA.org:bth-10253","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:bth-10253","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:bth-00014","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00014","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1991521961","https://openalex.org/W1997265731","https://openalex.org/W2016493597","https://openalex.org/W2029110826","https://openalex.org/W2031469479","https://openalex.org/W2104680817","https://openalex.org/W4213287104"],"related_works":["https://openalex.org/W2153363956","https://openalex.org/W4248282591","https://openalex.org/W2155465335","https://openalex.org/W4322709609","https://openalex.org/W842002197","https://openalex.org/W2113251815","https://openalex.org/W2035179898","https://openalex.org/W2080325608","https://openalex.org/W2056534596","https://openalex.org/W1532083452"],"abstract_inverted_index":{"Consider":[0],"a":[1,41,105,123,139],"multiprocessor":[2],"with":[3,26],"k":[4],"identical":[5],"processors,":[6],"executing":[7],"parallel":[8],"programs":[9,65,77],"consisting":[10,67],"of":[11,68,94,108,112,133,168,171],"n":[12,69,160],"processes.":[13,70],"Let":[14],"$T_{s}(P)$":[15],"and":[16,29,43,88,161],"$T_{d}(P)$":[17],"denote":[18],"the":[19,23,47,59,76,95,109,166,169],"execution":[20,37,50],"times":[21],"for":[22,46,75,86,158],"program":[24],"P":[25,66,78],"optimal":[27,173],"static":[28],"dynamic":[30],"allocations,":[31],"respectively,":[32],"i.e.,":[33],"allocations":[34],"giving":[35],"minimal":[36],"time.":[38],"We":[39],"derive":[40],"general":[42],"explicit":[44],"formula":[45,137],"following":[48],"maximal":[49],"time":[51],"ratio:":[52],"$g(n,":[53,97,113],"k)":[54],"=":[55],"\\max":[56],"T_{s}(P)/T_{d}(P)$,":[57],"where":[58],"maximum":[60],"is":[61,79,90,138,152],"taken":[62],"over":[63],"all":[64],"Any":[71],"interprocess":[72],"dependency":[73],"structure":[74],"allowed":[80],"only":[81],"by":[82,121],"avoiding":[83],"deadlock.":[84],"Overhead":[85],"synchronization":[87],"reallocation":[89],"neglected.":[91],"Basic":[92],"properties":[93],"function":[96,141],"k)$":[98,114],"are":[99,115,119,130],"established,":[100],"from":[101],"which":[102],"we":[103],"obtain":[104],"global":[106],"description":[107],"function.":[110],"Plots":[111],"included.":[116],"The":[117,126,136],"results":[118],"obtained":[120],"investigating":[122],"mathematical":[124,127],"formulation.":[125],"tools":[128,132],"involved":[129],"essentially":[131],"elementary":[134],"combinatorics.":[135],"combinatorial":[140],"applied":[142],"on":[143],"certain":[144],"extremal":[145,149],"matrices":[146],"corresponding":[147],"to":[148,165],"programs.":[150],"It":[151],"mathematically":[153],"complicated":[154],"but":[155],"rapidly":[156],"computed":[157],"reasonable":[159],"k,":[162],"in":[163],"contrast":[164],"np-completeness":[167],"problems":[170],"finding":[172],"allocations.":[174]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}