Network-aware heuristics for inter-domain meta-scheduling in grids

Caminero, Agustín, Rana, Omer Farood ORCID: https://orcid.org/0000-0003-3597-2646, Caminero, Blanca and Carrión, Carmen 2011. Network-aware heuristics for inter-domain meta-scheduling in grids. Journal of Computer and System Sciences 77 (2) , pp. 262-281. 10.1016/j.jcss.2010.01.006

Full text not available from this repository.

Abstract

Grid computing generally involves the aggregation of geographically distributed resources in the context of a particular application. As such resources can exist within different administrative domains, requirements on the communication network must also be taken into account when performing meta-scheduling, migration or monitoring of jobs. Similarly, coordinating efficient interaction between different domains should also be considered when performing such meta-scheduling of jobs. A strategy to perform peer-to-peer-inspired meta-scheduling in Grids is presented. This strategy has three main goals: (1) it takes the network characteristics into account when performing meta-scheduling; (2) communication and query referral between domains is considered, so that efficient meta-scheduling can be performed; and (3) the strategy demonstrates scalability, making it suitable for many scientific applications that require resources on a large scale. Simulation results are presented that demonstrate the usefulness of this approach, and it is compared with other proposals from literature.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Grid computing; Network-aware; Inter-domain; Peer-to-peer; Meta-scheduling
Publisher:	Elsevier
ISSN:	0022-0000
Last Modified:	20 Oct 2022 08:11
URI:	https://orca.cardiff.ac.uk/id/eprint/27527

Citation Data

Cited 27 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item