.png){kind=icon}
.png){kind=icon}
Return
A scheduling algorithm with dynamic properties in mobile grid
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-014-3223-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile grid is a branch of grid computing that incorporates mobile devices into the grid infrastructure. It poses new challenges because mobile devices are typically resource-constrained and exhibit unique characteristics such as instability in network connections. New scheduling strategies are imperative in mobile grid to efficiently utilize the devices. This paper presents a scheduling algorithm that considers dynamic properties of mobile devices such as availability, reliability, maintainability, and usage pattern in mobile grid environments. In particular, usage patterns caused by voluntarily or involuntarily losing a connection, such as switching off the device or a network interruption could be important criteria for choosing the best resource to execute a job. The experimental results show that our scheduling algorithm provides superior performance in terms of execution time, as compared to the other methods that do not consider usage pattern. Throughout the experiments, we found it essential to consider usage pattern for improving performance in the mobile grid.
Keywords:
mobile grid
scheduling
dynamic properties
availability
reliability
maintainability
usage pattern
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
1.6K
Citations:
2.8K
View more organizations