arrow
Return

Supervised Distributed Computing

delete2026-01-01
delete0
PRE
AI
J
John Augustine
C
Christian Scheideler
J
Julian Werthmann *
DOI:10.1007/978-3-031-99872-0_4delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We introduce a new framework for distributed computing that extends and refines the standard master-worker approach of scheduling multi-threaded computations. In this framework, there are different roles: a supervisor, a source, a target, and a collection of workers. Initially, the source stores some instance.I of a computational problem, and at the end, the target is supposed to store a correct solution S(I) for that instance. We assume that the computation required for S(I) can be modeled as a directed acyclic graph G = (V, E), where V is a set of tasks and (v, omega) is an element of E if and only if task.w needs information from task.v in order to be executed. Given G, the role of the supervisor is to schedule the execution of the tasks in.G by assigning them to the workers. If all workers are honest, information can be exchanged between the workers, and the workers have access to the source and target, the supervisor only needs to know.G to successfully schedule the computations. I.e., the supervisor does not have to handle any data itself like in standard master-worker approaches, which has the tremendous benefit that tasks can be run massively in parallel in large distributed environments without the supervisor becoming a bottleneck. But what if a constant fraction of the workers is adversarial? Interestingly, we show that under certain assumptions a data-agnostic scheduling approach would even work in an adversarial setting without (asymptotically) increasing the work required for communication and computations. We demonstrate the validity of these assumptions by presenting concrete solutions for supervised matrix multiplication and sorting.
Keywords:
Distributed Computing
Fault Tolerance
Peer-to-peer Networks

Journal

E
EURO-PAR 2025: PARALLEL PROCESSING, PT III
IF:
0
Papers:
21
Citations:
0

Organization

I
indian institute of technology (iit) - madras
Scholars:
5.1K
Papers: 5.2K
Citations: 1
I
indian institute of technology system (iit system)
Scholars:
9.5W
Papers: 9.9W
Citations: 93
Cited Papers

Cited Papers

Making Chord Robust to Byzantine Attacks
err2005-01-01
err0
PREAI
errAmos Fiat; Jared Saia; Maxwell Young
errShare
errSave
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
Reaching Agreement in the Presence of Faults
err1980-04-01
err0
errOAAI
errM. Pease; R. Shostak; L. Lamport
errShare
errSave
err2007-01-01
err0
errOAAI
errAmos Fiat; Jared Saia
errShare
errSave
Certifying algorithms
err2011-05-01
err0
PREAI
errR.M. McConnell; K. Mehlhorn; S. Näher; P. Schweitzer
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms
err2024-01-12
err14
errOAAI
errZhang, Gengrui; Pan, Fei; Mao, Yunhao; Tijanic, Sofia; Dang'Ana, Michael; Motepalli, Shashank; Zhang, Shiquan; Jacobsen, Hans-Arno
errShare
errSave
researcher View more