{"id":"https://openalex.org/W2051530058","doi":"https://doi.org/10.1108/17563781011049205","title":"Dynamic scheduling for real\u2010time distributed systems using ant colony optimization","display_name":"Dynamic scheduling for real\u2010time distributed systems using ant colony optimization","publication_year":2010,"publication_date":"2010-06-08","ids":{"openalex":"https://openalex.org/W2051530058","doi":"https://doi.org/10.1108/17563781011049205","mag":"2051530058"},"language":"en","primary_location":{"id":"doi:10.1108/17563781011049205","is_oa":false,"landing_page_url":"https://doi.org/10.1108/17563781011049205","pdf_url":null,"source":{"id":"https://openalex.org/S124503262","display_name":"International Journal of Intelligent Computing and Cybernetics","issn_l":"1756-378X","issn":["1756-378X","1756-3798"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Computing and Cybernetics","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/A5070736785","display_name":"Apurva Shah","orcid":"https://orcid.org/0000-0002-0264-9810"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Apurva Shah","raw_affiliation_strings":["Department of Information Technology, G.H. Patel College of Engineering and Technology, Vallabh Vidyanagar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technology, G.H. Patel College of Engineering and Technology, Vallabh Vidyanagar, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077770842","display_name":"Ketan Kotecha","orcid":"https://orcid.org/0000-0003-2653-3780"},"institutions":[{"id":"https://openalex.org/I165831266","display_name":"Nirma University","ror":"https://ror.org/05qkq7x38","country_code":"IN","type":"education","lineage":["https://openalex.org/I165831266"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ketan Kotecha","raw_affiliation_strings":["Institute of Technology, Nirma University, Ahmedabad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Technology, Nirma University, Ahmedabad, India","institution_ids":["https://openalex.org/I165831266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078993984","display_name":"Dipti Shah","orcid":"https://orcid.org/0000-0002-5140-7439"},"institutions":[{"id":"https://openalex.org/I57085157","display_name":"Sardar Patel University","ror":"https://ror.org/05kfstc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I57085157"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dipti Shah","raw_affiliation_strings":["G.H. Patel Post Graduate Department of Computer Science and Technology, Sardar Patel University, Vallabh Vidyanagar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"G.H. Patel Post Graduate Department of Computer Science and Technology, Sardar Patel University, Vallabh Vidyanagar, India","institution_ids":["https://openalex.org/I57085157"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8279,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8595038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"3","issue":"2","first_page":"279","last_page":"292"},"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.9994000196456909,"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.9994000196456909,"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.9965999722480774,"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"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9965999722480774,"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.9019526839256287},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.693468451499939},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5532641410827637},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5526007413864136},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5400131344795227},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5144789218902588},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.4988980293273926},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4632028341293335},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.42985352873802185},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4290952682495117},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3661292791366577},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.355332612991333},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.24698910117149353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20495566725730896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15817853808403015},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14054900407791138},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.13751864433288574},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11620399355888367}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9019526839256287},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.693468451499939},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5532641410827637},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5526007413864136},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5400131344795227},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5144789218902588},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.4988980293273926},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4632028341293335},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.42985352873802185},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4290952682495117},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3661292791366577},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.355332612991333},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.24698910117149353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20495566725730896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15817853808403015},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14054900407791138},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.13751864433288574},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11620399355888367},{"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.1108/17563781011049205","is_oa":false,"landing_page_url":"https://doi.org/10.1108/17563781011049205","pdf_url":null,"source":{"id":"https://openalex.org/S124503262","display_name":"International Journal of Intelligent Computing and Cybernetics","issn_l":"1756-378X","issn":["1756-378X","1756-3798"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319811","host_organization_name":"Emerald Publishing Limited","host_organization_lineage":["https://openalex.org/P4310319811"],"host_organization_lineage_names":["Emerald Publishing Limited"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Intelligent Computing and Cybernetics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W111084898","https://openalex.org/W170343167","https://openalex.org/W173125891","https://openalex.org/W194244820","https://openalex.org/W242269721","https://openalex.org/W1485093219","https://openalex.org/W1573676079","https://openalex.org/W1587263632","https://openalex.org/W1866873457","https://openalex.org/W1879402272","https://openalex.org/W1950558550","https://openalex.org/W2076364559","https://openalex.org/W2076734057","https://openalex.org/W2093268638","https://openalex.org/W2100725016","https://openalex.org/W2105628511","https://openalex.org/W2107941094","https://openalex.org/W2109488193","https://openalex.org/W2118333478","https://openalex.org/W2134202349","https://openalex.org/W2154078469","https://openalex.org/W2154929945","https://openalex.org/W2155484663","https://openalex.org/W2160104654","https://openalex.org/W2160918806","https://openalex.org/W2164316369","https://openalex.org/W4299796063","https://openalex.org/W6634837130","https://openalex.org/W6635178849","https://openalex.org/W6675709371","https://openalex.org/W6682972913"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2393789493","https://openalex.org/W2367142822","https://openalex.org/W2167574351","https://openalex.org/W2383668729","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2397293317","https://openalex.org/W2060984508"],"abstract_inverted_index":{"Purpose":[0],"In":[1],"client/server":[2,200],"distributed":[3,24,57,202,231],"systems,":[4],"the":[5,9,12,20,63,78,131,140,155,159,174,181,187,208,234],"server":[6,13],"is":[7,15,29,48,143,177,189],"often":[8],"bottleneck.":[10],"Improving":[11],"performance":[14,22,150],"thus":[16],"crucial":[17],"for":[18,55,94,180,197],"improving":[19],"overall":[21],"of":[23,45,82,96,113,124,151,169,172,186,194,199,219,230],"information":[25],"systems.":[26,101],"Real\u2010time":[27],"system":[28,58,188],"required":[30],"to":[31,49,61,222,236],"complete":[32],"its":[33,37],"work":[34],"and":[35,88,116,120,136,225],"deliver":[36],"services":[38],"on":[39],"a":[40,51],"timely":[41],"basis.":[42],"The":[43,67,149,192,210],"purpose":[44],"this":[46,170,215],"paper":[47,216],"propose":[50],"new":[52,211],"scheduling":[53,95,198,229],"algorithm":[54,129,142,161,176],"real\u2010time":[56,100,201],"(client/server":[59],"model)":[60],"achieve":[62],"above\u2010mentioned":[64],"goal.":[65],"Design/methodology/approach":[66],"ant":[68],"colony":[69],"optimization":[70],"(ACO)":[71],"algorithms":[72,196],"are":[73,92,105],"computational":[74],"models":[75],"inspired":[76],"by":[77],"collective":[79],"foraging":[80],"behavior":[81],"ants.":[83],"They":[84],"provide":[85],"inherent":[86],"parallelism":[87],"robustness.":[89],"Therefore,":[90],"they":[91],"appropriate":[93],"tasks":[97],"in":[98,111,130,164,207,214,228,233],"soft":[99],"During":[102],"simulation,":[103],"results":[104,123],"obtained":[106],"with":[107,122],"periodic":[108],"tasks,":[109],"measured":[110],"terms":[112],"success":[114],"ratio":[115],"effective":[117],"CPU":[118],"utilization;":[119],"compared":[121],"earliest":[125],"deadline":[126],"first":[127],"(EDF)":[128],"same":[132],"environment.":[133],"Findings":[134],"Analysis":[135],"experiments":[137],"show":[138],"that":[139],"proposed":[141,160,175,213],"equally":[144],"efficient":[145],"during":[146],"underloaded":[147],"conditions.":[148],"EDF":[152],"decreases":[153],"as":[154],"load":[156],"increases,":[157],"but":[158],"works":[162],"well":[163],"overloaded":[165],"conditions":[166],"also.":[167],"Because":[168],"type":[171],"property,":[173],"more":[178],"suitable":[179],"situation":[182],"when":[183],"future":[184],"workload":[185],"unpredictable.":[190],"Originality/value":[191],"application":[193],"ACO":[195],"system,":[203],"never":[204],"found":[205],"before":[206],"literature.":[209],"concept":[212],"will":[217],"be":[218],"great":[220],"significance":[221],"both":[223],"theoretical":[224],"practical":[226],"research":[227],"systems":[232],"years":[235],"come.":[237]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
