I'm wondering what timing tests were used when developing PCP. I don't
know if this could be answered by the open source developers, or would
need to be redirected to the main developers. Basically, one of my
coworkers believes that the response time for PCP is pretty slow, and
believes that a better solution for sending data between hosts could be
made and would be significantly better. [1]
Right now it takes almost exactly 4 seconds to call pminfo on 87 hosts for
mem.freemem. I think this is very good. We will be expanding to a few
hundred hosts in the near future though. So basically, was any optimizing
done in regards to speed when designing PCP? If so, is it possible to see
any kind of tests or decisions that were made to show that PCP is truly
optimized for speed?
Thanks,
Alan
[1] - One of the ideas he had was to use pcp to just collect data on the
localhost and store it in some structure. The query mechanism between
hosts would then ask each individual host for data, and this cached data
would be returned. This is obviously very similar to a caching PMDA,
which might be an option, but I forgot to mention it to him. He was also
thinking of using UDP, a hierarchical grabbing scheme, and some other
techniques for getting data. I don't think it would help much, networks
can only go so fast ;)
|