Bakhshad, Said and Noor, Rafidah Md and Akhundzada, Adnan and Saba, Tanzila and Ahmedy, Ismail and Haroon, Faisal and Nazir, Babar (2018) A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things. Ad-Hoc and Sensor Wireless Networks, 40 (3-4). pp. 275-296. ISSN 1551-9899,
Full text not available from this repository.Abstract
Grid computing is a powerful distributed and scalable computing infrastructure that deals with massive data-intensive applications. Efficient utilization of the available computing grid resources remains a challenge. Moreover, it becomes even more challenging in the highly dynamic and distributed environment of the Internet of Things (IoT). Replication is considered a key optimization technique in data grids. However, the extent state of-the-art replication algorithms do not consider the position of the replica at the time of the scheduling rather it sends the job request to the Site and then Replica Manager of the Site checks the replica existence. We propose a novel dynamic Replication Aware Load Balanced Scheduling (DRALBS) algorithm, that considers the replica location dynamically at the time of scheduling of the job. The simulation of the proposed algorithm shows promising results and better performance compared to the current state-of-the-art Modified Dynamic Hierarchical Replication (MDHR) algorithm. The response and average access time has been significantly decreased, thus reducing the overall mean job execution time.
| Item Type: | Article |
|---|---|
| Funders: | UNSPECIFIED |
| Uncontrolled Keywords: | Scheduling; Data Grid; Replication; Migrations; Gridsim |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Computer Science & Information Technology |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 17 Sep 2019 00:58 |
| Last Modified: | 17 Sep 2019 00:58 |
| URI: | http://eprints.um.edu.my/id/eprint/22364 |
Actions (login required)
 |
View Item |
