Loading…
Non-preemptive chaotic cat swarm optimization scheme for task scheduling on cloud computing environment
With exponential growth in the number of customers accessing the cloud services, scheduling tasks at cloud datacenter poses the greatest challenge in meeting end-user's quality of service (QoS) expectations in terms of time and cost. Recent research makes use of metaheuristic task scheduling te...
Saved in:
Published in: | International journal of advanced computer research 2019-07, Vol.9 (43), p.186-196 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 196 |
container_issue | 43 |
container_start_page | 186 |
container_title | International journal of advanced computer research |
container_volume | 9 |
creator | Gabi, Danlami Dankolo, Nasiru Muhammad Ismail, Abdul Samad Zainal, Anazida Zakaria, Zalmiyah |
description | With exponential growth in the number of customers accessing the cloud services, scheduling tasks at cloud datacenter poses the greatest challenge in meeting end-user's quality of service (QoS) expectations in terms of time and cost. Recent research makes use of metaheuristic task scheduling techniques in addressing this concern. However, metaheuristic techniques are attributed with certain limitation such as premature convergence, global and local imbalance which causes insufficient task allocation across cloud virtual machines. Thus, resulting in inefficient QoS expectation. To address these concerns while meeting end-users QoS expectation, this paper puts forward a non-preemptive chaotic cat swarm optimization (NCCSO) scheme as an ideal solution. In the developed scheme, chaotic process is introduced to reduce entrapment at local optima and overcome premature convergence and Pareto dominant strategy is used to address optimality problem. The developed scheme is implemented in the CloudSim simulator tool and simulation results show the developed NCCSO scheme compared to the benchmarked schemes adopted in this paper can achieve 42.87%, 35.47% and 25.49% reduction in term of execution time, and also 38.62%, 35.32%, 25.56% in term of execution cost. Finally, we also unveiled that a statistical significance on 95% confidential interval has shown that our developed NCCSO scheme can provide a remarkable performance that can meet end-user QoS expectations. |
doi_str_mv | 10.19101/IJACR.PID29 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2276741033</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2276741033</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1039-9ec46876637b1295beae8a4ac7fc9b9e1b18dfea169bb49711314159e65ff8f53</originalsourceid><addsrcrecordid>eNotkMFOwzAQRC0EElXpjQ-wxJUUO3Hi-FgVKEUVIATnyHHXraGOg-0UwdeTppx2d2a0Iz2ELimZUkEJvVk-zuav05flbSpO0ChNOU-44OT0sDOR8F44R5MQTE0Y44ykJRmhzZNrktYD2DaaPWC1lS4ahZWMOHxLb7HrDWt-ZTSuwUFtwQLWzuMow-dwr7udaTa4d9XOdWusnG27eJCg2RvvGgtNvEBnWu4CTP7nGL3f373NH5LV82I5n60SRUkmEgGKFSUviozXNBV5DRJKyaTiWolaAK1pudYgaSHqmglOaUYZzQUUudalzrMxujr-bb376iDE6sN1vukrq55IwVlfk_Wp62NKeReCB1213ljpfypKqoFmNdCsBprZHyaUacI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2276741033</pqid></control><display><type>article</type><title>Non-preemptive chaotic cat swarm optimization scheme for task scheduling on cloud computing environment</title><source>Publicly Available Content (ProQuest)</source><creator>Gabi, Danlami ; Dankolo, Nasiru Muhammad ; Ismail, Abdul Samad ; Zainal, Anazida ; Zakaria, Zalmiyah</creator><creatorcontrib>Gabi, Danlami ; Dankolo, Nasiru Muhammad ; Ismail, Abdul Samad ; Zainal, Anazida ; Zakaria, Zalmiyah</creatorcontrib><description>With exponential growth in the number of customers accessing the cloud services, scheduling tasks at cloud datacenter poses the greatest challenge in meeting end-user's quality of service (QoS) expectations in terms of time and cost. Recent research makes use of metaheuristic task scheduling techniques in addressing this concern. However, metaheuristic techniques are attributed with certain limitation such as premature convergence, global and local imbalance which causes insufficient task allocation across cloud virtual machines. Thus, resulting in inefficient QoS expectation. To address these concerns while meeting end-users QoS expectation, this paper puts forward a non-preemptive chaotic cat swarm optimization (NCCSO) scheme as an ideal solution. In the developed scheme, chaotic process is introduced to reduce entrapment at local optima and overcome premature convergence and Pareto dominant strategy is used to address optimality problem. The developed scheme is implemented in the CloudSim simulator tool and simulation results show the developed NCCSO scheme compared to the benchmarked schemes adopted in this paper can achieve 42.87%, 35.47% and 25.49% reduction in term of execution time, and also 38.62%, 35.32%, 25.56% in term of execution cost. Finally, we also unveiled that a statistical significance on 95% confidential interval has shown that our developed NCCSO scheme can provide a remarkable performance that can meet end-user QoS expectations.</description><identifier>ISSN: 2249-7277</identifier><identifier>EISSN: 2277-7970</identifier><identifier>DOI: 10.19101/IJACR.PID29</identifier><language>eng</language><publisher>Bhopal: Accent Social and Welfare Society</publisher><subject>Cloud computing ; Computer simulation ; Convergence ; Customer services ; Entrapment ; Genetic algorithms ; Heuristic ; Heuristic methods ; International conferences ; Optimization ; Preempting ; Production scheduling ; Quality of service ; Researchers ; Software services ; Task scheduling ; Virtual environments</subject><ispartof>International journal of advanced computer research, 2019-07, Vol.9 (43), p.186-196</ispartof><rights>2019. This work is published under NOCC (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2276741033/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2276741033?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25751,27922,27923,37010,44588,74896</link.rule.ids></links><search><creatorcontrib>Gabi, Danlami</creatorcontrib><creatorcontrib>Dankolo, Nasiru Muhammad</creatorcontrib><creatorcontrib>Ismail, Abdul Samad</creatorcontrib><creatorcontrib>Zainal, Anazida</creatorcontrib><creatorcontrib>Zakaria, Zalmiyah</creatorcontrib><title>Non-preemptive chaotic cat swarm optimization scheme for task scheduling on cloud computing environment</title><title>International journal of advanced computer research</title><description>With exponential growth in the number of customers accessing the cloud services, scheduling tasks at cloud datacenter poses the greatest challenge in meeting end-user's quality of service (QoS) expectations in terms of time and cost. Recent research makes use of metaheuristic task scheduling techniques in addressing this concern. However, metaheuristic techniques are attributed with certain limitation such as premature convergence, global and local imbalance which causes insufficient task allocation across cloud virtual machines. Thus, resulting in inefficient QoS expectation. To address these concerns while meeting end-users QoS expectation, this paper puts forward a non-preemptive chaotic cat swarm optimization (NCCSO) scheme as an ideal solution. In the developed scheme, chaotic process is introduced to reduce entrapment at local optima and overcome premature convergence and Pareto dominant strategy is used to address optimality problem. The developed scheme is implemented in the CloudSim simulator tool and simulation results show the developed NCCSO scheme compared to the benchmarked schemes adopted in this paper can achieve 42.87%, 35.47% and 25.49% reduction in term of execution time, and also 38.62%, 35.32%, 25.56% in term of execution cost. Finally, we also unveiled that a statistical significance on 95% confidential interval has shown that our developed NCCSO scheme can provide a remarkable performance that can meet end-user QoS expectations.</description><subject>Cloud computing</subject><subject>Computer simulation</subject><subject>Convergence</subject><subject>Customer services</subject><subject>Entrapment</subject><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Heuristic methods</subject><subject>International conferences</subject><subject>Optimization</subject><subject>Preempting</subject><subject>Production scheduling</subject><subject>Quality of service</subject><subject>Researchers</subject><subject>Software services</subject><subject>Task scheduling</subject><subject>Virtual environments</subject><issn>2249-7277</issn><issn>2277-7970</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotkMFOwzAQRC0EElXpjQ-wxJUUO3Hi-FgVKEUVIATnyHHXraGOg-0UwdeTppx2d2a0Iz2ELimZUkEJvVk-zuav05flbSpO0ChNOU-44OT0sDOR8F44R5MQTE0Y44ykJRmhzZNrktYD2DaaPWC1lS4ahZWMOHxLb7HrDWt-ZTSuwUFtwQLWzuMow-dwr7udaTa4d9XOdWusnG27eJCg2RvvGgtNvEBnWu4CTP7nGL3f373NH5LV82I5n60SRUkmEgGKFSUviozXNBV5DRJKyaTiWolaAK1pudYgaSHqmglOaUYZzQUUudalzrMxujr-bb376iDE6sN1vukrq55IwVlfk_Wp62NKeReCB1213ljpfypKqoFmNdCsBprZHyaUacI</recordid><startdate>20190724</startdate><enddate>20190724</enddate><creator>Gabi, Danlami</creator><creator>Dankolo, Nasiru Muhammad</creator><creator>Ismail, Abdul Samad</creator><creator>Zainal, Anazida</creator><creator>Zakaria, Zalmiyah</creator><general>Accent Social and Welfare Society</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20190724</creationdate><title>Non-preemptive chaotic cat swarm optimization scheme for task scheduling on cloud computing environment</title><author>Gabi, Danlami ; Dankolo, Nasiru Muhammad ; Ismail, Abdul Samad ; Zainal, Anazida ; Zakaria, Zalmiyah</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1039-9ec46876637b1295beae8a4ac7fc9b9e1b18dfea169bb49711314159e65ff8f53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Cloud computing</topic><topic>Computer simulation</topic><topic>Convergence</topic><topic>Customer services</topic><topic>Entrapment</topic><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Heuristic methods</topic><topic>International conferences</topic><topic>Optimization</topic><topic>Preempting</topic><topic>Production scheduling</topic><topic>Quality of service</topic><topic>Researchers</topic><topic>Software services</topic><topic>Task scheduling</topic><topic>Virtual environments</topic><toplevel>online_resources</toplevel><creatorcontrib>Gabi, Danlami</creatorcontrib><creatorcontrib>Dankolo, Nasiru Muhammad</creatorcontrib><creatorcontrib>Ismail, Abdul Samad</creatorcontrib><creatorcontrib>Zainal, Anazida</creatorcontrib><creatorcontrib>Zakaria, Zalmiyah</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of advanced computer research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gabi, Danlami</au><au>Dankolo, Nasiru Muhammad</au><au>Ismail, Abdul Samad</au><au>Zainal, Anazida</au><au>Zakaria, Zalmiyah</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Non-preemptive chaotic cat swarm optimization scheme for task scheduling on cloud computing environment</atitle><jtitle>International journal of advanced computer research</jtitle><date>2019-07-24</date><risdate>2019</risdate><volume>9</volume><issue>43</issue><spage>186</spage><epage>196</epage><pages>186-196</pages><issn>2249-7277</issn><eissn>2277-7970</eissn><abstract>With exponential growth in the number of customers accessing the cloud services, scheduling tasks at cloud datacenter poses the greatest challenge in meeting end-user's quality of service (QoS) expectations in terms of time and cost. Recent research makes use of metaheuristic task scheduling techniques in addressing this concern. However, metaheuristic techniques are attributed with certain limitation such as premature convergence, global and local imbalance which causes insufficient task allocation across cloud virtual machines. Thus, resulting in inefficient QoS expectation. To address these concerns while meeting end-users QoS expectation, this paper puts forward a non-preemptive chaotic cat swarm optimization (NCCSO) scheme as an ideal solution. In the developed scheme, chaotic process is introduced to reduce entrapment at local optima and overcome premature convergence and Pareto dominant strategy is used to address optimality problem. The developed scheme is implemented in the CloudSim simulator tool and simulation results show the developed NCCSO scheme compared to the benchmarked schemes adopted in this paper can achieve 42.87%, 35.47% and 25.49% reduction in term of execution time, and also 38.62%, 35.32%, 25.56% in term of execution cost. Finally, we also unveiled that a statistical significance on 95% confidential interval has shown that our developed NCCSO scheme can provide a remarkable performance that can meet end-user QoS expectations.</abstract><cop>Bhopal</cop><pub>Accent Social and Welfare Society</pub><doi>10.19101/IJACR.PID29</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2249-7277 |
ispartof | International journal of advanced computer research, 2019-07, Vol.9 (43), p.186-196 |
issn | 2249-7277 2277-7970 |
language | eng |
recordid | cdi_proquest_journals_2276741033 |
source | Publicly Available Content (ProQuest) |
subjects | Cloud computing Computer simulation Convergence Customer services Entrapment Genetic algorithms Heuristic Heuristic methods International conferences Optimization Preempting Production scheduling Quality of service Researchers Software services Task scheduling Virtual environments |
title | Non-preemptive chaotic cat swarm optimization scheme for task scheduling on cloud computing environment |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T18%3A55%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Non-preemptive%20chaotic%20cat%20swarm%20optimization%20scheme%20for%20task%20scheduling%20on%20cloud%20computing%20environment&rft.jtitle=International%20journal%20of%20advanced%20computer%20research&rft.au=Gabi,%20Danlami&rft.date=2019-07-24&rft.volume=9&rft.issue=43&rft.spage=186&rft.epage=196&rft.pages=186-196&rft.issn=2249-7277&rft.eissn=2277-7970&rft_id=info:doi/10.19101/IJACR.PID29&rft_dat=%3Cproquest_cross%3E2276741033%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1039-9ec46876637b1295beae8a4ac7fc9b9e1b18dfea169bb49711314159e65ff8f53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2276741033&rft_id=info:pmid/&rfr_iscdi=true |