Ioannis Venetis is an Assistant Professor at the University of Piraeus, School of Information and Communication Technologies, Department of Informatics, specializing in Operating Systems and Parallel Computing. He earned his PhD from the Department of Computer Engineering and Informatics at the University of Patras. His research spans programming models for parallel systems, scheduling optimization, and applications in computational neuroscience and seismology. Research Interests Operating Systems Parallel Computing Scheduling Algorithms High-Performance Computing Computational Neuroscience Seismology Projects Participation in European and national research programs Development of Gisola (GPU-accelerated seismic inversion tool) His teaching portfolio includes courses like Operating Systems, Parallel Processing, and Symbolic Programming. Articles highlight expertise in GPU acceleration, tridiagonal solvers, sensor networks, and many-core architectures. Notable contributions include work on Chimera states in neuronal dynamics and hierarchical workload scheduling frameworks.
Byron Cook is Professor of Computer Science at University College London (UCL) and Director of Automated Reasoning at Amazon Web Services. He leads Amazon's Automated Reasoning Group (ARG) and has driven the broad adoption of formal methods across AWS services. His career spans academia and industry, with significant contributions to program verification and automated reasoning. His research focuses on verification, automated reasoning, program analysis, computer/network security, programming languages, theorem proving, logic, and applications to hardware design, operating systems, and biological systems. Cook's work bridges theoretical foundations with practical applications in cloud security and system reliability, particularly through his leadership in applying formal methods to AWS infrastructure. Cook's recent publications demonstrate a strong focus on applying automated reasoning to cloud security challenges, particularly around access control policies, network reachability, and cryptographic implementations. His work shows a clear trajectory from theoretical program verification toward practical security applications in large-scale cloud environments, with emphasis on making formal methods accessible to developers through "one-click" verification tools. Scientific Awards: FREng (Fellow of the Royal Academy of Engineering) As an academic advisor, Cook has mentored numerous PhD students and interns who have gone on to significant careers in programming languages and verification research. His work at Amazon has secured substantial research funding for developing and deploying automated reasoning tools across AWS services. Cook founded and leads Amazon's Automated Reasoning Group (ARG), which develops tools like IAM Access Analyzer, Tiros, Zelkova, and T2. Previously, he managed the Programming Principles and Tools (PPT) group at Microsoft Research Cambridge, where he co-founded projects including TERMINATOR, SLAyer, and the Bio Model Analyzer (BMA).
Rajiv Gupta is a Distinguished Professor and the Amrik Singh Poonian Professor of Computer Science at the University of California, Riverside (UCR), where he serves as Associate Dean for Academic Personnel in the Bourns College of Engineering (BCOE). He is a member of the RIPLE research group and has co-authored 327 papers with an h-index of 69 and over 16,600 citations. His extensive service includes chairing major conferences such as FCRC 2015, PPoPP 2020, ASPLOS 2011, and PLDI 2008. Professor Gupta's research focuses on Programming, Compiler, Runtime & Architectural Support for Parallel & Distributed Heterogeneous Systems and Software Tools for Monitoring and Managing Runtime Behavior . His work spans graph analytics with scalability and performance, understanding and managing the dynamic behavior of parallel programs, software speculation for irregular parallelism, dynamic program analysis for secure and reliable computing, and compiler optimizations with architectural support. His research has significant applications in high-performance computing, GPU programming, and distributed systems. Analysis of his recent publications reveals a strong focus on graph processing systems, with particular emphasis on evolving and streaming graph analytics. His work addresses critical challenges in memory management for large-scale graph processing, hardware acceleration for graph algorithms, and optimization techniques for concurrent and distributed graph computations. The research demonstrates a progression from foundational compiler and architecture work to increasingly sophisticated systems for handling modern data-intensive computing challenges. Fellow of the ACM (2009) Fellow of the IEEE (2008) Fellow of the AAAS (2011) NSF Presidential Young Investigator Award (1991) UCR Doctoral Dissertation Advisor/Mentor Award (2012) Multiple best paper awards across major conferences Two students won ACM SIGPLAN Outstanding Doctoral Dissertation Award Five advisees received NSF CAREER Award Professor Gupta has supervised 42 PhD students to completion and currently advises several doctoral candidates. His advising success is reflected in his students' achievements, including multiple award-winning dissertations and significant career accomplishments in academia and industry. His research has been supported by numerous grants from NSF, DARPA, and industry partners, enabling sustained investigation into parallel computing systems. The RIPLE research group under his leadership has produced influential work that bridges theoretical foundations with practical system implementations. As the leader of the RIPLE research group at UC Riverside, Professor Gupta oversees a vibrant team focused on innovative approaches to parallel and distributed computing. The group maintains strong collaborations with industry partners and other academic institutions, contributing to the development of next-generation computing systems. Current projects include GRASP (Graph Analytics with Scalability & Performance) and research on understanding and managing the dynamic behavior of parallel programs, reflecting the group's continued focus on cutting-edge computing challenges.
Konstantinos Kallas serves as Assistant Professor of Computer Science at the University of California, Los Angeles (UCLA), commencing his appointment in January 2025. Previously affiliated with the University of Pennsylvania as evidenced by his 2020 PLDI contribution, his research bridges theoretical formal methods with practical systems engineering across multiple high-impact conferences including PLDI, POPL, and SPLASH. His research program centers on enhancing computational efficiency and correctness in systems software, with three flagship projects defining his trajectory: PaSh for automatic shell script parallelization, Durable Functions for stateful serverless computing semantics, and DiffStream for differential testing of stream processing. These efforts consistently target the intersection of programming language theory and real-world systems constraints, particularly in parallelism, concurrency, and cloud-native environments where correctness guarantees are challenging to implement. Analysis of his publication history since 2020 reveals a methodological pattern: developing formal semantic models to enable practical optimizations in distributed systems. His work increasingly focuses on serverless architectures and data-intensive pipelines, with recent contributions emphasizing automated verification techniques. The evolution from shell script optimization (2020-2021) to serverless state management (2021-2022) demonstrates strategic expansion into cloud computing's hardest problems. Dr. Kallas actively contributes to the academic community through program committee service for PLDI (2022, 2025), POPL (2021, 2022, 2023), and SPLASH (2020-2023), including leadership roles as Publicity Co-Chair for PLDI 2025 and 2026. His June 2024 announcement confirms recruitment for Fall 2025 students at UCLA, targeting researchers interested in systems, compilers, and programming languages who can advance his work on correctness-preserving parallelization and serverless computing.
Sang-Hoon Kim is an Associate Professor in the Department of Software and Computer Engineering and Department of Artificial Intelligence at Ajou University, South Korea. He leads the Systems Software Lab (Paldal Hall 1004-2) and maintains active collaborations with Virginia Tech as a Visiting Scholar since August 2024. His academic journey includes a Ph.D. in Computer Science from KAIST (2016) under advisors Seungryoul Maeng and Jin-Soo Kim, and a B.S. in Computer Science from KAIST (2002). His research spans operating systems, memory management, and storage systems with focus on mobile platforms, heterogeneous architectures, and SSD technologies. Key interests include memory fragmentation control , distributed thread execution , key-value storage optimization , and resource disaggregation . His work bridges theoretical innovation with practical system implementations, particularly for mobile and datacenter environments. Kim's publication portfolio shows consistent output in top-tier venues including USENIX FAST, VLDB, ICDCS, and ASPLOS. His research demonstrates evolution from mobile memory management (2015-2017) toward distributed systems and hardware-aware software (2019-present), with recent emphasis on resource-disaggregated environments and heterogeneous-ISA computing. The 2024 Best Paper Award at USENIX FAST highlights his impact in storage systems research. Best Paper Award at USENIX FAST'24 Multiple patents including US-9588912B2 for memory control He directs significant research projects funded by ETRI, NRF, and US ONR, including current work on memory-centric computing systems (2020-2023) and disaggregated non-volatile memory systems using RDMA (2018-2020). His Systems Software Lab maintains strong industry partnerships with Samsung Electronics and NHN, with prior projects improving Android memory management and developing SSD-based storage systems for large-scale internet services.
Fredrik Kjolstad is an Assistant Professor in the Department of Computer Science at Stanford University, specializing in compilers and programming models for sparse computing and performance engineering. His research focuses on separating algorithms from data representations to enable portable applications across diverse hardware platforms. His research interests span compilers, programming models, performance engineering, and computer architecture, with particular emphasis on sparse tensor algebra, compiler design for heterogeneous systems, and high-performance computing. He has pioneered frameworks like TACO, Simit, and Distal that enable efficient sparse computations across CPUs, GPUs, and specialized accelerators. Dr. Kjolstad's publications demonstrate expertise in compiler optimization techniques for sparse data structures, tensor algebra, and distributed systems. His work consistently addresses the challenge of bridging high-level programming abstractions with efficient hardware execution across diverse architectures. MIT EECS First Place George M. Sprowls PhD Thesis Award NSF CAREER Award Rosing Award Adobe Fellowship Google Research Scholarship Best Paper Awards at EuroMPI 2013, OOPSLA 2017, and OOPSLA 2021 ISCA Distinguished Artifact Award PLDI and OOPSLA Distinguished Paper Awards He advises multiple PhD students including James Dong, Olivia Hsu, and Rohan Yadav, while leading research on compiler technologies that have received significant grant support. His group develops practical tools like the TACO compiler and Legate Sparse that are used in both academic and industrial settings. Current projects focus on programmable accelerators for sparse tensor algebra, distributed sparse computing, and compiler support for emerging hardware architectures.
Jaejin Lee is a Professor in the Department of Computer Science and Engineering at Seoul National University (SNU) and serves as the Director of the Center for Manycore Programming and Multicore Computing Research Laboratory. He holds a BS in Physics from SNU (1991), an MS in Computer Science from Stanford University (1995), and a PhD in Computer Science from the University of Illinois at Urbana-Champaign (1999), where his research was supported by IBM and Korea Foundation for Advanced Studies fellowships. Research Focus: His work centers on heterogeneous computing systems with expertise in GPU/FPGA programming, deep learning compiler architectures, PyTorch/TensorFlow optimization, and quantum computing simulation environments. Key areas include parallelization techniques and performance enhancement for machine learning frameworks. Publications: His research output demonstrates consistent focus on GPU efficiency, compiler-directed optimizations, and distributed computing, with recent emphasis on deep learning acceleration and error resilience in heterogeneous architectures. Awards & Honors: IEEE Fellow IBM Graduate Fellowship Korea Foundation for Advanced Studies Graduate Fellowship Leadership: Directs the Multicore Computing Research Laboratory and Center for Manycore Programming, focusing on next-generation parallel computing architectures.
Anil Madhavapeddy is the Professor of Planetary Computing at the University of Cambridge Computer Laboratory, where he co-leads the Energy & Environment Group and is a member of the Systems Research Group. He is also a Fellow at Pembroke College where he serves as Director of Studies in Computer Science. Madhavapeddy completed his PhD from the University of Cambridge in 2003 and his BEng in Information Systems Engineering from Imperial College in 1999. He holds a JM Keynes Fellowship since 2022 for his work combining computer science with economics, and serves on the management committee of the Cambridge Conservation Initiative where he co-directs 4C (Cambridge Centre for Carbon Credits) and the Centre for Earth Observation. His research spans computer systems and programming languages with a strong focus on applying these technologies to global conservation, biodiversity, and climate change challenges. He leads the OCaml Labs group and has made significant contributions to open-source projects including OCaml, Docker, Xen, and OpenBSD. His work often bridges computer science with environmental science, developing computational approaches to address planetary-scale challenges. Madhavapeddy's recent publications demonstrate a clear trajectory toward integrating programming language research with environmental monitoring and conservation. His work spans from foundational programming language techniques to applied geospatial computing systems, with increasing emphasis on biodiversity measurement, carbon credit systems, and planetary-scale environmental monitoring. JM Keynes Fellowship (2022-present) As an educator, Madhavapeddy teaches undergraduate courses including Foundations of Computer Science, Software & Security Engineering, and Cloud Computing. He mentors MPhil and PhD students and co-founded the award-winning book 'Real World OCaml' (2nd Edition, 2022). He has co-founded several companies including Unikernel Systems, High Energy Magic, Segfault, and Tarides to translate research into real-world impact. Madhavapeddy leads the OCaml Labs group at Cambridge and works closely with the Energy & Environment Group, collaborating with colleagues from Plant Sciences, Zoology, Economics, and NGOs including UNEP-WCMC and the IUCN. His current efforts are primarily focused on conservation technology through partnerships with organizations like Canopy PACT.
Kunle Olukotun is a Professor of Electrical Engineering and Computer Science at Stanford University's School of Engineering, where he has been faculty since 1991. He directs the Stanford Pervasive Parallelism Lab (PPL) and co-leads the Transactional Coherence and Consistency (TCC) project. His research focuses on computer architecture, parallel programming environments, and scalable parallel systems. Key areas include chip multiprocessors (CMPs), transactional memory systems, domain-specific languages (DSLs) for heterogeneous computing, and hardware-software co-design for machine learning workloads. His work bridges theoretical foundations with practical systems implementation. Notable contributions include the Stanford Hydra research project (one of the first chip multiprocessors with thread-level speculation), founding Afara Websystems (acquired by Sun Microsystems), and developing the Niagara processor architecture. His DSL frameworks like Green-Marl and Spatial enable efficient graph analysis and hardware acceleration. His publications reveal strong trends in parallel systems evolution: from foundational CMP research (2000s) to transactional memory (2004-2010), then DSLs for heterogeneous computing (2010-2015), and currently foundation model systems (2023-2025). Subfield analysis shows consistent focus on hardware-software co-design, sparse computation, and compiler techniques across decades. ACM Fellow (2006) for contributions to multiprocessors on a chip and multi-threaded processor design Best Paper Award at IEEE International Symposium on Workload Characteristics (IISWC '10) for EigenBench Olukotun actively mentors researchers through the Stanford Pervasive Parallelism Lab (PPL), which seeks to proliferate parallelism across application domains. His projects have secured significant industry partnerships, including the acquisition of his startup Afara Websystems by Sun Microsystems. Current research focuses on compiler frameworks for foundation model systems and hardware acceleration for sparse machine learning workloads, supported by collaborations with major tech companies. He leads the Stanford Pervasive Parallelism Lab (PPL), which develops compiler and runtime systems for heterogeneous architectures. The lab's work spans DSLs, hardware acceleration, and parallel programming models, with strong industry ties to companies like NVIDIA and Google. Current initiatives include the Mosaic compiler framework and Stardust architecture for sparse tensor computation.
