Multi-trials technique (original) (raw)
The multi-trials technique by Schneider et al. is employed for distributed algorithms and allows breaking of symmetry efficiently. Symmetry breaking is necessary, for instance, in resource allocation problems, where many entities want to access the same resource concurrently. Many message passing algorithms typically employ one attempt to break symmetry per message exchange. The multi-trials technique transcends this approach through employing more attempts with every message exchange.
| Property | Value |
|---|---|
| dbo:abstract | The multi-trials technique by Schneider et al. is employed for distributed algorithms and allows breaking of symmetry efficiently. Symmetry breaking is necessary, for instance, in resource allocation problems, where many entities want to access the same resource concurrently. Many message passing algorithms typically employ one attempt to break symmetry per message exchange. The multi-trials technique transcends this approach through employing more attempts with every message exchange. For example, in a simple algorithm for computing an O(Δ) vertex coloring, where Δ denotes the maximum degree in the graph, every uncolored node randomly picks an available color and keeps it if no neighbor (concurrently) chooses the same color. For the multi-trials technique, a node gradually increases the number of chosen colors in every communication round. The technique can yield more than an exponential reduction in the required communication rounds. However, if the maximum degree Δ is small more efficient techniques exist, e.g. the (extended) coin-tossing technique by Richard Cole and Uzi Vishkin. (en) |
| dbo:wikiPageExternalLink | https://www.tik.ee.ethz.ch/file/2be1291694b1730bba83f7fa18d9e0f2/podc08SW.pdf https://www.tik.ee.ethz.ch/file/22a700b74fc2f37acb56d690e62c86cf/podcfp107_schneider_188.pdf |
| dbo:wikiPageID | 29722894 (xsd:integer) |
| dbo:wikiPageLength | 2011 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 985764205 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Message_passing dbc:Graph_coloring dbc:Graph_theory dbc:Computational_problems_in_graph_theory dbr:Uzi_Vishkin dbr:Distributed_algorithms dbr:Symposium_on_Principles_of_Distributed_Computing dbr:Vertex_coloring |
| dbp:wikiPageUsesTemplate | dbt:Citation dbt:Reflist |
| dct:subject | dbc:Graph_coloring dbc:Graph_theory dbc:Computational_problems_in_graph_theory |
| rdf:type | yago:WikicatComputationalProblemsInGraphTheory yago:WikicatNP-completeProblems yago:Abstraction100002137 yago:Attribute100024264 yago:Condition113920835 yago:Difficulty114408086 yago:Problem114410605 yago:State100024720 |
| rdfs:comment | The multi-trials technique by Schneider et al. is employed for distributed algorithms and allows breaking of symmetry efficiently. Symmetry breaking is necessary, for instance, in resource allocation problems, where many entities want to access the same resource concurrently. Many message passing algorithms typically employ one attempt to break symmetry per message exchange. The multi-trials technique transcends this approach through employing more attempts with every message exchange. (en) |
| rdfs:label | Multi-trials technique (en) |
| owl:sameAs | freebase:Multi-trials technique yago-res:Multi-trials technique wikidata:Multi-trials technique https://global.dbpedia.org/id/4s1FX |
| prov:wasDerivedFrom | wikipedia-en:Multi-trials_technique?oldid=985764205&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Multi-trials_technique |
| is dbo:wikiPageRedirects of | dbr:Multi-Trials_technique |
| is dbo:wikiPageWikiLink of | dbr:Graph_coloring dbr:Multi-Trials_technique |
| is foaf:primaryTopic of | wikipedia-en:Multi-trials_technique |