Neighborhood search-based job scheduling for IoT big data real-time processing in distributed edge-cloud computing environment

Cloud-edge collaboration architecture, which combines edge processing and centralized cloud processing, is suitable for placement and caching of streaming media. A cache-aware scheduling model based on neighborhood search is proposed. The model is divided into four sub-problems: job classification,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of supercomputing Ročník 77; číslo 2; s. 1853 - 1878
Hlavní autoři: Li, Chunlin, Zhang, YiHan, Luo, Youlong
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2021
Springer Nature B.V
Témata:
Algorithms
Caching
Cloud computing
Clustering
Compilers
Computer Science
Data centers
Interpreters
Job classification
Neighborhoods
Nodes
Placement
Processor Architectures
Programming Languages
Resource allocation
Scheduling
Searching
Streaming media
Neighborhood search
Distributed edge-cloud
Job scheduling
ISSN:0920-8542, 1573-0484
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Cloud-edge collaboration architecture, which combines edge processing and centralized cloud processing, is suitable for placement and caching of streaming media. A cache-aware scheduling model based on neighborhood search is proposed. The model is divided into four sub-problems: job classification, node resource allocation, node clustering, and cache-aware job scheduling. Firstly, jobs are categorized into three categories, and then different resources are allocated to nodes according to different job execution conditions. Secondly, the nodes with similar capabilities are clustered, and the jobs are cached by delay-waiting. For jobs that do not satisfy the data locality, the jobs are scheduled to the nodes with similar capabilities according to the neighborhood search results. Meanwhile, a cache-aware scheduling algorithm based on neighborhood search is proposed. Experiments show that the proposed algorithm can effectively minimize the delay of content transmission and the cost of content placement, the job execution time is shortened and the processing capacity of the cloud data center is improved.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-020-03343-6