Export Citations
No abstract available.
Proceeding Downloads
Persistent Control Plane for a Global Cloud - from an AbstractAlgorithm to a Deployed Service
The LTN cloud is a specialized global cloud providing real-time, broadcast-quality video transport and processing services supporting diverse workflows for the media industry (www.ltnglobal.com). The system is governed by a persistent control plane ...
Invited Paper: Common Public Knowledge for Enhancing Machine Learning Data Sets
In this study, we show the advantages of incorporating multi-source knowledge from publicly available sources, such as ChatGPT and Wikipedia, into existing datasets to enhance the performance of machine learning models for routine tasks, such as ...
Invited Paper: Lessons from HotStuff
This article will take you on a journey to the core of blockchains, their Byzantine consensus engine, where HotStuff emerged as a new algorithmic foundation for the classical Byzantine generals consensus problem. The first part of the article ...
Invited Paper: Disaggregating Applications Using Uniservices
The current method for building software infrastructure in disaggregated data centers involves creating new virtual machine monitors or operating system kernels that make the underlying hardware appear as a group of logical servers. Although this ...
Invited Paper: Initial Steps Toward a Compiler for Distributed Programs
In the Hydro project we are designing a compiler toolkit that can optimize for the concerns of distributed systems, including scale-up and scale-down, availability, and consistency of outcomes across replicas. This invited paper overviews the project, ...
Invited Paper: Oblivious Transfer Protocol without Physical Transfer of Hardware Root-of-Trust
Oblivious Transfer (OT) protocol is nowadays recognised as a generic primitive for all cryptographic protocols since it is one of the strongest primitives for secure multiparty computation (MPC). To design hardware-assisted OT protocols, Physically ...
Invited Paper: ServerFilling: A better approach to packing multiserver jobs
Ever since the advent of "multiserver jobs" (jobs that require more than one server or core simultaneously), practitioners have been faced with the question of how to pack these jobs into a compute cluster. While many policies have been proposed, ...
Invited Paper: Towards Efficient Microservice Communication
Distributed applications on the cloud are being developed and deployed as microservices as opposed to the monolithic architecture. Service Meshes have emerged as a way of specifying communication policies between microservices. Service Meshes have the ...
Invited Paper: Planetary Scale Byzantine Consensus
Byzantine fault tolerant consensus protocols are implemented with consecutive broadcasts but suffer from a low throughput at large geographical scale or planetary scale. A reason for this inefficiency is believed to be their all-to-all communication ...
Invited Paper: Enhancing Privacy in Federated Learning via Early Exit
In this paper, we investigate the interplay between early exit mechanisms in deep neural networks and privacy preservation in the context of federated learning. Our primary objective is to assess how early exits impact privacy during the learning and ...
An Extensible Framework for Implementing and Validating Byzantine Fault-Tolerant Protocols
HotStuff is a Byzantine fault-tolerant state machine replication protocol that incurs linear communication costs to achieve consensus. This linear scalability promoted the protocol to be adopted as the consensus mechanism in permissioned blockchains. ...
Specification and Runtime Checking of Derecho, A Protocol for Fast Replication for Cloud Services
Reliable distributed systems require replication and consensus among distributed processes to tolerate process and communication failures. Understanding and assuring the correctness of protocols for replication and consensus have been a significant ...
Performance of EdDSA and BLS Signatures in Committee-Based Consensus
We present the first performance comparison of EdDSA and BLS signatures in committee-based consensus protocols through large-scale geo-distributed benchmarks. Contrary to popular beliefs, we find that small deployments (less than 40 validators) can ...
ParSwarm: A C++ Framework for Evaluating Distributed Algorithms for Robot Swarms
Due to the increasing complexity of robot swarm algorithms, analyzing their performance theoretically is often very difficult. Instead, simulators are often used to benchmark the performance of robot swarm algorithms. However, we are not aware of ...
Cited By
- Nair A, Kumar S, Prasad A, Huang Y, Rudoff A and Subramoney S Telescope Proceedings of the 2024 USENIX Conference on Usenix Annual Technical Conference, (409-424)
- Li J, Chen J, Liu J and Ma H Learning a Graph Neural Network with Cross Modality Interaction for Image Fusion Proceedings of the 31st ACM International Conference on Multimedia, (4471-4479)
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
ApPLIED '18 | 4 | 3 | 75% |
Overall | 4 | 3 | 75% |