Searches , social queries for DISTRIBUTED ALGORITHM
Search references for DISTRIBUTED ALGORITHM. Phrases containing DISTRIBUTED ALGORITHM
See searches and references containing DISTRIBUTED ALGORITHM!
Search references for DISTRIBUTED ALGORITHM. Phrases containing DISTRIBUTED ALGORITHM
See searches and references containing DISTRIBUTED ALGORITHM!DISTRIBUTED ALGORITHM
Algorithm run on hardware built from interconnected processors
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used
Distributed_algorithm
System with multiple networked computers
message passing. The word distributed in terms such as "distributed system", "distributed programming", and "distributed algorithm" originally referred to
Distributed_computing
Algorithm used in distributed computing
The Chandy–Lamport algorithm is a snapshot algorithm that is used in distributed systems for recording a consistent global state of an asynchronous system
Chandy–Lamport_algorithm
iterations Gale–Shapley algorithm: solves the stable matching problem Pseudorandom number generators (uniformly distributed—see also List of pseudorandom
List_of_algorithms
Consensus algorithm
Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means
Raft_(algorithm)
Algorithm used by Google Search to rank web pages.
PageRank (PR) is an algorithm used by Google Search to rank web pages in their search engine results. It is named after both the term "web page" and co-founder
PageRank
Family of protocols for solving consensus
machine replication is a technique for converting an algorithm into a fault-tolerant, distributed implementation. Ad-hoc techniques may leave important
Paxos_(computer_science)
Methodic assignment of colors to elements of a graph
the distributed edge coloring problem as well. Decentralized algorithms are ones where no message passing is allowed (in contrast to distributed algorithms
Graph_coloring
Computer science transaction algorithm
commitment protocol (ACP). It is a distributed algorithm that coordinates all the processes that participate in a distributed atomic transaction on whether
Two-phase_commit_protocol
Distributed algorithm
In computer networking and distributed databases, the three-phase commit protocol (3PC) is a distributed algorithm that ensures all nodes in a system
Three-phase_commit_protocol
Sequence of operations for a task
In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is any well-defined set of instructions that when followed terminates after a finite
Algorithm
Lamport's Distributed Mutual Exclusion Algorithm is a contention-based algorithm for mutual exclusion on a distributed system. Every process maintains
Lamport's distributed mutual exclusion algorithm
Lamport's_distributed_mutual_exclusion_algorithm
Algorithm that arranges lists in order
In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order
Sorting_algorithm
Mechanism for capturing chronological and causal relationships
in a distributed system. Often, distributed systems may have no physically synchronous global clock. In many applications (such as distributed GNU make)
Logical_clock
must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is minimized. Distributed Constraint
Distributed constraint optimization
Distributed_constraint_optimization
Algorithm for mutual exclusion on a distributed system
Ricart–Agrawala algorithm is an algorithm for mutual exclusion on a distributed system. This algorithm is an extension and optimization of Lamport's Distributed Mutual
Ricart–Agrawala_algorithm
Algorithm used to determine the order of events in a distributed computer system
The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different
Lamport_timestamp
high-performance distributed web crawler". Jia, Lujun; Rajaraman, Rajmohan; Suel, Torsten (2002). "An efficient distributed algorithm for constructing
Torsten_Suel
Algorithm to multiply matrices
Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where
Matrix multiplication algorithm
Matrix_multiplication_algorithm
Method for electing a coordinator in distributed computing
In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes
Bully_algorithm
Algorithm which can do multiple operations in a given time
as crash failures or Byzantine failures. Distributed algorithms have many practical applications in distributed databases, fault-tolerance systems, and
Parallel_algorithm
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where
Distributed minimum spanning tree
Distributed_minimum_spanning_tree
Distributed algorithmic mechanism design (DAMD) is an extension of algorithmic mechanism design. DAMD differs from Algorithmic mechanism design since the
Distributed algorithmic mechanism design
Distributed_algorithmic_mechanism_design
Type of distributed algorithm
A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Suomela, Jukka (2013). "Survey of Local
Local_algorithm
Data synchronised across multiple sites
A distributed ledger (also called a shared ledger or distributed ledger technology or DLT) is a system whereby replicated, shared, and synchronized digital
Distributed_ledger
The Chang and Roberts algorithm is a ring-based coordinator election algorithm, employed in distributed computing. It was initially published by Ernest
Chang_and_Roberts_algorithm
Topics referred to by the same term
or editing device Synchronizer (algorithm), an algorithm that can be applied to a synchronous distributed algorithm to produce a version that operates
Synchronizer
Type of algorithm
are in general distinct concepts, but they often overlap – many distributed algorithms are both concurrent and parallel – and thus "sequential" is used
Sequential_algorithm
Method of clock synchronisation
The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was developed
Berkeley_algorithm
Annual conference on computing
typically studies theoretical aspects of distributed computing, such as the design and analysis of distributed algorithms. The scope of PODC is similar to the
Symposium on Principles of Distributed Computing
Symposium_on_Principles_of_Distributed_Computing
Method for clock synchronization
Cristian's algorithm (introduced by Flaviu Cristian in 1989) is a method for clock synchronization which can be used in many fields of distributive computer
Cristian's_algorithm
Rocha–Thatte algorithm is a distributed algorithm in graph theory for detecting cycles on large-scale directed graphs based on the bulk synchronous message
Rocha–Thatte cycle detection algorithm
Rocha–Thatte_cycle_detection_algorithm
The Chandra–Toueg consensus algorithm, published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving consensus in a network of
Chandra–Toueg consensus algorithm
Chandra–Toueg_consensus_algorithm
A snapshot algorithm is used to create a consistent snapshot of the global state of a distributed system. Due to the lack of globally shared memory and
Snapshot_algorithm
Concept of fault-tolerance
Self-stabilization is a concept of fault-tolerance in distributed systems. Given any initial state, a self-stabilizing distributed system will end up in a correct state
Self-stabilization
Algorithm for finding the shortest paths in graphs
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph
Bellman–Ford_algorithm
Concept in computer science
Raft, are used pervasively in widely deployed distributed and cloud computing systems. These algorithms are typically synchronous, dependent on an elected
Consensus_(computer_science)
Method for finding minimum spanning trees
In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a
Prim's_algorithm
Type of data structure
independently, concurrently and without coordinating with other replicas. An algorithm (itself part of the data type) automatically resolves any inconsistencies
Conflict-free replicated data type
Conflict-free_replicated_data_type
Overview of and topical guide to algorithms
Online algorithm — algorithm that receives input incrementally Parallel algorithm — algorithm designed for parallel computation Distributed algorithm — algorithm
Outline_of_algorithms
Least-weight tree connecting graph vertices
points in the plane (or space). The distributed minimum spanning tree is an extension of MST to the distributed model, where each node is considered
Minimum_spanning_tree
Leader election algorithm
The Hirschberg–Sinclair algorithm is a distributed algorithm designed for leader election problem in a synchronous ring network. It is named after its
Hirschberg–Sinclair_algorithm
Distributed algorithm for sensor networks
The Brooks–Iyengar algorithm or FuseCPA Algorithm or Brooks–Iyengar hybrid algorithm is a distributed algorithm that improves both the precision and accuracy
Brooks–Iyengar_algorithm
Concept in distributed computing
design of distributed algorithms in general, and won the Dijkstra Prize for an influential paper in distributed computing. Many other algorithms have been
Leader_election
Algorithm for matrix multiplication
In computer science, Cannon's algorithm is a distributed algorithm for matrix multiplication for two-dimensional meshes first described in 1969 by Lynn
Cannon's_algorithm
Approximate nearest neighbor search algorithm
Alexander; Logvinov, Andrey; Krylov, Vladimir (2012). "Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional
Hierarchical navigable small world
Hierarchical_navigable_small_world
Leader election algorithm
Yo-Yo is a distributed algorithm aimed at minimum finding and leader election in generic connected undirected graph. Unlike Mega-Merger it has a trivial
Yo-yo_(algorithm)
State in which members are blocking each other
for coordination among nodes. Techniques like wait-for graphs, distributed algorithms (like edge chasing; e.g., Chandy-Misra-Haas), and deadlock prevention
Deadlock_(computer_science)
Computer program for the Boolean satisfiability problem
As a result, only algorithms with exponential worst-case complexity are known. In spite of this, efficient and scalable algorithms for SAT were developed
SAT_solver
Distributed algorithm in graph theory
Mega-merger is a distributed algorithm aimed at solving the election problem in generic connected undirected graph. Mega-Merger was developed by Robert
Mega-Merger
Centralized distributed algorithms can often be considered as hybrid algorithms, consisting of an individual algorithm (run on each distributed processor)
Hybrid_algorithm
Independent set which is not a subset of any other independent set
produce results for distributed algorithms on computer clusters. The many challenges of designing distributed parallel algorithms apply in equal to the
Maximal_independent_set
Algorithm for partial ordering of events and detecting causality in distributed systems
Time and Global States of Distributed systems". In Cosnard, M. (ed.). Proc. Workshop on Parallel and Distributed Algorithms. Chateau de Bonas, France:
Vector_clock
Optimization problem in computer science
Alexander; Logvinov, Andrey; Krylov, Vladimir (2012), "Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional
Nearest_neighbor_search
Distributed computing protocol
heartbeats" used in distributed systems, first introduced by Abhinandan Das, Indranil Gupta and Ashish Motivala in 2002. It is a hybrid algorithm which combines
SWIM_Protocol
Peer-to-peer multimedia streaming protocol
Ace Stream is a peer-to-peer multimedia streaming protocol, built using BitTorrent technology. Ace Stream has been recognized by sources as a potential
Ace_Stream
Sequence of locally optimal choices
A greedy algorithm is an algorithm which, at each step, makes the choice that is locally optimal, and subsequently does not reconsider past choices. Greedy
Greedy_algorithm
Algorithm for shuffling a finite sequence
The Fisher–Yates shuffle is an algorithm for shuffling a finite sequence. The algorithm takes a list of all the elements of the sequence, and continually
Fisher–Yates_shuffle
In graph theory, the mathematically simplest spatial network
algorithms for this problem. This algorithm, which was proposed by Holtgrewe et al., was the first distributed RGG generator algorithm for dimension 2. It partitions
Random_geometric_graph
Numerical computing environment
interface to external C, C++, and Fortran code, further parallel distributed algorithm development (via MPI), and has plotting and 3D visualization capabilities
FreeMat
Concurrency control method for collaborative software
consistency control algorithm for interactive groupware applications". Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004
Operational_transformation
Technique used in computer science
such example of deadlock algorithm is Banker's algorithm. Distributed deadlocks can occur in distributed systems when distributed transactions or concurrency
Deadlock prevention algorithms
Deadlock_prevention_algorithms
American computer scientist
other areas, including Distributed Algorithms. In Nancy Lynch's book Distributed Algorithms she gives details of an algorithm by Hirschberg and J. B.
Dan_Hirschberg
Internet ecosystem layer that addresses bottlenecks
geographically distributed network of proxy servers and corresponding data centers. CDNs provide high availability and performance by distributing content geographically
Content_delivery_network
Minimum spanning forest algorithm that greedily adds edges
Kruskal's algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree
Kruskal's_algorithm
Sorting algorithm
together. However, if the array is non-uniformly distributed, the performance of these sorting algorithms can be significantly throttled. Samplesort addresses
Samplesort
Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was
Dijkstra–Scholten_algorithm
Parallel programming model
for processing and generating big data sets with a parallel and distributed algorithm on a cluster. A MapReduce program is composed of a map procedure
MapReduce
Computer science concept
active in step i {\displaystyle i} . In contrast to the PRAM-algorithm, in the distributed memory model, memory is not shared between processing units
Reduction_operator
Digital workload distribution techniques
information related to the tasks to be distributed, and derive an expected execution time. The advantage of static algorithms is that they are easy to set up
Load_balancing_(computing)
Method for analyzing online algorithms
"competitor") "knows". Similarly, competitive algorithms were developed for distributed systems, where the algorithm has to react to a request arriving at one
Competitive analysis (online algorithm)
Competitive_analysis_(online_algorithm)
Game theory concept
they present a distributed continuous-time algorithm for finding the variational generalized NE.[clarification needed] Their algorithm uses gradient descent
Aggregative_game
Approximate distinct counting algorithm
The basis of the HyperLogLog algorithm is the observation that the cardinality of a multiset of uniformly distributed random numbers can be estimated
HyperLogLog
Decentralized distributed system with lookup service
A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and
Distributed_hash_table
In computer science, a synchronizer is an algorithm that can be used to run a synchronous algorithm on top of an asynchronous processor network, so enabling
Synchronizer_(algorithm)
Special case of graph labeling in graph theory
constant-time distributed algorithm for weak 2-coloring. This is different from (non-weak) vertex coloring: there is no constant-time distributed algorithm for
Weak_coloring
Sorting algorithm
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted
Bucket_sort
fault-tolerance in distributed computing. Superstabilizing distributed algorithms combine the features of self-stabilizing algorithms and dynamic algorithms. A superstabilizing
Superstabilization
On graph coloring and neighborhood size
Panconesi, Alessandro (2000), "Fast distributed algorithms for Brooks–Vizing colourings", Journal of Algorithms, 37: 85–120, doi:10.1006/jagm.2000.1097
Brooks'_theorem
2001 DISC — International Symposium on Distributed Computing formerly: WDAG — Workshop on Distributed Algorithms on Graphs organized in cooperation with
List of distributed computing conferences
List_of_distributed_computing_conferences
Reliable delivery of packets to multiple recipients simultaneously
Textbook, covers a broad spectrum of distributed computing concepts, including virtual synchrony. Distributed Systems: Principles and Paradigms (2nd
Reliable_multicast
Indian-American computer scientist
Ricart-Agrawala Algorithm. The Ricart-Agrawala Algorithm is an algorithm for mutual exclusion on a distributed system. This algorithm is an extension
Ashok_Agrawala
This is a comparison of streaming media systems. A more complete list of streaming media systems is also available. The following tables compare general
Comparison of streaming media software
Comparison_of_streaming_media_software
This is a list of artificial intelligence algorithms, including algorithms and algorithmic methods used in artificial intelligence (AI) for search, automated
List of artificial intelligence algorithms
List_of_artificial_intelligence_algorithms
Automated method for solving mazes
maze-solving algorithm is an automated method for solving a maze. The random mouse, wall follower, Pledge, Tarry's, and Trémaux's algorithms are designed
Maze-solving_algorithm
Data structure in distributed computing
uses mwmr registers and not swmr registers. There are several algorithms in distributed computing which can be simplified in design and/or verification
Shared_snapshot_objects
Quantum version of the Byzantine agreement protocol
Byzantine fault tolerant protocols are algorithms that are robust to arbitrary types of failures in distributed algorithms. The Byzantine agreement protocol
Quantum_Byzantine_agreement
The Suzuki–Kasami algorithm is a token-based algorithm for achieving mutual exclusion in distributed systems. The process holding the token is the only
Suzuki–Kasami_algorithm
Inverse function to a tower of powers
lg* n − 1 ± 3 parallel operations. Richard Cole and Uzi Vishkin's distributed algorithm for 3-coloring an n-cycle: O(log* n) synchronous communication rounds
Iterated_logarithm
and on problems with few destinations. Hungarian algorithm Dimitri P. Bertsekas. "A distributed algorithm for the assignment problem", original paper, 1979
Auction_algorithm
Algorithm for pseudo-random number sampling
of uniformly-distributed random numbers, typically from a pseudo-random number generator, as well as precomputed tables. The algorithm is used to generate
Ziggurat_algorithm
Algorithm for caching data
policies (also known as cache replacement algorithms or cache algorithms) are optimizing instructions or algorithms which a computer program or hardware-maintained
Cache_replacement_policies
Huang's algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Shing-Tsaan Huang in 1989 in Information
Huang's_algorithm
Parallel version of breadth-first search algorithm
The breadth-first-search algorithm is a way to explore the vertices of a graph layer by layer. It is a basic algorithm in graph theory which can be used
Parallel_breadth-first_search
Device that creates a larger computer network from two smaller networks
more intelligent forwarding algorithm like Shortest Path Bridging or TRILL. A spanning tree protocol is a distributed algorithm that organizes active ports
Network_bridge
Italian computer scientist
Italian computer scientist specializing in computer networks and distributed algorithms. She is a professor at the University of Pisa, and a Fellow of the
Linda_Pagli
Node ordering for directed acyclic graphs
topological ordering. An algorithm for parallel topological sorting on distributed memory machines parallelizes the algorithm of Kahn for a DAG G = ( V
Topological_sorting
Estimate of time taken for running an algorithm
takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that
Time_complexity
Relational database which stores data across multiple servers
A distributed SQL database is a single relational database which replicates data across multiple servers. Distributed SQL databases are strongly consistent
Distributed_SQL
Algorithm related to graph distribution
In distributed computing amnesic flooding is a stateless distributed flooding algorithm that can be implemented as a broadcast protocol in synchronous
Amnesiac_flooding
travel, tourism, insurance
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
DISTRIBUTED ALGORITHM
travel, tourism, insurance