Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

M. R. Siavash Katebzadeh

dblp:259/0319 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0003-4096-2346ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 82% Cloud and datacenter computing · 18%
Computer networks
1 paper
Datacenter networks · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
consensus
0.412020
Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol · ASPLOS 2020
Distributed systems
replication
0.412020
Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol · ASPLOS 2020
Cloud and datacenter computing
datacenter workloads
0.212023
Saba: Rethinking Datacenter Network Allocation from Application's Perspective · EuroSys 2023

Methods — techniques the papers use, named apart from their topics

max-min fairness · 1.3replication protocol design · 0.4
YearPublicationVenuePosition
2023 Saba: Rethinking Datacenter Network Allocation from Application's Perspective
abstract
Today's datacenter workloads increasingly comprise distributed data-intensive applications, including data analytics, graph processing, and machine-learning training. These applications are bandwidth-hungry and often congest the datacenter network, resulting in poor network performance, which hurts application completion time. Efforts made to address this problem generally aim to achieve max-min fairness at the flow or application level. We observe that splitting the bandwidth equally among workloads is sub-optimal for aggregate application-level performance because various workloads exhibit different sensitivity to network bandwidth: for some workloads, even a small reduction in the available bandwidth yields a significant increase in completion time; for others, the completion time is largely insensitive to the available bandwidth.
M. R. Siavash Katebzadeh, Paolo Costa, Boris Grot
EuroSys1
2020 Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol
abstract
Today's datacenter applications are underpinned by datastores that are responsible for providing availability, consistency, and performance. For high availability in the presence of failures, these datastores replicate data across several nodes. This is accomplished with the help of a reliable replication protocol that is responsible for maintaining the replicas strongly-consistent even when faults occur. Strong consistency is preferred to weaker consistency models that cannot guarantee an intuitive behavior for the clients. Furthermore, to accommodate high demand at real-time latencies, datastores must deliver high throughput and low latency.
Antonios Katsarakis, Vasilis Gavrielatos, M. R. Siavash Katebzadeh, Arpit Joshi, Aleksandar Dragojevic, Boris Grot, Vijay Nagarajan
ASPLOS3
2020 Evaluation of an InfiniBand Switch: Choose Latency or Bandwidth, but Not Both
abstract
Today's cloud datacenters feature a large number of concurrently executing applications with diverse intradatacenter latency and bandwidth requirements. To remove the network as a potential performance bottleneck, datacenter operators have begun deploying high-end HPC-grade networks, such as InfiniBand (IB), which offer fully offloaded network stacks, remote direct memory access (RDMA) capability, and non-discarding links. While known to provide both low latency and high bandwidth for a single application, it is not clear how well such networks accommodate a mix of latencyand bandwidth-sensitive traffic that is likely in a real-world deployment. As a step toward answering this question, we develop a performance measurement tool for RDMA-based networks, RPerf, that is capable of precisely measuring the IB switch performance without hardware support. Using RPerf, we benchmark a rack-scale IB cluster in isolated and mixedtraffic scenarios. Our key finding is that the evaluated switch can provide either low latency or high bandwidth, but not both simultaneously in a mixed-traffic scenario. We evaluate several options to improve the latency-bandwidth trade-off and demonstrate that none are ideal.
M. R. Siavash Katebzadeh, Paolo Costa, Boris Grot
ISPASS1