49 Result(s)

Chapter and Conference Paper

Locally Balanced Allocations Under Strong Byzantine Influence

The Power of Two Choices (PoTC) is a commonly used technique to balance the incoming load (balls) into available resources (bins) – for each coming ball, two bins are selected uniformly at random and the one w...

Costas Busch, Paweł Garncarek… in Structural Information and Communication C… (2024)

Chapter and Conference Paper

Stable Scheduling in Transactional Memory

We study computer systems with transactions executed on a set of shared objects. Transactions arrive continually subjects to constrains that are framed as an adversarial model and impose limits on the average ...

Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski… in Algorithms and Complexity (2023)

Chapter and Conference Paper

Lockless Blockchain Sharding with Multiversion Control

Sharding is used to address the performance and scalability issues of the blockchain protocols, which divides the overall transaction processing costs among multiple clusters of nodes. Shards require less stor...

Ramesh Adhikari, Costas Busch in Structural Information and Communication Complexity (2023)

Article

Dynamic scheduling in distributed transactional memory

We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the obj...

Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma in Distributed Computing (2022)

Chapter and Conference Paper

Flexible Scheduling of Transactional Memory on Trees

We study the efficiency of executing transactions in a distributed transactional memory system. The system is modeled as a wired network with the topology of a tree. Contrary to previous approaches, we allow t...

Costas Busch, Bogdan S. Chlebus… in Stabilization, Safety, and Security of Dis… (2022)

Article

Fast Scheduling in Distributed Transactional Memory

We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the obj...

Costas Busch, Maurice Herlihy, Miroslav Popovic… in Theory of Computing Systems (2021)

Chapter and Conference Paper

An Experimental Evaluation of BFT Protocols for Blockchains

Byzantine Fault Tolerant (BFT) protocols have been used in blockchains due to their high performance and fast block acceptance

Mohammad M. Jalalzai, Golden Richard III, Costas Busch in Blockchain – ICBC 2019 (2019)

Chapter and Conference Paper

Complete Visibility for Oblivious Robots in \(\mathcal{O}(N)\) Time

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles following the classic oblivious robots model. We study the fundamental problem where starting from an arb...

Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay in Networked Systems (2019)

Chapter and Conference Paper

CUDA-DTM: Distributed Transactional Memory for GPU Clusters

We present CUDA-DTM, the first ever Distributed Transactional Memory framework written in CUDA for large scale GPU clusters. Transactional Memory has become an attractive auto-coherence scheme for GPU applica...

Samuel Irving, Sui Chen, Lu Peng, Costas Busch, Maurice Herlihy… in Networked Systems (2019)

Article

Time-communication impossibility results for distributed transactional memory

We consider scheduling problems in the data flow model of distributed transactional memory. Objects shared by transactions move from one network node to another by following network paths. We examine how the o...

Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma in Distributed Computing (2018)

Chapter and Conference Paper

Load Balanced Distributed Directories

We present LB-Spiral, a novel distributed directory protocol for shared objects, suitable for large-scale distributed shared memory systems. Each shared object has an owner node that can modify its value. The own...

Shishir Rai, Gokarna Sharma, Costas Busch… in Stabilization, Safety, and Security of Dis… (2018)

Reference Work Entry In depth

Direct Routing Algorithms

Costas Busch in Encyclopedia of Algorithms (2016)

Chapter and Conference Paper

Complete Visibility for Robots with Lights in O(1) Time

We consider the problem of repositioning N autonomous robots on a plane so that each robot is visible to all others (the Complete Visibility problem); a robot cannot see another robot if its visibility is obstruc...

Gokarna Sharma, Ramachandran Vaidyanathan… in Stabilization, Safety, and Security of Dis… (2016)

Article

An Analysis Framework for Distributed Hierarchical Directories

We provide a novel analysis framework for distributed hierarchical directories for an arbitrary set of dynamic (online) requests. We first present a generic algorithm for implementing a distributed directory t...

Gokarna Sharma, Costas Busch in Algorithmica (2015)

Chapter and Conference Paper

Mutual Visibility with an Optimal Number of Colors

We consider the following fundamental Mutual Visibility problem: Given a set of n identical autonomous point robots in arbitrary distinct positions in the Euclidean plane, find a schedule to move them such that w...

Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay in Algorithms for Sensor Systems (2015)

Article

Distributed transactional memory for general networks

We consider the problem of implementing transactional memory in large-scale distributed networked systems. We present Spiral, a novel distributed directory-based protocol for transactional memory, and theoretical...

Gokarna Sharma, Costas Busch in Distributed Computing (2014)

Article

Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor

We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the γ-neighborhood of each node. For planar graphs, the ...

Costas Busch, Ryan LaFortune, Srikanta Tirthapura in Algorithmica (2014)

Chapter and Conference Paper

Optimal Nearest Neighbor Queries in Sensor Networks

Given a set of \(m\) m mobile objec...

Gokarna Sharma, Costas Busch in Algorithms for Sensor Systems (2014)

Chapter and Conference Paper

An Analysis Framework for Distributed Hierarchical Directories

We provide a novel analysis framework for distributed hierarchical directories for an arbitrary set of dynamic (online) requests. We prove a general ...

Gokarna Sharma, Costas Busch in Distributed Computing and Networking (2013)