When is it best to use the second chance repalcement algorithm?


I’m going through ‘Operating Concepts’ by Silberschatz, Galvin and Gagne (The Dinosaur Book) and it mentions the Second-Chance Algorithm (not enhanced) as an improvement on the FIFO replacement algorithm.

My question is, is there ever a case where this algorithm would perform better than, say, the Least Recently Used algorithm or even something like the Farthest-in-Future Algorithm? The book describes how the algorithm works but doesn’t offer a lot of information on when it would be useful, other than just in improving ‘FIFO’.