A data structure that is
rarely updated may be protected with lower-overhead
synchronization primitives than may a data structure
with a high update rate.

Such data structures are often candidates for
ReaderWriterLocking and other specialized locking models.