{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:54:51Z","timestamp":1754157291045,"version":"3.41.2"},"reference-count":27,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T00:00:00Z","timestamp":1275955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6,8]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>In client\/server distributed systems, the server is often the bottleneck. Improving the server performance is thus crucial for improving the overall performance of distributed information systems. Real\u2010time system is required to complete its work and deliver its services on a timely basis. The purpose of this paper is to propose a new scheduling algorithm for real\u2010time distributed system (client\/server model) to achieve the above\u2010mentioned goal.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The ant colony optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. They provide inherent parallelism and robustness. Therefore, they are appropriate for scheduling of tasks in soft real\u2010time systems. During simulation, results are obtained with periodic tasks, measured in terms of success ratio and effective CPU utilization; and compared with results of earliest deadline first (EDF) algorithm in the same environment.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Analysis and experiments show that the proposed algorithm is equally efficient during underloaded conditions. The performance of EDF decreases as the load increases, but the proposed algorithm works well in overloaded conditions also. Because of this type of property, the proposed algorithm is more suitable for the situation when future workload of the system is unpredictable.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The application of ACO algorithms for scheduling of client\/server real\u2010time distributed system, never found before in the literature. The new concept proposed in this paper will be of great significance to both theoretical and practical research in scheduling of distributed systems in the years to come.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17563781011049205","type":"journal-article","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T07:05:22Z","timestamp":1276326322000},"page":"279-292","source":"Crossref","is-referenced-by-count":11,"title":["Dynamic scheduling for real\u2010time distributed systems using ant colony optimization"],"prefix":"10.1108","volume":"3","author":[{"given":"Apurva","family":"Shah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ketan","family":"Kotecha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dipti","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022021919440819300_b1","doi-asserted-by":"crossref","unstructured":"Baruah, S.K. and Goossens, J. (2003), \u201cRate\u2010monotonic scheduling on uniform multiprocessors\u201d, IEEE Trans. on Computers, Vol. 52 No. 7, pp. 966\u201070.","DOI":"10.1109\/TC.2003.1214344"},{"key":"key2022021919440819300_b2","doi-asserted-by":"crossref","unstructured":"Buttazzo, G., Spuri, M. and Sensini, F. (1995), \u201cValue vs. deadline scheduling in overload conditions\u201d, Proceedings of the 16th Real Time System Symposium, Pisa, Italy, pp. 90\u20109.","DOI":"10.1109\/REAL.1995.495199"},{"key":"key2022021919440819300_b3","doi-asserted-by":"crossref","unstructured":"Chang, P.C., Wu, I.W., Shann, J.\u2010J. and Chung, C.P. (2008), \u201cETAHM: an energy\u2010aware task allocation algorithm for heterogeneous multiprocessor\u201d, Proceedings of the 45th Design Automation Conference (DAC 2008), Anaheim, CA, USA, pp. 776\u20109.","DOI":"10.1145\/1391469.1391667"},{"key":"key2022021919440819300_b4","unstructured":"Chenyang, L., Stankovic, J.A., Gang, T. and Sang, H.S. (1999), \u201cDesign and evaluation of a feedback control EDF scheduling algorithm\u201d, Proceedings of the 20th IEEE Real\u2010Time Systems Symposium, Phoenix, AZ, USA, pp. 56\u201067."},{"key":"key2022021919440819300_b5","unstructured":"Dertouzos, M. and Ogata, K. (1974), \u201cControl robotics: the procedural control of physical process\u201d, Proceeding of IFIP Congress, Stockholm, Sweden, August 5\u201010."},{"key":"key2022021919440819300_b8","unstructured":"Dorigo, M. and Caro, G.D. (1999), \u201cThe ant colony optimization metaheuristic\u201d, in Corne, D., Dorigo, M. and Glover, F. (Eds), New Ideas in Optimization, McGraw\u2010Hill, New York, NY."},{"key":"key2022021919440819300_b7","doi-asserted-by":"crossref","unstructured":"Dorigo, M. and Gambardella, L.M. (1997), \u201cAnt colony system: a cooperative learning approach to the traveling salesman problem\u201d, IEEE Transaction on Evolutionary Computation, Vol. 1 No. 1, pp. 53\u201066.","DOI":"10.1109\/4235.585892"},{"key":"key2022021919440819300_b6","doi-asserted-by":"crossref","unstructured":"Dorigo, M. and Maniezzo, C.A. (1996), \u201cThe ant system: optimization by a colony of cooperating agents\u201d, IEEE Transactions on SMC \u2013 B, Vol. 26, pp. 29\u201041.","DOI":"10.1109\/3477.484436"},{"key":"key2022021919440819300_b9","doi-asserted-by":"crossref","unstructured":"Dorigo, M. and Stutzle, T. (2004), Ant Colony Optimization, The MIT Press, Cambridge, MA.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"key2022021919440819300_b10","unstructured":"Funk, S., Goossens, J. and Baruah, S. (2001), \u201cOnline scheduling on uniform multiprocessors\u201d, Proceedings of the 22nd IEEE Real\u2010Time Systems Symposium (RTSS 2001), London, UK, December 2\u20106, pp. 183\u201092."},{"key":"key2022021919440819300_b11","doi-asserted-by":"crossref","unstructured":"Koren, G. and Shasha, D. (1995), \u201cDover: an optimal on\u2010line scheduling algorithm for overloaded real\u2010time systems\u201d, SIAM J. of Computing, Vol. 24 No. 2, pp. 318\u201039.","DOI":"10.1137\/S0097539792236882"},{"key":"key2022021919440819300_b12","unstructured":"Kotecha, K. and Shah, A. (2008a), \u201cAnt colony optimization based dynamic scheduling algorithm for real\u2010time operating system\u201d, Proceedings of International Conference on Artificial. Intelligence and Pattern Recognition (AIPR08), Orlando, FL, USA, pp. 70\u20104."},{"key":"key2022021919440819300_b13","unstructured":"Kotecha, K. and Shah, A. (2008b), \u201cEfficient dynamic scheduling algorithms for real\u2010time multiprocessor system\u201d, Proceedings of the High Performance Computing, Networking and Communication Systems (HPCNCS 08) International Conference, Orlando, FL, USA, pp. 21\u20105."},{"key":"key2022021919440819300_b14","doi-asserted-by":"crossref","unstructured":"Liu, C.L. and Layland, J.W. (1973), \u201cScheduling algorithms for multiprogramming in a hard real\u2010time environment\u201d, Journal of the ACM, Vol. 20 No. 1, pp. 46\u201061.","DOI":"10.1145\/321738.321743"},{"key":"key2022021919440819300_b15","unstructured":"Liu, J.W.S. (2001), Real\u2010time Systems, Pearson Education, New Delhi."},{"key":"key2022021919440819300_b16","unstructured":"Locke, C.D. (1986), \u201cBest effort decision making for real\u2010time scheduling\u201d, PhD thesis, Computer Science Department, Carnegie\u2010Mellon University, Pittsburgh, PA."},{"key":"key2022021919440819300_b17","unstructured":"Mok, A. (1983), \u201cFundamental design problems of distributed systems for the hard\u2010real time environment\u201d, PhD thesis, The MIT Press, Cambridge, MA."},{"key":"key2022021919440819300_b18","doi-asserted-by":"crossref","unstructured":"Oh, Y. and Son, S.H. (1995), \u201cAllocating fixed\u2010priority periodic tasks on multiprocessor systems\u201d, J. of Real\u2010Time Systems, Vol. 9 No. 3, pp. 207\u201039.","DOI":"10.1007\/BF01088806"},{"key":"key2022021919440819300_b19","unstructured":"Paoli, D.D., Goscinski, A., Hobbs, M. and Joyce, P. (1996), \u201cPerformance comparison of process migration with remote process creation mechanism in RHODOS\u201d, Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS), Hong Kong, pp. 554\u201061."},{"key":"key2022021919440819300_b20","doi-asserted-by":"crossref","unstructured":"Ramamritham, K., Stankovic, J.A. and Shiah, P.F. (1990), \u201cEfficient scheduling algorithms for real\u2010time multiprocessor systems\u201d, IEEE Transaction on Parallel Distributed Systems, Vol. 1 No. 2, pp. 184\u201094.","DOI":"10.1109\/71.80146"},{"key":"key2022021919440819300_b21","unstructured":"Ramos, V., Muge, F. and Pina, P. (2002), \u201cSelf\u2010organized data and image retrieval as a consequence of inter\u2010dynamic synergistic relationships in artificial ant colonies\u201d, Second International Conference on Hybrid Intelligent Systems (HIS'02), Santiago, Chile, December 1\u20104, pp. 500\u201012."},{"key":"key2022021919440819300_b22","doi-asserted-by":"crossref","unstructured":"Saad, E.M., Adawy, M.E. and Habashy, S.M. (2006), \u201cReconfigurable parallel processing system based on a modified ant colony system\u201d, Proceedings of the National Radio Science Conference (NRSC 2006), Menofia, Egypt, March.","DOI":"10.1109\/NRSC.2006.386362"},{"key":"key2022021919440819300_b23","doi-asserted-by":"crossref","unstructured":"Saini, G. (2005), \u201cApplication of fuzzy\u2010logic to real\u2010time scheduling\u201d, 14th IEEE\u2010NPSS Real\u2010Time Conference, AlbaNova University Centre, Stockholm, pp. 60\u20103.","DOI":"10.1109\/RTC.2005.1547449"},{"key":"key2022021919440819300_b24","unstructured":"Stutzle, T. (1998), \u201cAn ant approach for the flow shop problem\u201d, Proceedings of European Congress on Intelligent Techniques and Soft Computing (EUFIT'98), Aachen, Germany, September 7\u201010, pp. 1560\u20104."},{"key":"key2022021919440819300_b25","unstructured":"Thai, N.D. (2002), \u201cReal\u2010time scheduling in distributed systems\u201d, Proceedings of the International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), Warsaw, Poland, pp. 165\u201070."},{"key":"key2022021919440819300_b26","doi-asserted-by":"crossref","unstructured":"Turneo, A., Pilato, C., Frrandi, F., Sciuto, D. and Lanzi, P.L. (2008), \u201cAnt colony optimization for mapping and scheduling in heterogeneous multiprocessor systems\u201d, Proceedings of IEEE International Conference on SAMOS VIII: Embedded Computer Systems: Architectures, Modeling, and Simulation, Samos, Greece, July 21\u201024, pp. 142\u20109.","DOI":"10.1109\/ICSAMOS.2008.4664857"},{"key":"key2022021919440819300_b27","unstructured":"Yongcheng, L. and Roy, C. (1995), \u201cA dynamic priority based scheduling method in distributed systems\u201d, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Urbana, IL, USA, August 14\u201018, pp. 177\u201086."}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17563781011049205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563781011049205\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563781011049205\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:44:20Z","timestamp":1753400660000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/3\/2\/279-292\/132947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,8]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6,8]]}},"alternative-id":["10.1108\/17563781011049205"],"URL":"https:\/\/doi.org\/10.1108\/17563781011049205","relation":{},"ISSN":["1756-378X"],"issn-type":[{"type":"print","value":"1756-378X"}],"subject":[],"published":{"date-parts":[[2010,6,8]]}}}