{"id":"https://openalex.org/W2785815951","doi":"https://doi.org/10.1109/ice.2017.8279875","title":"Periodic scheduling of mixed workload in distributed systems","display_name":"Periodic scheduling of mixed workload in distributed systems","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2785815951","doi":"https://doi.org/10.1109/ice.2017.8279875","mag":"2785815951"},"language":"en","primary_location":{"id":"doi:10.1109/ice.2017.8279875","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ice.2017.8279875","pdf_url":null,"source":{"id":"https://openalex.org/S4306498191","display_name":"2017 International Conference on Engineering, Technology and Innovation (ICE/ITMC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Engineering, Technology and Innovation (ICE/ITMC)","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/A5065495505","display_name":"Georgios L. Stavrinides","orcid":"https://orcid.org/0000-0001-7289-9682"},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Georgios L. Stavrinides","raw_affiliation_strings":["Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054225874","display_name":"Helen D. Karatza","orcid":"https://orcid.org/0000-0002-9789-0585"},"institutions":[{"id":"https://openalex.org/I21370196","display_name":"Aristotle University of Thessaloniki","ror":"https://ror.org/02j61yw88","country_code":"GR","type":"education","lineage":["https://openalex.org/I21370196"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Helen D. Karatza","raw_affiliation_strings":["Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece","institution_ids":["https://openalex.org/I21370196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065495505"],"corresponding_institution_ids":["https://openalex.org/I21370196"],"apc_list":null,"apc_paid":null,"fwci":1.3808,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84238838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"94","last_page":"99"},"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.9994000196456909,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7691435813903809},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7171415090560913},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6839699149131775},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.643466055393219},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.6100782752037048},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6050511002540588},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.6044260263442993},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5588010549545288},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.527533769607544},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.521418571472168},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5205886960029602},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.47064727544784546},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.45032942295074463},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.44840008020401},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.430025577545166},{"id":"https://openalex.org/keywords/lottery-scheduling","display_name":"Lottery scheduling","score":0.42126163840293884},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2425614893436432},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12719345092773438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0877375602722168},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07770326733589172},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.05290910601615906}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7691435813903809},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7171415090560913},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6839699149131775},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.643466055393219},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.6100782752037048},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6050511002540588},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.6044260263442993},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5588010549545288},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.527533769607544},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.521418571472168},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5205886960029602},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.47064727544784546},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.45032942295074463},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.44840008020401},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.430025577545166},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.42126163840293884},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2425614893436432},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12719345092773438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0877375602722168},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07770326733589172},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.05290910601615906}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ice.2017.8279875","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ice.2017.8279875","pdf_url":null,"source":{"id":"https://openalex.org/S4306498191","display_name":"2017 International Conference on Engineering, Technology and Innovation (ICE/ITMC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Engineering, Technology and Innovation (ICE/ITMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W613504204","https://openalex.org/W1903635584","https://openalex.org/W1922045932","https://openalex.org/W1967149974","https://openalex.org/W1971376109","https://openalex.org/W1989033550","https://openalex.org/W1990640262","https://openalex.org/W2057695345","https://openalex.org/W2061511862","https://openalex.org/W2061623386","https://openalex.org/W2069513808","https://openalex.org/W2077154124","https://openalex.org/W2077888324","https://openalex.org/W2085043026","https://openalex.org/W2106649058","https://openalex.org/W2277337510","https://openalex.org/W2310410930","https://openalex.org/W2494242286","https://openalex.org/W2521545175","https://openalex.org/W2546495709","https://openalex.org/W2551094162","https://openalex.org/W2606826455"],"related_works":["https://openalex.org/W2167574351","https://openalex.org/W2184166483","https://openalex.org/W1545991362","https://openalex.org/W2225350526","https://openalex.org/W2557471897","https://openalex.org/W3116619703","https://openalex.org/W2377713709","https://openalex.org/W3134500102","https://openalex.org/W1593612559","https://openalex.org/W2397293317"],"abstract_inverted_index":{"Efficient":[0],"scheduling":[1,18,38,69,109],"of":[2,17,23,56,96],"jobs":[3,25],"in":[4],"distributed":[5,33],"systems":[6],"is":[7,64,76,90],"essential":[8],"to":[9,41,65,84,92],"achieving":[10],"good":[11,87],"performance.":[12,88],"This":[13],"paper":[14],"addresses":[15],"issues":[16],"a":[19,37],"job":[20,108],"mix,":[21],"consisting":[22],"parallel":[24],"and":[26,83],"single-task,":[27],"but":[28],"computationally":[29],"intensive":[30],"jobs,":[31],"on":[32],"processors.":[34],"It":[35],"considers":[36],"algorithm,":[39,47],"referred":[40],"as":[42],"periodic":[43,68,107],"scheduling.":[44],"With":[45],"this":[46,97],"processor":[48],"queues":[49],"are":[50],"rearranged":[51],"only":[52],"at":[53],"the":[54,73,79,94,112],"end":[55],"predefined":[57],"time":[58],"intervals,":[59],"called":[60],"periods.":[61],"The":[62],"goal":[63],"examine":[66],"whether":[67],"can":[70,110],"significantly":[71],"reduce":[72],"overhead":[74],"that":[75,106],"involved":[77],"with":[78],"corresponding":[80],"non-periodic":[81],"policy":[82],"also":[85],"provide":[86],"Simulation":[89,103],"employed":[91],"evaluate":[93],"performance":[95],"algorithm":[98],"for":[99],"different":[100],"period":[101],"sizes.":[102],"results":[104],"demonstrate":[105],"meet":[111],"goal.":[113]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}