{"id":"https://openalex.org/W2075474975","doi":"https://doi.org/10.1137/s0097539797326241","title":"The Power of Migration in Multiprocessor Scheduling of Real-Time Systems","display_name":"The Power of Migration in Multiprocessor Scheduling of Real-Time Systems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2075474975","doi":"https://doi.org/10.1137/s0097539797326241","mag":"2075474975"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797326241","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797326241","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042560079","display_name":"G. Koren","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gilad Koren","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057845242","display_name":"Emanuel Dar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emanuel Dar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048790288","display_name":"Amihood Amir","orcid":"https://orcid.org/0000-0002-3939-337X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amihood Amir","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042560079"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3042,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.63868352,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":"2","first_page":"511","last_page":"527"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","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/T10933","display_name":"Real-Time Systems Scheduling","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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.8003255724906921},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.7001519203186035},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6532120108604431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6291508674621582},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.617636501789093},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6043174862861633},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6039416193962097},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5550119876861572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3100740313529968},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.2867700457572937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22580218315124512},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.214462548494339},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09155339002609253}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.8003255724906921},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.7001519203186035},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6532120108604431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6291508674621582},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.617636501789093},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6043174862861633},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6039416193962097},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5550119876861572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3100740313529968},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2867700457572937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22580218315124512},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.214462548494339},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09155339002609253},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797326241","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797326241","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.8299999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1879402272","https://openalex.org/W2044260124","https://openalex.org/W2066045289","https://openalex.org/W2071866027","https://openalex.org/W2155237069","https://openalex.org/W3163474831"],"related_works":["https://openalex.org/W2045607085","https://openalex.org/W2173841501","https://openalex.org/W99192079","https://openalex.org/W2049602716","https://openalex.org/W2140012984","https://openalex.org/W2104603305","https://openalex.org/W3174582865","https://openalex.org/W2142524277","https://openalex.org/W2023859141","https://openalex.org/W1498584408"],"abstract_inverted_index":{"In":[0,121,171],"this":[1,122],"paper":[2,123],"we":[3,124,149,173],"study":[4],"the":[5,56,75,87,93,105,109,113,166,189,204],"performance":[6],"of":[7,33,58,107,111,165,188],"off-line":[8,25],"multiprocessor":[9,50],"real-time":[10],"schedules":[11],"that":[12,19,115,126,154],"allow":[13],"task":[14,60,76,88,175],"migration":[15],"compared":[16],"to":[17,45,61,77,89,132,157],"those":[18],"forbid":[20],"migration.":[21],"We":[22,136],"consider":[23],"an":[24,180],"scheduling":[26],"problem":[27],"in":[28,95],"which":[29,96,178],"a":[30,37,49,59,68,83,127,144,151],"given":[31],"collection":[32],"tasks,":[34],"each":[35],"with":[36,146],"release":[38],"time,":[39,41],"computation":[40,134],"and":[42,65,139,203],"deadline,":[43],"are":[44],"be":[46,62],"run":[47],"on":[48,79,92],"system.":[51],"A":[52,71,101],"preemptive":[53],"schedule":[54,73,85,102,153,169,183],"allows":[55,74,86],"execution":[57],"temporarily":[63],"suspended":[64],"resumed":[66],"at":[67,159,185],"later":[69],"time.":[70,135],"migrative":[72,168,191],"resume":[78,90],"any":[80],"processor":[81,94],"whereas":[82],"nonmigrative":[84,152,182],"only":[91],"it":[97],"was":[98],"initially":[99],"started.":[100],"value":[103,129],"is":[104,130,155],"summation":[106],"all":[108,112],"values":[110],"tasks":[114],"were":[116],"completed":[117],"by":[118],"their":[119],"deadlines.":[120],"assume":[125],"task's":[128],"proportional":[131],"its":[133],"present":[137],"lower":[138,205],"upper":[140,199],"bound":[141,200,206],"results.":[142],"For":[143],"system":[145],"n":[147],"processors,":[148],"construct":[150],"guaranteed":[156],"achieve":[158],"least":[160],"$1-(":[161],"1-\\frac":[162],"1{2n})":[163],"^n$":[164],"optimal":[167,181,190],"value.":[170,192],"addition,":[172],"show":[174],"sets":[176],"for":[177],"even":[179],"achieves":[184],"most":[186],"n/(2n-1)":[187],"Asymptotically":[193],"(as":[194],"$n\\rightarrow":[195],"\\infty":[196],"$)":[197],"our":[198],"approaches":[201,207],"1/2":[202],"$1":[208],"-":[209],"{1\\over":[210],"\\sqrt{e}}":[211],"\\sim":[212],"0.3935$.":[213]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}