Georgia Tech Yellow Jackets boasted a large contingent at this week's mega-conference -- FCRC 2015 -- in Portland, Ore.

The ACM's Federated Computing Research Conference occurs every four years and assembles a spectrum of 13 smaller, affiliated research conferences and workshops about computing that occur at the same time. Representatives from Georgia Tech’s School of Computational Science & Engineering and the School of Computer Science chaired conferences, led sessions and presented papers.

At HPDC ‘15 (High Performance Parallel and Distributed Computing), CS Professor Ling Liu, CS Professor Calton Pu, with CS students Yang Zhou and Kisung Lee, and Qi Zhang (MSE affiliate) presented “Fast Interactive Graph Computation with Resource Aware Graph Parallel Abstractions” about graphs and architectures.

At ISCA ‘15 (International Symposium on Computer Architecture), CS Associate Professor Milos Prvulovic and CS student Ching-Kai Liang presented “Minimalistic Synchronization Accelerator with Resource Overflow Management.” Prvulovic also presented his work about side-channel attacks, "FASE: Finding Amplitude-modulated Side-channel Emanations” with ECE Graduate Teaching Assistant Robert Callan and ECE Assistant Professor Alenka Zajic. CS and ECE student Jin Wang presented “Dynamic Thread Block Launch: A Lightweight Execution Mechanism to Support Irregular Applications on GPUs" with ECE Professor Sudhakar Yalamanchili. CS Regents' Professor Karsten Schwan and CS student Jian Huang presented “Unified Address Translation for Memory-Mapped SSDs with FlashMap” with ECE Associate Professor Moinuddin Qureshi and Microsoft Research. Yalamanchili and Qureshi also presented other work for a total of six papers by Georgia Tech at ISCA ‘15.

At STOC ‘15 (ACM Symposium on Theory of Computing), ACO student Ben Cousins and CS Distinguished Professor Santosh Vempala presented “Bypassing KLS: Gaussian Cooling and an O*(n^3) Volume Algorithm.” Vempala also presented “On the Complexity of Random Satisfiability Problems with Planted Solutions” with former post-doc Will Perkins. ACO student David Durfee presented “On the Complexity of Nash Equilibria in Anonymous Games” with a Columbia University student and professor.

At SPAA ‘15 (ACM Symposium on Parallelism in Algorithms and Architectures), CSE Associate Professor Rich Vuduc presented “Branch-Avoiding Graph Algorithms” with recent CSE PhD graduate Oded Green and CSE student Marat Dukan.

CS Professor Jim Xu served as general chair of SIGMETRICS ‘15 and session chair.