Minimizing Task Completion Time in the Cloud based on Random Neural Network
With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applic...
Saved in:
| Published in: | 2021 International Conference on Computer, Blockchain and Financial Development (CBFD) pp. 60 - 65 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.04.2021
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments. |
|---|---|
| AbstractList | With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments. |
| Author | Yu, Wang Tongtong, Wu |
| Author_xml | – sequence: 1 givenname: Wang surname: Yu fullname: Yu, Wang email: 347220312@qq.com organization: Shandong University of Science and Technology,College of Computer Science and Engineering,Qingdao,China – sequence: 2 givenname: Wu surname: Tongtong fullname: Tongtong, Wu email: tongtwu@126.com organization: Shandong University of Science and Technology,College of Computer Science and Engineering,Qingdao,China |
| BookMark | eNotjsFKxDAUACPowV39Aj3kB1rzkiZpjlpdFVcFqefltXnVsG2ydLuIfr0FPc1hYJgFO44pEmOXIHIA4a6qm9Wtlka7XAoJuRAC3BFbgDG6ACmtPmVPzyGGIfyE-MFr3G95lYZdT1NIkddhIB4inz6JV306eN7gnjyf1RtGnwb-QocR-xnTVxq3Z-ykw35P5_9csvfVXV09ZOvX-8fqep0FgHLKLFpq55-2MKgAFDbGy8KD1Y01AnxpHFrVqaYTsvXaYluAdkWJnZVSll4t2cVfNxDRZjeGAcfvjbPaQanVL-RVSVs |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CBFD52659.2021.00019 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1665412275 9781665412278 |
| EndPage | 65 |
| ExternalDocumentID | 9759185 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i118t-7a7ec021c46a3113ab6d24d175b7601d869a73f3bf02cd57ac415948af72228d3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Aug 27 02:40:39 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i118t-7a7ec021c46a3113ab6d24d175b7601d869a73f3bf02cd57ac415948af72228d3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_9759185 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-April |
| PublicationDateYYYYMMDD | 2021-04-01 |
| PublicationDate_xml | – month: 04 year: 2021 text: 2021-April |
| PublicationDecade | 2020 |
| PublicationTitle | 2021 International Conference on Computer, Blockchain and Financial Development (CBFD) |
| PublicationTitleAbbrev | CBFD |
| PublicationYear | 2021 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.7534671 |
| Snippet | With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 60 |
| SubjectTerms | Cloud computing Heuristic algorithms Multi-access edge computing Neural networks Processor scheduling queue theory random neural network Simulation Stochastic processes task completion time task dispatching |
| Title | Minimizing Task Completion Time in the Cloud based on Random Neural Network |
| URI | https://ieeexplore.ieee.org/document/9759185 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwMhECZt48GTmtb4DgeP0pblVa5WGxO1aUxNemtmF0g2tmzThwd_vUCbGhMvniBwIAyBbwbm-0DoVoGmTEogXDBFODWKaFCahGPQhaBFCgNJXf9FDYe9yUSPauhuz4Wx1qbkM9uO1fSWb6piE6_KOloJHfCljupKyS1Xa8eGo13d6d8PHqLYe6SfZLSdvJdff6YkyBgc_W-wY9T64d7h0R5VTlDN-iZ6fi19OS-_Qgsew-oDx20cZbMrjyOJA5ceB08O92fVxuCITAaHrjfwpprjKMABs1CkjO8Weh88jvtPZPcNAimD978mCpQtwowKLoFRyiCXJuMm4H4eE1pMTwbrMsdy180KIxQUAZQ174FT8XrHsFPU8JW3ZwjLzIHInJAQ4sKc05wLyLVzEcd0ofQ5akZDTBdbpYvpzgYXfzdfosNo6W0eyxVqrJcbe40Ois91uVrepOX5BpohkSw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfSk0opvc_Dott1HkuZqtVT6oEiF3srsJoHFdlf68OCvN7NdKoIXTwnJIWRC8k2S-b4BuJeo_FAI9CIeSi_ytfQUSuW5Y9C6S4vgGgt1_YEcjdrTqRpX4GHHhTHGFMFnpkHV4i9f58mGnsqaSnLl8GUP9ilzVsnWKvlwfks1O4_dJ5J7JwJK4DcK_-VX1pQCNLrH_xvuBOo_7Ds23uHKKVRMVoP-MM3SRfrlWtgEV--MNjIJZ-cZIxoHSzPmfDnWmecbzQibNHNdr5jpfMFIggPnrihivuvw1n2edHpemQjBS53_v_YkSpO4GSWRwND3Q4yFDiLtkD-mkBbdFs6-oQ1j2woSzSUmDpZV1EYr6YFHh2dQzfLMnAMTgUUeWC7Q3QzjyI8jjrGylpBMJVJdQI0MMfvYal3MShtc_t18B4e9yXAwG7yM-ldwRFbfRrVcQ3W93JgbOEg-1-lqeVss1TdbtZR1 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2021+International+Conference+on+Computer%2C+Blockchain+and+Financial+Development+%28CBFD%29&rft.atitle=Minimizing+Task+Completion+Time+in+the+Cloud+based+on+Random+Neural+Network&rft.au=Yu%2C+Wang&rft.au=Tongtong%2C+Wu&rft.date=2021-04-01&rft.pub=IEEE&rft.spage=60&rft.epage=65&rft_id=info:doi/10.1109%2FCBFD52659.2021.00019&rft.externalDocID=9759185 |