{"id":"https://openalex.org/W2787375936","doi":"https://doi.org/10.1109/ice.2017.8279883","title":"Real-time scheduling with MLFQ-RT multilevel feedback queue with starvation mitigation","display_name":"Real-time scheduling with MLFQ-RT multilevel feedback queue with starvation mitigation","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2787375936","doi":"https://doi.org/10.1109/ice.2017.8279883","mag":"2787375936"},"language":"en","primary_location":{"id":"doi:10.1109/ice.2017.8279883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ice.2017.8279883","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":"conference-paper","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/A5111546530","display_name":"Kenneth Hoganson","orcid":null},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kenneth Hoganson","raw_affiliation_strings":["Department of Computer Science, Kennesaw State University, Kennesaw, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kennesaw State University, Kennesaw, USA","institution_ids":["https://openalex.org/I172980758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029239300","display_name":"Joseph E Brown","orcid":null},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Brown","raw_affiliation_strings":["Department of Computer Science, Kennesaw State University, Kennesaw, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kennesaw State University, Kennesaw, USA","institution_ids":["https://openalex.org/I172980758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I172980758"],"apc_list":null,"apc_paid":null,"fwci":0.1902,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43570314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":null,"first_page":"155","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9993000030517578,"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.9993000030517578,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9970999956130981,"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.747046709060669},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6803356409072876},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6307491064071655},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.6187156438827515},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5949374437332153},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5448671579360962},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5428892970085144},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5011742115020752},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.48939862847328186},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4846113622188568},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.467099130153656},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4504103660583496},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4459819197654724},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17556512355804443},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12148267030715942},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0733863115310669}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.747046709060669},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6803356409072876},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6307491064071655},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.6187156438827515},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5949374437332153},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5448671579360962},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5428892970085144},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5011742115020752},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.48939862847328186},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4846113622188568},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.467099130153656},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4504103660583496},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4459819197654724},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17556512355804443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12148267030715942},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0733863115310669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ice.2017.8279883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ice.2017.8279883","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1551794236","https://openalex.org/W1570793745","https://openalex.org/W1973919915","https://openalex.org/W2103509521","https://openalex.org/W2129497745","https://openalex.org/W2141653733","https://openalex.org/W2144077857","https://openalex.org/W2519875513","https://openalex.org/W2612080622","https://openalex.org/W2731530800","https://openalex.org/W4242588494","https://openalex.org/W6634241075","https://openalex.org/W6737222065","https://openalex.org/W7026659846"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2912206708","https://openalex.org/W1935185185","https://openalex.org/W2167574351","https://openalex.org/W2377321505","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2393789493","https://openalex.org/W2545511463","https://openalex.org/W3184267879"],"abstract_inverted_index":{"Process":[0],"scheduling":[1,33,38,82,141],"for":[2,22,80],"real-time":[3,10,24,69,81,91,139],"processes":[4,51,108,125],"is":[5,119],"a":[6,37,75,97,103],"critical":[7],"function":[8],"of":[9,28,48,78,100,107],"operating":[11,117],"systems,":[12],"which":[13],"are":[14],"required":[15],"to":[16,44,62,105,121],"guarantee":[17,122],"soft":[18,68,138],"and":[19,67,137],"hard":[20,66,136],"deadlines":[21],"completing":[23],"processes.":[25],"The":[26,89],"behavior":[27],"Multi-Level":[29],"Feedback":[30],"Queue":[31],"(MLFQ)":[32],"mechanisms":[34],"intrinsically":[35],"support":[36,63,135],"that":[39,115,123,132],"favors":[40],"short":[41],"CPU":[42],"bursts":[43],"the":[45,53,110,116],"complete":[46],"exclusion":[47],"all":[49,124],"other":[50],"in":[52,109,146],"ready":[54],"queues.":[55,149],"This":[56,72],"MLFQ":[57,79,101],"feature":[58],"can":[59,134],"be":[60],"extended":[61],"meeting":[64],"both":[65],"process":[70,140],"deadlines.":[71],"research":[73,95,130],"proposes":[74],"new":[76],"derivative":[77],"call":[83],"MLFQ-Real-Time":[84],"(MLFQ-RT)":[85],"investigated":[86],"through":[87],"simulation.":[88],"MLFQ-RT":[90,133],"extension":[92],"builds":[93],"upon":[94],"solving":[96],"known":[98],"weakness":[99],"scheduling:":[102],"vulnerability":[104],"starvation":[106,145],"lowest":[111],"priority":[112,148],"queue,":[113],"so":[114],"system":[118],"unable":[120],"will":[126],"make":[127],"progress.":[128],"Simulation":[129],"demonstrates":[131],"while":[142],"simultaneously":[143],"mitigating":[144],"low":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}