IT appears that you are interested in my current research work. You are in luck... I love to share.
IRL
I work at Texas A&M's Internet Research Lab (IRL) under Dr. Dmitri Loguinov. IRL conducts research in a number of different avenues, including network performance analysis, stochastic modeling, large-scale Internet measurement, big-data computing, graph algorithms, congestion control, peer-to-peer networking, and web crawling. The overarching domain that I research in is big-data processing, with a focus on optimizing MapReduce algorithms (e.g. sorting), which directly impacts other research areas, like graph algorithms.
MY WORK
MY specific work is in designing fast, distribution-insensitive sorting and partitioning algorithms. I am currently working on a family of vectorized partitioning algorithms that are extremely fast in cache (as much as 3x faster than Google's Highway). By extending from bipartition to large n-partition, these algorithms are able to achieve a high work-per-key intensity in cache, ideal for memory-bound problems like partitioning and sorting. In combination with the Vortex framework, we can produce a samplesort algorithm that is incredibly fast and insensitive to the input distribution.
Intel Processor
Technologies
DUE to the deep level of our optimizations (generally at the μ-op level), we design our core partitioning algorithms instruction-by-instruction in x86-64 assembler with the AVX2 instruction set extension.