AVL versus red-black trees question

Okay, if I keep up my interest in algorithms, we may need an algorithms subforum! Or I suppose could just continue spamming the Non-QBasic and C++ forums. That works, too.

Anyhow, I have ran numerous tests on two AVL trees and two red-black trees. In every single test I can come up with, AVL trees are faster. That contradicts all that the wonderful and insightful Google tells us about the matter!

This is really bugging me, and I was hoping that somebody could explain which is faster and when and why. Also, if you want to take a look at half of the tests I've run, head on over to http://nathanbelue.blogspot.com/2012/05/red-black-versus-avl.html>.