I think it would be very similar to how matching is done today. Again,
however, trying to keep data structures to a minimum to shave latency
off wherever we can.
On 1/20/09 8:53 PM, "Jeff Squyres" <firstname.lastname@example.org> wrote:
Eugene: you mentioned that there are other possibilities to having the
BTL understand match headers, such as a callback into the PML. Have
you tried this approach to see what the performance cost would be,
How is this different from the way matching is done today ?