{"id":"https://openalex.org/W7165779183","doi":"https://doi.org/10.4230/lipics.sand.2026.2","title":"Supervised Distributed Computing (Invited Talk)","display_name":"Supervised Distributed Computing (Invited Talk)","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165779183","doi":"https://doi.org/10.4230/lipics.sand.2026.2"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26236","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.2/LIPIcs.SAND.2026.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.2/LIPIcs.SAND.2026.2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063355098","display_name":"Christian Scheideler","orcid":"https://orcid.org/0000-0002-5278-528X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Scheideler, Christian","raw_affiliation_strings":["Department of Computer Science, Paderborn University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5278-528X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Paderborn University, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063355098"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67709085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.19169999659061432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.19169999659061432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.07699999958276749,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.06800000369548798,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/supervisor","display_name":"Supervisor","score":0.8001999855041504},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5478000044822693},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4699999988079071},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42890000343322754},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.42309999465942383},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.40700000524520874},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.39989998936653137}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8180000185966492},{"id":"https://openalex.org/C2779110517","wikidata":"https://www.wikidata.org/wiki/Q1240788","display_name":"Supervisor","level":2,"score":0.8001999855041504},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5665000081062317},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5478000044822693},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4699999988079071},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3928000032901764},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3671000003814697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36419999599456787},{"id":"https://openalex.org/C3739613","wikidata":"https://www.wikidata.org/wiki/Q679003","display_name":"Distributed Computing Environment","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.31380000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26236","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.2/LIPIcs.SAND.2026.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.2","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26236","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.2","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.2/LIPIcs.SAND.2026.2.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"score":0.5681090950965881,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165779183.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"I":[0,49,224],"will":[1,225],"introduce":[2],"a":[3,32,34,36,39,51,64,83,93,212,231],"new":[4],"framework":[5],"for":[6,68,77,254],"distributed":[7,11,206],"computing":[8,12],"called":[9],"supervised":[10],"that":[13,69,73,196,227,262],"extends":[14],"and":[15,38,54,97,102,152,154],"refines":[16],"the":[17,44,56,58,74,119,122,127,130,138,145,150,161,163,173,176,193,209,219,243,251,255,260],"standard":[18,188],"master-worker":[19,189],"approach":[20,234],"of":[21,41,50,95,121,129,218,245,269],"scheduling":[22,233],"multi-threaded":[23],"computations.":[24,174],"In":[25],"this":[26],"framework,":[27],"there":[28],"are":[29,143,221,265],"different":[30],"roles:":[31],"supervisor,":[33],"source,":[35],"target,":[37,153],"collection":[40],"workers.":[42,139],"Initially,":[43],"source":[45,151],"stores":[46],"some":[47,217],"instance":[48],"computational":[52],"problem,":[53],"at":[55],"end,":[57],"target":[59],"is":[60,92,124,247],"supposed":[61],"to":[62,114,125,137,149,167,170,181,259],"store":[63],"correct":[65],"solution":[66],"S(I)":[67,78],"instance.":[70],"We":[71],"assume":[72],"computation":[75],"required":[76],"can":[79,156,198,272],"be":[80,115,157,199,273],"modeled":[81],"as":[82],"directed":[84],"acyclic":[85],"graph":[86],"G":[87,133,169],"=":[88],"(V,E),":[89],"where":[90,242],"V":[91],"set":[94],"tasks":[96,131,197],"(v,w)":[98],"\u2208":[99],"E":[100],"if":[101,104,216],"only":[103,165],"task":[105,110],"w":[106],"needs":[107,166],"information":[108,155],"from":[109],"v":[111],"in":[112,132,187,202,204,238,275],"order":[113],"executed.":[116],"Given":[117],"G,":[118],"role":[120],"supervisor":[123,164,177,210],"schedule":[126,172],"execution":[128],"by":[134],"assigning":[135],"them":[136],"If":[140],"all":[141,263],"workers":[142,146,220,246,257,264],"honest,":[144],"have":[147,180],"access":[148],"exchanged":[158],"directly":[159],"between":[160],"workers,":[162],"know":[168],"successfully":[171],"I.e.,":[175],"does":[178],"not":[179],"handle":[182],"any":[183],"data":[184],"itself":[185],"like":[186],"approaches,":[190],"which":[191],"has":[192],"tremendous":[194],"benefit":[195],"run":[200],"massively":[201],"parallel":[203],"large":[205],"environments":[207],"without":[208],"becoming":[211],"bottleneck.":[213],"But":[214],"what":[215],"adversarial?":[222],"Interestingly,":[223],"show":[226],"under":[228],"certain":[229],"assumptions":[230],"data-agnostic":[232],"would":[235],"even":[236],"work":[237,252],"an":[239],"adversarial":[240,248],"setting":[241],"majority":[244],"while":[249],"keeping":[250],"overhead":[253],"honest":[256],"close":[258],"case":[261],"honest.":[266],"The":[267],"details":[268],"our":[270],"results":[271],"found":[274],"[John":[276],"Augustine":[277,282],"et":[278,283],"al.,":[279,284],"2026;":[280],"John":[281],"2025]":[285]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-06-25T00:00:00"}