.png){kind=icon}
.png){kind=icon}
Return
Migration-Based Online CPSCN Big Data Analysis in Data Centers
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2810255.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is critical to schedule online data-intensive jobs effectively for various applications, including cyber-physical-system and social network system. It is also useful to support timely decision making and better prediction. In this paper, we investigate the online job scheduling problem with data migration for global job execution time reduction. We first establish a time model based on the real experimental results, and propose an online job placement algorithm by taking into account the benefit of both instantaneity and locality for the jobs. We then introduce data migration to the job placement algorithm. The core idea is to make a tradeoff between the migration cost and remote access cost. The simulation results demonstrate that our algorithm has a significant improvement than FIFO, and data migration shows effectiveness on global job execution time reduction. Our algorithms also provide an acceptable fairness for jobs.
Keywords:
Big data analysis
CPSCN
data center
data placement
online job scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available