We present a new concurrency control algorithm with Blocking Starvation- Free write operations and Wait-Free Population Oblivious read operations, which we named the Left-Right technique. This technique requires using two instances of a given resource, and can be used on any data structure, allowing concurrent access to it, similar to a Reader-Writer lock, but in a non-blocking manner for reads, and it does not need an automatic Garbage Collector (GC).