{"id":"https://openalex.org/W2899329706","doi":"https://doi.org/10.1109/icccnt.2018.8493662","title":"A K-Factor CPU Scheduling Algorithm","display_name":"A K-Factor CPU Scheduling Algorithm","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2899329706","doi":"https://doi.org/10.1109/icccnt.2018.8493662","mag":"2899329706"},"language":"en","primary_location":{"id":"doi:10.1109/icccnt.2018.8493662","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt.2018.8493662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","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/A5101183902","display_name":"Sumedha Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I102117144","display_name":"Banasthali University","ror":"https://ror.org/05ycegt40","country_code":"IN","type":"education","lineage":["https://openalex.org/I102117144"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sumedha Garg","raw_affiliation_strings":["Department of Computer Science, Banasthali Vidyapith, Rajasthan, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Banasthali Vidyapith, Rajasthan, India","institution_ids":["https://openalex.org/I102117144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007575867","display_name":"Deepak Kumar","orcid":"https://orcid.org/0000-0002-3399-2582"},"institutions":[{"id":"https://openalex.org/I102117144","display_name":"Banasthali University","ror":"https://ror.org/05ycegt40","country_code":"IN","type":"education","lineage":["https://openalex.org/I102117144"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Deepak Kumar","raw_affiliation_strings":["Department of Computer Science, Banasthali Vidyapith, Rajasthan, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Banasthali Vidyapith, Rajasthan, India","institution_ids":["https://openalex.org/I102117144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102117144"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9940999746322632,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9940999746322632,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9797999858856201,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9570000171661377,"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.7493938207626343},{"id":"https://openalex.org/keywords/turnaround-time","display_name":"Turnaround time","score":0.656549870967865},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5273692607879639},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5095531940460205},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48374080657958984},{"id":"https://openalex.org/keywords/central-processing-unit","display_name":"Central processing unit","score":0.4766172468662262},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4642159938812256},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.42779144644737244},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20268350839614868},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10879608988761902},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09580570459365845}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7493938207626343},{"id":"https://openalex.org/C176553487","wikidata":"https://www.wikidata.org/wiki/Q7855819","display_name":"Turnaround time","level":2,"score":0.656549870967865},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5273692607879639},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5095531940460205},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48374080657958984},{"id":"https://openalex.org/C49154492","wikidata":"https://www.wikidata.org/wiki/Q5300","display_name":"Central processing unit","level":2,"score":0.4766172468662262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4642159938812256},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.42779144644737244},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20268350839614868},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10879608988761902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09580570459365845}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccnt.2018.8493662","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccnt.2018.8493662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1567538865","https://openalex.org/W1916709771","https://openalex.org/W2751601659","https://openalex.org/W3110546893"],"related_works":["https://openalex.org/W1992029172","https://openalex.org/W1978877834","https://openalex.org/W2046153241","https://openalex.org/W2098247609","https://openalex.org/W2028004384","https://openalex.org/W1497369337","https://openalex.org/W1604247006","https://openalex.org/W2134835513","https://openalex.org/W2257409849","https://openalex.org/W2033526630"],"abstract_inverted_index":{"In":[0],"a":[1,86,122],"multi-tasking":[2],"environment,":[3],"it":[4,121],"is":[5,113],"crucial":[6],"to":[7,22,30,41,79,98],"optimize":[8],"the":[9,43,76,105,117],"CPU":[10],"scheduling":[11],"process.":[12],"Several":[13],"algorithms":[14],"have":[15,72,91],"been":[16,73,92],"proposed":[17,118],"and":[18,37,55,64],"are":[19],"in":[20,75,116],"use":[21],"schedule":[23],"processes":[24,71,112],"on":[25],"CPU.":[26],"This":[27],"paper":[28],"aims":[29],"evaluate":[31],"shortest":[32],"job":[33],"first":[34],"(SJF)":[35],"algorithm":[36,40],"propose":[38],"an":[39],"overcome":[42],"shortcomings":[44],"of":[45,70],"SJF.":[46],"The":[47,57,68,101],"simulation":[48],"results":[49,102],"yield":[50],"useful":[51],"data":[52],"for":[53,110,125],"comparison":[54],"evaluation.":[56],"performance":[58],"metrics":[59],"include":[60],"average":[61,65],"turnaround":[62],"time":[63],"waiting":[66],"time.":[67],"numbers":[69],"varied":[74],"range":[77],"10":[78,97],"100000,":[80],"which":[81],"provides":[82],"actual":[83],"scenarios":[84],"inside":[85],"system.":[87],"For":[88],"evaluation,":[89],"simulations":[90],"run":[93],"many":[94],"times,":[95],"between":[96],"100":[99],"runs.":[100],"indicate":[103],"that":[104],"starvation":[106],"created":[107],"by":[108],"SJF":[109],"longer":[111],"not":[114],"present":[115],"algorithm,":[119],"making":[120],"suitable":[123],"choice":[124],"implementation.":[126]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}