About: Distributed algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Distributed algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.

Attributes	Values
rdf:type	software
rdfs:label	Distributed algorithm (en)
rdfs:comment	A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation. (en)
sameAs	Distributed algorithm Distributed algorithm
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Commonscatinline dbt:Reflist dbt:Doi-inline
Subject	Distributed algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Distributed_algorithm?oldid=1055323579&ns=0
Wikipage page ID	3367202 (xsd:integer)
page length (characters) of wiki page	5370 (xsd:nonNegativeInteger)
Wikipage revision ID	1055323579 (xsd:integer)
Link from a Wikipage to another Wikipage	Non-blocking algorithm Process control Algorithm Atomic commit Raft (algorithm) Three-phase commit protocol Two-phase commit protocol Distributed algorithms Central processing unit Distributed computing Mutual exclusion Search algorithm Terminating Reliable Broadcast Computational science Computer hardware Concurrency (computer science) Consensus (computer science) Parallel algorithm Spanning tree Graph coloring Telecommunications Information processing Inter-process communication Paxos (computer science) Leader election Replication (computing) Resource allocation
has abstract	A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in different application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation. Distributed algorithms are a sub-type of parallel algorithm, typically executed concurrently, with separate parts of the algorithm being run simultaneously on independent processors, and having limited information about what the other parts of the algorithm are doing. One of the major challenges in developing and implementing distributed algorithms is successfully coordinating the behavior of the independent parts of the algorithm in the face of processor failures and unreliable communications links. The choice of an appropriate distributed algorithm to solve a given problem depends on both the characteristics of the problem, and characteristics of the system the algorithm will run on such as the type and probability of processor or link failures, the kind of inter-process communication that can be performed, and the level of timing synchronization between separate processes. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Distributed_algorithm
is Wikipage redirect of	Distributed algorithms
is Link from a Wikipage to another Wikipage of	Folded cube graph List of terms relating to algorithms and data structures Distributed minimum spanning tree Aiichiro Nakano Alessandra Sala Algorithm Brigitte Plateau Brooks–Iyengar algorithm Cal Newport Cannon's algorithm James Aspnes Dijkstra Prize Distributed algorithms Distributed computing Distributed constraint optimization Hirschberg–Sinclair algorithm Deadlock Deadlock prevention algorithms Hybrid algorithm Linda Pagli Mohol programming languages List of academic fields List of algorithms Michael Luby Michel Raynal Daniela L. Rus Friedemann Mattern Google Code Jam Graph coloring International Conference on Information Processing in Sensor Networks Kőnig's theorem (graph theory) Matching preclusion Maximal independent set Multi-trials technique
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Distributed_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software