{"id":"https://openalex.org/W1973287926","doi":"https://doi.org/10.4018/japuc.2012040106","title":"New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm","display_name":"New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm","publication_year":2012,"publication_date":"2012-04-01","ids":{"openalex":"https://openalex.org/W1973287926","doi":"https://doi.org/10.4018/japuc.2012040106","mag":"1973287926"},"language":"en","primary_location":{"id":"doi:10.4018/japuc.2012040106","is_oa":false,"landing_page_url":"https://doi.org/10.4018/japuc.2012040106","pdf_url":null,"source":{"id":"https://openalex.org/S16161090","display_name":"International Journal of Advanced Pervasive and Ubiquitous Computing","issn_l":"1937-965X","issn":["1937-965X","1937-9668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Advanced Pervasive and Ubiquitous Computing","raw_type":"journal-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/A5008571876","display_name":"Hamza Gharsellaoui","orcid":"https://orcid.org/0000-0002-6171-2621"},"institutions":[{"id":"https://openalex.org/I179097149","display_name":"University of Carthage","ror":"https://ror.org/057x6za15","country_code":"TN","type":"education","lineage":["https://openalex.org/I179097149"]},{"id":"https://openalex.org/I42731748","display_name":"National Institute of Applied Science and Technology","ror":"https://ror.org/00qn2rd91","country_code":"TN","type":"facility","lineage":["https://openalex.org/I42731748"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Hamza Gharsellaoui","raw_affiliation_strings":["INSAT Institute & University of Carthage, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INSAT Institute & University of Carthage, Tunisia","institution_ids":["https://openalex.org/I179097149","https://openalex.org/I42731748"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107974094","display_name":"Mohamed Khalgui","orcid":"https://orcid.org/0000-0002-8193-933X"},"institutions":[{"id":"https://openalex.org/I42731748","display_name":"National Institute of Applied Science and Technology","ror":"https://ror.org/00qn2rd91","country_code":"TN","type":"facility","lineage":["https://openalex.org/I42731748"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Mohamed Khalgui","raw_affiliation_strings":["INSAT Institute, Tunisia, ITIA Institute - CNR Research Council, Italy, & Xidjian University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INSAT Institute, Tunisia, ITIA Institute - CNR Research Council, Italy, & Xidjian University, China","institution_ids":["https://openalex.org/I42731748"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000771912","display_name":"Samir Ben Ahmed","orcid":"https://orcid.org/0000-0002-4642-2108"},"institutions":[{"id":"https://openalex.org/I42731748","display_name":"National Institute of Applied Science and Technology","ror":"https://ror.org/00qn2rd91","country_code":"TN","type":"facility","lineage":["https://openalex.org/I42731748"]},{"id":"https://openalex.org/I63596082","display_name":"Tunis El Manar University","ror":"https://ror.org/029cgt552","country_code":"TN","type":"education","lineage":["https://openalex.org/I63596082"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Samir Ben Ahmed","raw_affiliation_strings":["INSAT Institute & University of Tunis El Manar, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INSAT Institute & University of Tunis El Manar, Tunisia","institution_ids":["https://openalex.org/I42731748","https://openalex.org/I63596082"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4502,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67228464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":"2","first_page":"65","last_page":"81"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9926999807357788,"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.9860000014305115,"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.8268434405326843},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.8133704662322998},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6176867485046387},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.6119204163551331},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5056314468383789},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5042153596878052},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.5009379386901855},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4591275155544281},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4287388026714325},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4234806299209595},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.41394394636154175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3691955804824829},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3387463092803955},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3057892620563507},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18587589263916016},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.10440981388092041},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08615812659263611},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08545711636543274},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08095741271972656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8268434405326843},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.8133704662322998},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6176867485046387},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.6119204163551331},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5056314468383789},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5042153596878052},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.5009379386901855},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4591275155544281},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4287388026714325},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4234806299209595},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.41394394636154175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3691955804824829},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3387463092803955},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3057892620563507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18587589263916016},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.10440981388092041},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08615812659263611},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08545711636543274},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08095741271972656},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/japuc.2012040106","is_oa":false,"landing_page_url":"https://doi.org/10.4018/japuc.2012040106","pdf_url":null,"source":{"id":"https://openalex.org/S16161090","display_name":"International Journal of Advanced Pervasive and Ubiquitous Computing","issn_l":"1937-965X","issn":["1937-965X","1937-9668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Advanced Pervasive and Ubiquitous Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:japuc0:v:4:y:2012:i:2:p:65-81","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/japuc.2012040106","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","id":"https://metadata.un.org/sdg/12","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W77470031","https://openalex.org/W194244820","https://openalex.org/W1242050445","https://openalex.org/W1522196498","https://openalex.org/W1524894467","https://openalex.org/W1529688053","https://openalex.org/W1536375405","https://openalex.org/W1603317402","https://openalex.org/W1933254333","https://openalex.org/W1941732106","https://openalex.org/W2010484711","https://openalex.org/W2011479059","https://openalex.org/W2034751786","https://openalex.org/W2088899347","https://openalex.org/W2089070171","https://openalex.org/W2105628511","https://openalex.org/W2109488193","https://openalex.org/W2127473401","https://openalex.org/W2128202486","https://openalex.org/W2130181800","https://openalex.org/W2134093196","https://openalex.org/W2137620866","https://openalex.org/W2147674396","https://openalex.org/W2156496641","https://openalex.org/W2160293203","https://openalex.org/W2164555890","https://openalex.org/W2396169442","https://openalex.org/W2478141419","https://openalex.org/W3163474831","https://openalex.org/W6640802762","https://openalex.org/W6996247854"],"related_works":["https://openalex.org/W2171342002","https://openalex.org/W4381889969","https://openalex.org/W2245286458","https://openalex.org/W2172075652","https://openalex.org/W140492576","https://openalex.org/W1712986213","https://openalex.org/W2888222534","https://openalex.org/W1840932120","https://openalex.org/W2001066483","https://openalex.org/W4316659495"],"abstract_inverted_index":{"This":[0,70],"paper":[1],"examines":[2],"the":[3,7,95,100,108,122,135,139,145,156,166,183,203,206,210],"problem":[4],"of":[5,10,110,137,209],"scheduling":[6,32,76],"mixed":[8],"workload":[9],"both":[11],"sporadic":[12,52,128],"(on-line)":[13],"and":[14,47,56,62,104,160,205,216],"periodic":[15,42],"(off-line)":[16],"tasks":[17,43,129,153,175],"on":[18],"uniprocessor":[19],"in":[20,74,165,199,214],"a":[21,82,88,161],"hard":[22,173],"real-time":[23,111],"environment.":[24],"The":[25,113,180],"authors":[26,181],"introduce":[27],"an":[28,63],"optimal":[29,71,212],"earliest":[30],"deadline":[31],"algorithm":[33,67,72,213],"to":[34,48,93,98,106,130,155,177,185,192,201],"optimize":[35],"response":[36,96],"time":[37],"while":[38],"ensuring":[39],"that":[40],"all":[41],"meet":[44],"their":[45],"deadlines":[46,136],"accept":[49],"as":[50],"many":[51],"tasks.":[53],"A":[54],"necessary":[55],"sufficient":[57],"schedulability":[58],"test":[59],"is":[60,68,91],"presented,":[61],"efficient":[64],"O(n+m)":[65],"guarantee":[66],"proposed.":[69],"results":[73],"dynamic":[75],"solutions.":[77],"They":[78],"are":[79,190],"presented":[80],"by":[81,126,133,148,169],"proposed":[83],"intelligent":[84],"agent-based":[85],"architecture":[86],"where":[87,121],"software":[89],"agent":[90,114,184],"used":[92],"evaluate":[94],"time,":[97,147],"calculate":[99],"processor":[101],"utilization":[102],"factor":[103],"also":[105],"verify":[107],"satisfaction":[109],"deadlines.":[112],"dynamically":[115],"provides":[116],"technical":[117],"solutions":[118],"for":[119],"users":[120],"system":[123],"becomes":[124],"unfeasible":[125],"sending":[127],"idle":[131],"times,":[132],"modifying":[134],"tasks,":[138],"worst":[140,167],"case":[141,168],"execution":[142],"times":[143],"(WCETs),":[144],"activation":[146],"tolerating":[149],"some":[150,171],"non":[151,172],"critical":[152],"according":[154,176],"(m,":[157],"n)":[158],"firm":[159],"reasonable":[162],"cost,":[163],"or":[164],"removing":[170],"(soft)":[174],"predefined":[178],"heuristic.":[179],"implement":[182],"support":[186],"these":[187],"services":[188],"which":[189],"applied":[191],"extensive":[193],"experiments":[194],"with":[195],"real-life":[196],"design":[197],"examples":[198],"order":[200],"demonstrate":[202],"effectiveness":[204],"excellent":[207],"performance":[208],"new":[211],"normal":[215],"overload":[217],"conditions.":[218]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}