33 Result(s)
within
Conference Paper
Costas Busch
-
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...
-
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 ...
-
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...
-
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...
-
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
-
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...
-
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...
-
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...
-
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...
-
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...
-
Chapter and Conference Paper
Optimal Nearest Neighbor Queries in Sensor Networks
Given a set of \(m\) m mobile objec...
-
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 ...
-
Chapter and Conference Paper
Stretch in Bottleneck Games
In bottleneck congestion games the social cost is the worst congestion (bottleneck) on any resource, and each player selfishly minimizes the worst resource congestion in its strategy. We examine the price of a...
-
Chapter and Conference Paper
Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories
Distributed hierarchical directories are data structures that enable one to access shared objects whenever needed. These directories are used to implement fundamental coordination problems in distributed syste...
-
Chapter and Conference Paper
Bottleneck Routing Games on Grids
We consider routing games on grid network topologies. The social cost is the worst congestion in any of the network edges (bottleneck congestion). Each player’s objective is to find a path that minimizes the b...
-
Chapter and Conference Paper
Towards Load Balanced Distributed Transactional Memory
We consider the problem of implementing transactional memory in d-dimensional mesh networks. We present and analyze MultiBend, a novel load balanced directory-based protocol, which is designed for the data-flow d...
-
Chapter and Conference Paper
Optimal Oblivious Routing in Hole-Free Networks
We study oblivious routing algorithms in which the packet paths are constructed independently of each other. Oblivious algorithms are inherently distributed and they can be designed to efficiently balance the ...
-
Chapter and Conference Paper
Optimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games
We introduce (super) polynomial bottleneck games, where the utility costs of the players are (super) polynomial functions of the congestion of the resources that they use, and the social cost is determined by the...
-
Chapter and Conference Paper
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of demands can be routed along t...
-
Chapter and Conference Paper
Bottleneck Congestion Games with Logarithmic Price of Anarchy
We study bottleneck congestion games where the social cost is determined by the worst congestion on any resource. In the literature, bottleneck games assume player utility costs determined by the worst congested ...
