Pipelining dreams. LRU replacement is implemented by keeping track of when each element in a set was used relative to the other elements in the set. For a two-way set-associative cache, tracking when the two elements were used can be implemented by keeping a single bit in each set and setting the bit to indicate an element whenever that element is referenced. As associativity increases, implementing LRU gets harder. ©

Computer Science graduate for university of Newcastle. My career has ben mostly in consultancies which gave the opportunity to work on many different projects and try multiple technologies. Thanks to exposure to many different programming patterns I strive to find the solutions that best fit the problem and the team. ©

● Focus: jquery, php, html and css. ● Age: 18 ©

Currently working as deputy CTO at Fintech Startup at Skolkovo. Worked as CTO in textback.io. Making Ph.D. in Saint-Petersburg State Polytechnic University. Trying to play the saxophone. Programming on Java, Scala, C# and a little bit on Python. I like machine learning, statistical analysis, and artificial intelligence staff. Worked a lot with plenty of mathematical toolboxes and frameworks. ©