23 citations · 67 across the 9 of their papers we have counts for
6 papers · 1 filter
Scalable Byzantine Fault Tolerance via Partial Decentralization
Balaji Arun, Binoy Ravindran
Byzantine consensus is a critical component in many permissioned Blockchains and distributed ledgers. We propose a new paradigm for designing BFT protocols called DQBFT that addres…
Xar-Trek: Run-time Execution Migration among FPGAs and Heterogeneous-ISA CPUs
Edson Horta, Ho-Ren Chuang, Naarayanan Rao VSathish +4
Datacenter servers are increasingly heterogeneous: from x86 host CPUs, to ARM or RISC-V CPUs in NICs/SSDs, to FPGAs. Previous works have demonstrated that migrating application exe…
Crystalline: Fast and Memory Efficient Wait-Free Reclamation
Ruslan Nikolaev, Binoy Ravindran
Historically, memory management based on lock-free reference counting was very inefficient, especially for read-dominated workloads. Thus, approaches such as epoch-based reclamatio…
Universal Wait-Free Memory Reclamation
Ruslan Nikolaev, Binoy Ravindran
In this paper, we present a universal memory reclamation scheme, Wait-Free Eras (WFE), for deleted memory blocks in wait-free concurrent data structures. WFE's key innovation is th…
ezBFT: Decentralizing Byzantine Fault-Tolerant State Machine Replication
Balaji Arun, Sebastiano Peluso, Binoy Ravindran
We present ezBFT, a novel leaderless, distributed consensus protocol capable of tolerating byzantine faults. ezBFT's main goal is to minimize the client-side latency in WAN deploym…
Spectrum: A Framework for Adapting Consensus Protocols
Balaji Arun, Sebastiano Peluso, Binoy Ravindran
There exists a plethora of consensus protocols in literature. The reason is that there is no one-size-fits-all solution, since every protocol is unique and its performance is direc…