Binary Matchmaking for Inter-Grid Job Scheduling

Inter-Grid is a composition of small interconnected Grid domains; each has its own local broker. The main question is how to implement cross-Grid job scheduling achieving stability and load balancing, together with maintaining the local policies of interconnected Grid. Existing Inter-Grid methodologies are based on either centralised meta-scheduling or decentralised scheduling which carried out by local brokers, but without proper coordination. The question is how to perform matchmaking between a particular local job and the workers of a remote domain. Performing matchmaking remotely would result in computational overhead in case of many domains asking for match from one domain. Performing matchmaking locally requires transmission of the resource information set of the remote domain, which would result in high data traffic. This position paper introduces a coordinated scheduling technique for broker based inter-Grid architectures. Resource information set of each Grid domain is stored in a binary form. Matchmaking is carried out in the local domain using fast logical operations. Our primary results show that the proposed technique achieves 26 speedup in the matchmaking process compared to Condor negotiator, and a reduction up to 99.92 % in the resource information size compared to Condor ClassAd.