{"id":"https://openalex.org/W2903197112","doi":"https://doi.org/10.1109/icacci.2018.8554483","title":"Comparative Study of LST and SJF Scheduling Algorithm in Soft Real-Time System with its Implementation and Analysis","display_name":"Comparative Study of LST and SJF Scheduling Algorithm in Soft Real-Time System with its Implementation and Analysis","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2903197112","doi":"https://doi.org/10.1109/icacci.2018.8554483","mag":"2903197112"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2018.8554483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2018.8554483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","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/A5077981815","display_name":"Jay Teraiya","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094966","display_name":"Marwadi Education Foundation","ror":"https://ror.org/00my7df95","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210094966"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Jay Teraiya","raw_affiliation_strings":["Information and Technology Department, Marwadi Education Foundation, Rajkot"],"affiliations":[{"raw_affiliation_string":"Information and Technology Department, Marwadi Education Foundation, Rajkot","institution_ids":["https://openalex.org/I4210094966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070736785","display_name":"Apurva Shah","orcid":"https://orcid.org/0000-0002-0264-9810"},"institutions":[{"id":"https://openalex.org/I110116418","display_name":"Maharaja Sayajirao University of Baroda","ror":"https://ror.org/01bx8ja67","country_code":"IN","type":"education","lineage":["https://openalex.org/I110116418"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Apurva Shah","raw_affiliation_strings":["Computer Science and Engineerig Department, The Maharaja Sayajirao University of Baroda"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineerig Department, The Maharaja Sayajirao University of Baroda","institution_ids":["https://openalex.org/I110116418"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077981815"],"corresponding_institution_ids":["https://openalex.org/I4210094966"],"apc_list":null,"apc_paid":null,"fwci":1.2623,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79479345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":null,"first_page":"706","last_page":"711"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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.9997000098228455,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9837999939918518,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9828000068664551,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7623584270477295},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6664071083068848},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.5253350734710693},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5090155601501465},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4688471555709839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45138978958129883},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4452612102031708},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4395603537559509},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4225083589553833},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4123205542564392},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.37058478593826294},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3609187602996826},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.19484612345695496},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11182725429534912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1074884831905365}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7623584270477295},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6664071083068848},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.5253350734710693},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5090155601501465},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4688471555709839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45138978958129883},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4452612102031708},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4395603537559509},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4225083589553833},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4123205542564392},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.37058478593826294},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3609187602996826},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.19484612345695496},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11182725429534912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1074884831905365}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icacci.2018.8554483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2018.8554483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1879402272","https://openalex.org/W1941732106","https://openalex.org/W2050732033","https://openalex.org/W2093268638","https://openalex.org/W2105628511","https://openalex.org/W2107447564","https://openalex.org/W2111206806","https://openalex.org/W2120047461","https://openalex.org/W2152762422","https://openalex.org/W2154684758","https://openalex.org/W2491792590","https://openalex.org/W2679945668","https://openalex.org/W4247100792"],"related_works":["https://openalex.org/W2393789493","https://openalex.org/W2374555443","https://openalex.org/W2367142822","https://openalex.org/W2184166483","https://openalex.org/W2060984508","https://openalex.org/W2352790745","https://openalex.org/W2383668729","https://openalex.org/W2245286458","https://openalex.org/W2167574351","https://openalex.org/W4300092030"],"abstract_inverted_index":{"The":[0,31,59],"Least":[1,16],"Slack":[2],"Time":[3],"First":[4,62],"(LST)":[5],"algorithm":[6,11,48,64,69,152,163],"is":[7,44,65,101,158],"a":[8,66,83,202],"dynamic":[9,22],"scheduling":[10,50,68,106],"and":[12,70,118,135,148,211],"also":[13],"known":[14],"as":[15,93],"Laxity":[17],"First.":[18],"It":[19,43,100,157,231],"decides":[20,71],"the":[21,25,40,45,72,75,94,116,121,151,154,161,240],"priority":[23,73,96],"of":[24,51,74,242],"task":[26,32,76,97,133,182,209,213],"based":[27,77],"on":[28,78,131,201,235],"slack":[29,35],"time;":[30],"having":[33],"minimum":[34,89],"time":[36,80,91],"will":[37],"be":[38],"considered":[39,92],"highest":[41,95],"priority.":[42],"most":[46],"suitable":[47],"for":[49,82,105,120,222],"tasks":[52],"in":[53,98,153,166,172,184,192],"soft":[54,122],"Real-Time":[55,108],"Operating":[56],"System":[57],"(RTOS).":[58],"Shortest":[60],"Job":[61],"(SJF)":[63],"static":[67],"execution":[79,90],"required":[81],"given":[84],"task.":[85],"Task":[86],"which":[87],"has":[88,232],"SJF.":[99],"not":[102,170,177],"directly":[103],"used":[104],"Soft":[107],"system.":[109,125],"In":[110],"this":[111],"paper,":[112],"we":[113],"have":[114,128,140,198],"implemented":[115],"LST":[117,162],"SJF":[119,176],"real-time":[123],"operating":[124],"These":[126],"algorithms":[127],"been":[129,199,233],"executed":[130],"periodic":[132],"set,":[134,210],"observations":[136],"are":[137],"gathered.":[138],"We":[139],"observed":[141],"Success":[142],"Ratio":[143],"&":[144],"Effective":[145],"CPU":[146,220],"Utilization":[147],"compared":[149],"both":[150,243],"same":[155],"conditions.":[156],"noted":[159],"that":[160],"performs":[164,190],"well":[165,171,191],"underload":[167,185],"scenario":[168],"but":[169,187],"an":[173,193],"overload":[174,194],"situation.":[175,195],"able":[178],"to":[179,217,229,238],"schedule":[180],"specific":[181],"even":[183],"situation":[186],"it":[188],"comparatively":[189],"Practical":[196],"experiments":[197],"conducted":[200],"large":[203],"dataset.":[204],"Data":[205],"Set":[206],"contains":[207],"7500":[208],"each":[212,223],"set":[214,225],"includes":[215],"1":[216],"9":[218],"processes.":[219],"load":[221],"process":[224],"varies":[226],"from":[227],"0.5":[228],"5.":[230],"tested":[234],"500-time":[236],"unit":[237],"validate":[239],"correctness":[241],"algorithms.":[244]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}