Re: [classad-users] How close is a match?


Date: Sun, 05 Mar 2006 19:33:19 -0600
From: Alain Roy <roy@xxxxxxxxxxx>
Subject: Re: [classad-users] How close is a match?

I want to know how many constraints(experssions in requirements attribute) match and how many doesnt when we perform classads matchmaking.
 Suppose requirements= (exprA) and (exprB) and (exprC) and (exprD)
I want to know how many were true and how many were false, though not exactly which failed and which succeeded. I want to calculate the closeness of a match.

Does Clasads provide any function to know that ? If not can anyone suggest how to proceed using ClassAds?

The ClassAd library that we distribute doesn't implement this. Condor implements this, and you can read about the implementation (which was conceived and implemented by Nick Coleman) here:

Nicholas Coleman, Rajesh Raman, Miron Livny and Marvin Solomon, "Distributed Policy Management and Comprehension with Classified Advertisements", University of Wisconsin-Madison Computer Sciences Technical Report #1481, April 2003.
http://www.cs.wisc.edu/condor/doc/ncoleman_tr1481.pdf

It doesn't do exactly what you ask for, because it gives you which failed and how to modify them to succeed. But from that, you could calculate closeness of the match.

-alain


[← Prev in Thread] Current Thread [Next in Thread→]