{"id":"https://openalex.org/W1896513443","doi":"https://doi.org/10.1109/ftdcs.2004.1316602","title":"Two stage optimization of job scheduling and assignment in heterogeneous compute farms","display_name":"Two stage optimization of job scheduling and assignment in heterogeneous compute farms","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W1896513443","doi":"https://doi.org/10.1109/ftdcs.2004.1316602","mag":"1896513443"},"language":"en","primary_location":{"id":"doi:10.1109/ftdcs.2004.1316602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ftdcs.2004.1316602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","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/A5039219109","display_name":"L. Markov","orcid":null},"institutions":[{"id":"https://openalex.org/I1342911587","display_name":"Oracle (United States)","ror":"https://ror.org/006c77m33","country_code":"US","type":"company","lineage":["https://openalex.org/I1342911587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"L. Markov","raw_affiliation_strings":["Sun Microsystems, Inc., USA","Sun Microsystems, Inc.#TAB#"],"affiliations":[{"raw_affiliation_string":"Sun Microsystems, Inc., USA","institution_ids":[]},{"raw_affiliation_string":"Sun Microsystems, Inc.#TAB#","institution_ids":["https://openalex.org/I1342911587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039219109"],"corresponding_institution_ids":["https://openalex.org/I1342911587"],"apc_list":null,"apc_paid":null,"fwci":0.6952,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75379367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"124"},"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.9993000030517578,"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.9993000030517578,"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.9911999702453613,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.989799976348877,"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.7949762344360352},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7560268640518188},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6604912877082825},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6169365048408508},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.590638279914856},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5115424394607544},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.49884510040283203},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4689089059829712},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.46013015508651733},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41214263439178467},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20349305868148804},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15986740589141846},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.13219985365867615},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.062009841203689575}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7949762344360352},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7560268640518188},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6604912877082825},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6169365048408508},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.590638279914856},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5115424394607544},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.49884510040283203},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4689089059829712},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.46013015508651733},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41214263439178467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20349305868148804},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15986740589141846},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13219985365867615},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.062009841203689575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","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/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ftdcs.2004.1316602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ftdcs.2004.1316602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1505990572","https://openalex.org/W1599248213","https://openalex.org/W2138307431","https://openalex.org/W6635848423"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W2106332846","https://openalex.org/W2397293317","https://openalex.org/W2167574351","https://openalex.org/W2372008037","https://openalex.org/W3184267879","https://openalex.org/W2978148977","https://openalex.org/W2014733634","https://openalex.org/W2070629337"],"abstract_inverted_index":{"Distributed":[0],"networked":[1],"computing":[2],"in":[3,12,29,76],"a":[4,19,30,44,57,65,72,83],"compute":[5,20],"farm":[6,21,78],"environment":[7],"has":[8],"attracted":[9],"great":[10],"attention":[11],"recent":[13],"years.":[14],"Specialized":[15],"management":[16,74],"system":[17,42,75],"for":[18,71],"enables":[22],"heterogeneous":[23],"distributed":[24,77],"resources":[25],"to":[26,52,90],"be":[27],"shared":[28],"seamless":[31],"way":[32],"between":[33],"various":[34],"competing":[35],"jobs.":[36],"A":[37],"key":[38],"functionality":[39],"of":[40,50,59,67],"such":[41],"is":[43],"scheduler":[45],"that":[46],"controls":[47],"the":[48,93],"assignment":[49],"jobs":[51],"resources.":[53],"This":[54],"paper":[55],"outlines":[56],"range":[58],"scheduling":[60,69,88,94],"constrains":[61],"as":[62,64],"well":[63],"list":[66],"required":[68],"features":[70],"state-of-the-art":[73],"computing.":[79],"It":[80],"also":[81],"presents":[82],"novel":[84],"two":[85],"stage":[86],"static-dynamic":[87],"algorithm":[89],"deal":[91],"with":[92],"complexity.":[95]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}