RC is much more deterministic than GC. Garbage collectors commonly defer object deallocation until some threshold is reached, and then do it all at once. This means that two iterations of the same loop, that do the exact same thing, may take dramatically different amounts of time.

Reference counting is more stable and predictable, because the deallocation behavior depends only on the object graph in question, and not on some global state.