Speaker: Oded Green, PhD, Senior Graph Software Engineer, NVIDIA RAPIDS Team, NVIDIA Corporation
Date: Tuesday, April 16, 2019
Time: 03:00pm – 04:15pm
Location: Jesse W. Mason Building, Room 2117
Sparse data computations are ubiquitous in science and engineering. Two widely used applications requiring sparse data computations are graph algorithms and linear algebra operations such as Sparse Matrix-Vector Multiplication (SpMV). In contrast to their dense data counterparts, sparse-data computations have less locality and more irregularity in their execution - making them significantly more challenging to optimize. This is especially true for accelerators and many core systems.
In today's talk, I will cover NVIDIA's and the graph community's effort to overcome these challenges and to create a simple to use framework that will enable both programmers and data scientists to get high performance graph algorithms, with high productivity, and an easy to use API that does not require broad HPC knowledge.
Oded Green is a Senior Graph Software Engineer in NVIDIA's RAPIDS team where he works on implementing high performance data structures and algorithms for big data analytics. Oded received his PhD in Computational Sciences and Engineering at Georgia Institute of Technology (Georgia Tech). Oded received both his MSc in electrical engineering and his BSc in computer engineering from Technion – Israel Institute of Technology.
Oded's research primarily focuses on improving the performance and scalability of large-scale analytics, with an emphasis on graph analytics, using a wide range of high-performance computational platforms. Oded also focuses on architecture-algorithm co-design.