An osmotic approach-based dynamic deadline-aware task offloading in edge–fog–cloud computing environment
Edge–fog–cloud computing system can be divided into edge or IoT layer (tier 1), fog layer (tier 2) and cloud layer (tier 3). The devices at the edge layer generate different types of tasks which may be computation-intensive or communication intensive or having a combination of these properties. Depe...
Gespeichert in:
Veröffentlicht in: | The Journal of supercomputing 2023-12, Vol.79 (18), p.20938-20960 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 20960 |
---|---|
container_issue | 18 |
container_start_page | 20938 |
container_title | The Journal of supercomputing |
container_volume | 79 |
creator | Reddy, Posham Bhargava Sudhakar, Chapram |
description | Edge–fog–cloud computing system can be divided into edge or IoT layer (tier 1), fog layer (tier 2) and cloud layer (tier 3). The devices at the edge layer generate different types of tasks which may be computation-intensive or communication intensive or having a combination of these properties. Depending on the characteristics of tasks, those may be scheduled to run at the edge or fog or cloud layers. There are many advantages of offloading some of the computationally intensive workloads, which includes improved response time, satisfying the deadlines of delay-sensitive tasks and overall reduced make span of the workloads. In this context, there is a need for designing a scheduling algorithm with the goal to minimize the overall execution time while satisfying the deadlines of the tasks and maximizing the resource utilization at fog layer. In this paper, we are proposing a task offloading and scheduling algorithm based on the osmotic approach. In the osmotic approach, the devices and tasks are classified, and the tasks are assigned to the most suitable devices based on their dynamically available capacity. The proposed scheduling algorithm is compared with traditional random task offloading and round robin task offloading algorithms using synthetic data sets and found that the proposed algorithm performance is significantly better than other algorithms. |
doi_str_mv | 10.1007/s11227-023-05440-8 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2879581332</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2879581332</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-65798814c711ca693e3bbabb734e2face445b1e72a3470e9945bce08fe64a4ab3</originalsourceid><addsrcrecordid>eNp9UMtOwzAQtBBIlMIPcIrEOeBX6uRYVbykSlzgbG2cTUhJ7GAnoN74B_6QL8GlSNy47GpnZ2a1Q8g5o5eMUnUVGONcpZSLlGZS0jQ_IDOWqTjKXB6SGS14BDPJj8lJCBtKqRRKzEi3tIkLvRtbk8AweAfmOS0hYJVUWwt9hCuEqmstpvAOHpMRwkvi6rpzULW2SVqbYNXg18dn7ZpYTeemKjGuH6Zxt0f71npne7TjKTmqoQt49tvn5Onm-nF1l64fbu9Xy3VqBCvGdJGpIs-ZNIoxA4tCoChLKEslJPIaDEqZlQwVByEVxaKIo0Ga17iQIKEUc3Kx943_vE4YRr1xk7fxpOa5KrKcCcEji-9ZxrsQPNZ68G0PfqsZ1btU9T5VHVPVP6nqPIrEXhQi2Tbo_6z_UX0DK7J-GQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2879581332</pqid></control><display><type>article</type><title>An osmotic approach-based dynamic deadline-aware task offloading in edge–fog–cloud computing environment</title><source>SpringerLink Journals - AutoHoldings</source><creator>Reddy, Posham Bhargava ; Sudhakar, Chapram</creator><creatorcontrib>Reddy, Posham Bhargava ; Sudhakar, Chapram</creatorcontrib><description>Edge–fog–cloud computing system can be divided into edge or IoT layer (tier 1), fog layer (tier 2) and cloud layer (tier 3). The devices at the edge layer generate different types of tasks which may be computation-intensive or communication intensive or having a combination of these properties. Depending on the characteristics of tasks, those may be scheduled to run at the edge or fog or cloud layers. There are many advantages of offloading some of the computationally intensive workloads, which includes improved response time, satisfying the deadlines of delay-sensitive tasks and overall reduced make span of the workloads. In this context, there is a need for designing a scheduling algorithm with the goal to minimize the overall execution time while satisfying the deadlines of the tasks and maximizing the resource utilization at fog layer. In this paper, we are proposing a task offloading and scheduling algorithm based on the osmotic approach. In the osmotic approach, the devices and tasks are classified, and the tasks are assigned to the most suitable devices based on their dynamically available capacity. The proposed scheduling algorithm is compared with traditional random task offloading and round robin task offloading algorithms using synthetic data sets and found that the proposed algorithm performance is significantly better than other algorithms.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-023-05440-8</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Cloud computing ; Compilers ; Computation offloading ; Computer Science ; Interpreters ; Processor Architectures ; Programming Languages ; Resource utilization ; Response time (computers) ; Synthetic data ; Task scheduling ; Workload ; Workloads</subject><ispartof>The Journal of supercomputing, 2023-12, Vol.79 (18), p.20938-20960</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-65798814c711ca693e3bbabb734e2face445b1e72a3470e9945bce08fe64a4ab3</citedby><cites>FETCH-LOGICAL-c319t-65798814c711ca693e3bbabb734e2face445b1e72a3470e9945bce08fe64a4ab3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11227-023-05440-8$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11227-023-05440-8$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Reddy, Posham Bhargava</creatorcontrib><creatorcontrib>Sudhakar, Chapram</creatorcontrib><title>An osmotic approach-based dynamic deadline-aware task offloading in edge–fog–cloud computing environment</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>Edge–fog–cloud computing system can be divided into edge or IoT layer (tier 1), fog layer (tier 2) and cloud layer (tier 3). The devices at the edge layer generate different types of tasks which may be computation-intensive or communication intensive or having a combination of these properties. Depending on the characteristics of tasks, those may be scheduled to run at the edge or fog or cloud layers. There are many advantages of offloading some of the computationally intensive workloads, which includes improved response time, satisfying the deadlines of delay-sensitive tasks and overall reduced make span of the workloads. In this context, there is a need for designing a scheduling algorithm with the goal to minimize the overall execution time while satisfying the deadlines of the tasks and maximizing the resource utilization at fog layer. In this paper, we are proposing a task offloading and scheduling algorithm based on the osmotic approach. In the osmotic approach, the devices and tasks are classified, and the tasks are assigned to the most suitable devices based on their dynamically available capacity. The proposed scheduling algorithm is compared with traditional random task offloading and round robin task offloading algorithms using synthetic data sets and found that the proposed algorithm performance is significantly better than other algorithms.</description><subject>Algorithms</subject><subject>Cloud computing</subject><subject>Compilers</subject><subject>Computation offloading</subject><subject>Computer Science</subject><subject>Interpreters</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><subject>Resource utilization</subject><subject>Response time (computers)</subject><subject>Synthetic data</subject><subject>Task scheduling</subject><subject>Workload</subject><subject>Workloads</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9UMtOwzAQtBBIlMIPcIrEOeBX6uRYVbykSlzgbG2cTUhJ7GAnoN74B_6QL8GlSNy47GpnZ2a1Q8g5o5eMUnUVGONcpZSLlGZS0jQ_IDOWqTjKXB6SGS14BDPJj8lJCBtKqRRKzEi3tIkLvRtbk8AweAfmOS0hYJVUWwt9hCuEqmstpvAOHpMRwkvi6rpzULW2SVqbYNXg18dn7ZpYTeemKjGuH6Zxt0f71npne7TjKTmqoQt49tvn5Onm-nF1l64fbu9Xy3VqBCvGdJGpIs-ZNIoxA4tCoChLKEslJPIaDEqZlQwVByEVxaKIo0Ga17iQIKEUc3Kx943_vE4YRr1xk7fxpOa5KrKcCcEji-9ZxrsQPNZ68G0PfqsZ1btU9T5VHVPVP6nqPIrEXhQi2Tbo_6z_UX0DK7J-GQ</recordid><startdate>20231201</startdate><enddate>20231201</enddate><creator>Reddy, Posham Bhargava</creator><creator>Sudhakar, Chapram</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20231201</creationdate><title>An osmotic approach-based dynamic deadline-aware task offloading in edge–fog–cloud computing environment</title><author>Reddy, Posham Bhargava ; Sudhakar, Chapram</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-65798814c711ca693e3bbabb734e2face445b1e72a3470e9945bce08fe64a4ab3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Cloud computing</topic><topic>Compilers</topic><topic>Computation offloading</topic><topic>Computer Science</topic><topic>Interpreters</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><topic>Resource utilization</topic><topic>Response time (computers)</topic><topic>Synthetic data</topic><topic>Task scheduling</topic><topic>Workload</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Reddy, Posham Bhargava</creatorcontrib><creatorcontrib>Sudhakar, Chapram</creatorcontrib><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Reddy, Posham Bhargava</au><au>Sudhakar, Chapram</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An osmotic approach-based dynamic deadline-aware task offloading in edge–fog–cloud computing environment</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2023-12-01</date><risdate>2023</risdate><volume>79</volume><issue>18</issue><spage>20938</spage><epage>20960</epage><pages>20938-20960</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>Edge–fog–cloud computing system can be divided into edge or IoT layer (tier 1), fog layer (tier 2) and cloud layer (tier 3). The devices at the edge layer generate different types of tasks which may be computation-intensive or communication intensive or having a combination of these properties. Depending on the characteristics of tasks, those may be scheduled to run at the edge or fog or cloud layers. There are many advantages of offloading some of the computationally intensive workloads, which includes improved response time, satisfying the deadlines of delay-sensitive tasks and overall reduced make span of the workloads. In this context, there is a need for designing a scheduling algorithm with the goal to minimize the overall execution time while satisfying the deadlines of the tasks and maximizing the resource utilization at fog layer. In this paper, we are proposing a task offloading and scheduling algorithm based on the osmotic approach. In the osmotic approach, the devices and tasks are classified, and the tasks are assigned to the most suitable devices based on their dynamically available capacity. The proposed scheduling algorithm is compared with traditional random task offloading and round robin task offloading algorithms using synthetic data sets and found that the proposed algorithm performance is significantly better than other algorithms.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-023-05440-8</doi><tpages>23</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0920-8542 |
ispartof | The Journal of supercomputing, 2023-12, Vol.79 (18), p.20938-20960 |
issn | 0920-8542 1573-0484 |
language | eng |
recordid | cdi_proquest_journals_2879581332 |
source | SpringerLink Journals - AutoHoldings |
subjects | Algorithms Cloud computing Compilers Computation offloading Computer Science Interpreters Processor Architectures Programming Languages Resource utilization Response time (computers) Synthetic data Task scheduling Workload Workloads |
title | An osmotic approach-based dynamic deadline-aware task offloading in edge–fog–cloud computing environment |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T00%3A58%3A23IST&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=An%20osmotic%20approach-based%20dynamic%20deadline-aware%20task%20offloading%20in%20edge%E2%80%93fog%E2%80%93cloud%20computing%20environment&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Reddy,%20Posham%20Bhargava&rft.date=2023-12-01&rft.volume=79&rft.issue=18&rft.spage=20938&rft.epage=20960&rft.pages=20938-20960&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-023-05440-8&rft_dat=%3Cproquest_cross%3E2879581332%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2879581332&rft_id=info:pmid/&rfr_iscdi=true |