skip to main content
10.1145/3584684acmconferencesBook PagePublication PagespodcConference Proceedingsconference-collections
ApPLIED 2023: Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
ACM2023 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ApPLIED 2023: 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems Orlando FL USA 19 June 2023
ISBN:
979-8-4007-0128-3
Published:
20 June 2023
Sponsors:
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 03 Mar 2025Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
SESSION: Keynote and Invited Papers
keynote
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 ...

research-article
Open Access
Invited Paper: Common Public Knowledge for Enhancing Machine Learning Data Sets
Article No.: 2, Pages 1–10https://doi.org/10.1145/3584684.3597263

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 ...

research-article
Open Access
Invited Paper: Lessons from HotStuff
Article No.: 3, Pages 1–8https://doi.org/10.1145/3584684.3597268

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 ...

research-article
Invited Paper: Disaggregating Applications Using Uniservices
Article No.: 4, Pages 1–10https://doi.org/10.1145/3584684.3597271

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 ...

research-article
Open Access
Invited Paper: Initial Steps Toward a Compiler for Distributed Programs
Article No.: 5, Pages 1–10https://doi.org/10.1145/3584684.3597272

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, ...

research-article
Invited Paper: Oblivious Transfer Protocol without Physical Transfer of Hardware Root-of-Trust
Article No.: 6, Pages 1–9https://doi.org/10.1145/3584684.3597273

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 ...

SESSION: Invited Short Papers
research-article
Open Access
Invited Paper: ServerFilling: A better approach to packing multiserver jobs
Article No.: 7, Pages 1–5https://doi.org/10.1145/3584684.3597264

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, ...

research-article
Open Access
Invited Paper: Towards Efficient Microservice Communication
Article No.: 8, Pages 1–5https://doi.org/10.1145/3584684.3597267

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 ...

research-article
Invited Paper: Planetary Scale Byzantine Consensus
Article No.: 9, Pages 1–6https://doi.org/10.1145/3584684.3597270

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 ...

research-article
Open Access
Invited Paper: Enhancing Privacy in Federated Learning via Early Exit
Article No.: 10, Pages 1–5https://doi.org/10.1145/3584684.3597274

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 ...

SESSION: Peer-Reviewed Papers
research-article
An Extensible Framework for Implementing and Validating Byzantine Fault-Tolerant Protocols
Article No.: 11, Pages 1–10https://doi.org/10.1145/3584684.3597266

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. ...

research-article
Public Access
Specification and Runtime Checking of Derecho, A Protocol for Fast Replication for Cloud Services
Article No.: 12, Pages 1–10https://doi.org/10.1145/3584684.3597275

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 ...

SESSION: Peer-Reviewed Short Research Statements
research-article
Open Access
Performance of EdDSA and BLS Signatures in Committee-Based Consensus
Article No.: 13, Pages 1–5https://doi.org/10.1145/3584684.3597265

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 ...

research-article
Open Access
ParSwarm: A C++ Framework for Evaluating Distributed Algorithms for Robot Swarms
Article No.: 14, Pages 1–5https://doi.org/10.1145/3584684.3597269

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 ...

Contributors
  • Chalmers University of Technology

Recommendations

Acceptance Rates

Overall Acceptance Rate 3 of 4 submissions, 75%
YearSubmittedAcceptedRate
ApPLIED '184375%
Overall4375%