{"id":"https://openalex.org/W2014098111","doi":"https://doi.org/10.1142/s0129626497000115","title":"Competitive Dynamic Multiprocessor Allocation for Parallel Applications","display_name":"Competitive Dynamic Multiprocessor Allocation for Parallel Applications","publication_year":1997,"publication_date":"1997-03-01","ids":{"openalex":"https://openalex.org/W2014098111","doi":"https://doi.org/10.1142/s0129626497000115","mag":"2014098111"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626497000115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626497000115","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5063822230","display_name":"Timothy Brecht","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Timothy Brecht","raw_affiliation_strings":["Department of Computer Science,  York University, 4700 Keele Street, North York, Ontario, Canada  M3J\u20091P3, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  York University, 4700 Keele Street, North York, Ontario, Canada  M3J\u20091P3, Canada","institution_ids":["https://openalex.org/I192455969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100638710","display_name":"Xiaotie Deng","orcid":"https://orcid.org/0000-0002-5282-6467"},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Xiaotie Deng","raw_affiliation_strings":["Department of Computer Science,  York University, 4700 Keele Street, North York, Ontario, Canada  M3J\u20091P3, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  York University, 4700 Keele Street, North York, Ontario, Canada  M3J\u20091P3, Canada","institution_ids":["https://openalex.org/I192455969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062579865","display_name":"Nian Gu","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nian Gu","raw_affiliation_strings":["Department of Computer Science,  York University, 4700 Keele Street, North York, Ontario, Canada  M3J\u20091P3, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  York University, 4700 Keele Street, North York, Ontario, Canada  M3J\u20091P3, Canada","institution_ids":["https://openalex.org/I192455969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I192455969"],"apc_list":null,"apc_paid":null,"fwci":0.4996,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.72592086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"07","issue":"01","first_page":"89","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9952999949455261,"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/computer-science","display_name":"Computer science","score":0.8270856738090515},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.8176445960998535},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7718703746795654},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7237215042114258},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7208161950111389},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5793095231056213},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5482268929481506},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5359113812446594},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5098552107810974},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.41980522871017456},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3253285884857178},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.16738075017929077},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1623779535293579},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12710130214691162},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1222497820854187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08150753378868103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8270856738090515},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.8176445960998535},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7718703746795654},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7237215042114258},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7208161950111389},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5793095231056213},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5482268929481506},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5359113812446594},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5098552107810974},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.41980522871017456},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3253285884857178},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.16738075017929077},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1623779535293579},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12710130214691162},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1222497820854187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08150753378868103},{"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/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626497000115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626497000115","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.2817","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.uwaterloo.ca/~brecht/papers/getpaper.php?file=Brecht_Deng_Gu_SPDP95.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5299999713897705,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W1881329561","https://openalex.org/W1493790977","https://openalex.org/W2358378335","https://openalex.org/W3135987664","https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W1977040436","https://openalex.org/W1640420690","https://openalex.org/W212211351"],"abstract_inverted_index":{"We":[0,40,111,144],"study":[1],"dynamic":[2],"multiprocessor":[3],"allocation":[4],"policies":[5],"for":[6,151,180],"parallel":[7,43,63,154,167,185],"jobs,":[8],"which":[9,54,128,181],"allow":[10],"the":[11,28,32,56,81,88,91,103,106,113,131,138,162,182],"preemption":[12],"and":[13,67,123],"reallocation":[14],"of":[15,31,58,93,115,142,184,195],"processors":[16,77],"to":[17,26,35,80,87,102,118,164,177],"take":[18],"place":[19],"at":[20],"any":[21],"time.":[22],"The":[23,48,83,95],"objective":[24],"is":[25,55,90,99,109,136],"minimize":[27],"completion":[29],"time":[30,98],"last":[33],"job":[34,44,96],"finish":[36],"executing":[37],"(the":[38],"makespan).":[39],"characterize":[41],"a":[42,65],"using":[45],"two":[46,153],"parameter.":[47],"job's":[49,107],"parallelism,":[50],"P":[51,75,157,170],"i":[52,72,76],",":[53,73],"number":[57,183],"tasks":[59,186],"being":[60],"executed":[61],"in":[62,126],"by":[64],"job,":[66],"its":[68],"execution":[69,97,108,189],"time,":[70],"l":[71],"when":[74],"are":[78,124],"allocated":[79],"job.":[82],"only":[84],"information":[85],"available":[86],"scheduler":[89,104],"parallelism":[92],"jobs.":[94],"not":[100],"known":[101],"until":[105],"completed.":[110],"apply":[112,161],"approach":[114],"competitive":[116,133,148],"analysis":[117],"compare":[119],"preemptive":[120],"scheduling":[121,149,152],"policies,":[122],"interested":[125],"determining":[127],"policy":[129,150],"achieves":[130],"best":[132],"ratio":[134],"(i.e.,":[135,190],"within":[137],"smallest":[139],"constant":[140],"factor":[141],"optimal).":[143],"devise":[145],"an":[146],"optimal":[147],"jobs":[155,168,179,191],"on":[156,169],"processors.":[158,171],"Then,":[159],"we":[160,173],"method":[163],"schedule":[165],"N":[166],"Finally":[172],"extend":[174],"our":[175],"work":[176],"incorporate":[178],"changes":[187],"during":[188],"with":[192],"multiple":[193],"phases":[194],"parallelism).":[196]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}