Vlad Petric,
an American mathematician, computer architect, senior software architect in Hedge Fund management, and former Intel and Google engineer [1]. In 2007, he received his Ph.D from University of Pennsylvania on the topic of a Rename-Based Instruction Optimizer under thesis advisor Amir Roth[2].
an American mathematician, computer architect, senior software architect in Hedge Fund management, and former Intel and Google engineer [1]. In 2007, he received his Ph.D from University of Pennsylvania on the topic of a Rename-Based Instruction Optimizer under thesis advisor Amir Roth [2].
Table of Contents
Bit Gather Via Multiplication
While working on an Othello project, he rediscovered the bitboard trick to multiply and right shift masked lines (files, ranks, diagonals and anti-diagonals) to obtain a dense index with all masked bits of the line extracted [4] [5].Selected Publications
[6] [7] [8]External Links
References
What links here?
Up one Level