Oguz Selvitopi

Orcid: 0000-0002-0203-0372

Affiliations:
  • Lawrence Berkeley National Laboratory, USA


According to our database1, Oguz Selvitopi authored at least 30 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Evaluating the potential of disaggregated memory systems for HPC applications.
Concurr. Comput. Pract. Exp., August, 2024

Exabiome: Advancing Microbial Science through Exascale Computing.
Comput. Sci. Eng., 2024

Sparsity-Aware Communication for Distributed Graph Neural Network Training.
Proceedings of the 53rd International Conference on Parallel Processing, 2024

2022
Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems.
IEEE Trans. Parallel Distributed Syst., 2022

Extreme-Scale Many-against-Many Protein Similarity Search.
Proceedings of the SC22: International Conference for High Performance Computing, 2022

Parallel Algorithms for Masked Sparse Matrix-Matrix Products.
Proceedings of the 51st International Conference on Parallel Processing, 2022

2021
Fast shared-memory streaming multilevel graph partitioning.
J. Parallel Distributed Comput., 2021

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications.
Int. J. High Perform. Comput. Appl., 2021

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

Distributed-memory parallel algorithms for sparse times tall-skinny-dense matrix multiplication.
Proceedings of the ICS '21: 2021 International Conference on Supercomputing, 2021

2020
The Parallelism Motifs of Genomic Data Analysis.
CoRR, 2020

ADEPT: a domain independent sequence alignment strategy for gpu architectures.
BMC Bioinform., 2020

Distributed many-to-many protein sequence alignment using sparse matrices.
Proceedings of the International Conference for High Performance Computing, 2020

A High-Throughput Solver for Marginalized Graph Kernels on GPU.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Optimizing High Performance Markov Clustering for Pre-Exascale Architectures.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Considerations for a Distributed GraphBLAS API.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, 2020

2019
Locality-aware and load-balanced static task scheduling for MapReduce.
Future Gener. Comput. Syst., 2019

Regularizing irregularly sparse point-to-point communications.
Proceedings of the International Conference for High Performance Computing, 2019

2018
Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication.
ACM Trans. Parallel Comput., 2018

Optimizing nonzero-based sparse matrix partitioning models via reducing latency.
J. Parallel Distributed Comput., 2018

2017
A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously.
IEEE Trans. Parallel Distributed Syst., 2017

Addressing Volume and Latency Overheads in 1D-parallel Sparse Matrix-Vector Multiplication.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017

2016
Parallelization of Sparse Matrix Kernels for Big Data Applications.
Proceedings of the Resource Management for Big Data Platforms, 2016

Latency-centric models and methods for scaling sparse operations (Seyrek işlemlerin ölçeklenebilmesi için gecikim-merkezli model ve yöntemler)
PhD thesis, 2016

Reducing latency cost in 2D sparse matrix partitioning models.
Parallel Comput., 2016

Improving performance of sparse matrix dense matrix multiplication on large-scale parallel systems.
Parallel Comput., 2016

2015
A Novel Method for Scaling Iterative Solvers: Avoiding Latency Overhead of Parallel Sparse-Matrix Vector Multiplies.
IEEE Trans. Parallel Distributed Syst., 2015

2014
Temporal Workload-Aware Replicated Partitioning for Social Networks.
IEEE Trans. Knowl. Data Eng., 2014

2012
Replicated partitioning for undirected hypergraphs.
J. Parallel Distributed Comput., 2012


  Loading...