FHome
|
Distributed Algorithms |
||||||||||||||||||
| Topic |
Title |
Author(s) |
Sponsors and Publisher |
Summary |
Review(s) |
|||||||||||||
| Theoretical complexity |
|
|
The article studies the time complexity of natural network coordination problems in growth-bounded graphs and shows how to decompose a network in a O(log*n) worst case. |
none |
||||||||||||||
| Operating systems | Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis |
|
Publisher:
Springer-Verlag New York, Inc. Secaucus, NJ,
USA
|
This article introduces a new
algorithm for detecting deadlocks.
"In this algorithm, a transaction sets a timeout every time it makes an operation request. If it does not receive the acknowledgement that the operation has been executed successfully before the timeout expires, it assumes that it is involved in a deadlock and aborts." |
none |
|||||||||||||
|
Algorithms Implementing Distributed Shared Memory
|
LUIS M. ROCHA and
JOHAN BOLLEN |
Los Alamos National Laboratory | ||||||||||||||||
| Graph Algorithms | A Distributed Algorithm To Find Hamiltonian Cycles In G(n,p) Random Graphs (2000) | Eythan Levy, Guy Louchard, Jordi Petit |
Publisher: http://citeseer.ist.psu.edu |
As the name suggests. | none | |||||||||||||
| A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees | Juan A. Garay, Shay Kutten, David Peleg |
Publisher: Society for Industrial and Applied Mathematics |
As the name suggests. |
none |
||||||||||||||
| A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph | Publisher: IEEE |
The Abstract: (We cannot summarize an algorithms!) In a graph G = (V,E) a set S \subseteq V is said to be total dominating if every v \in V is adjacent to some member of S. When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is adjacent to some other server. Self-stabilization, introduced by Dijkstra, is the most inclusive approach to fault tolerance in distributed systems. We propose a new self-stabilizing distributed algorithm for finding a minimal total dominating set in an arbitrary graph. We also show how the basic ideas behind the proposed protocol can be generalized to solve other related problems. |
none | |||||||||||||||
|
A Distributed Graph Algorithm" Knot Detection |
J. MISRA and K. M. CHANDY | University of Texas at Austin |
A knot in a directed graph is a useful concept in deadlock
detection. A distributed algorithm for identifying a knot in a graph by using a network of processes is presented. The algorithm is based on the work of Dijkstra and Scholten. |
none | ||||||||||||||
| An Incremental Distributed Algorithm for Computing Biconnected Components | Bala Swaminathan, Kenneth J. Goldman | Washington University | none | |||||||||||||||
| Networking |
A Distributed Algorithm for Managing Multi-Target Identities in Wireless Ad-hoc Sensor Networks |
Jaewon Shin , Leonidas J. Guibas , and Feng Zhao |
Stanford Univeristy |
|
Currently being Reviewed by Karen Cosgrove | |||||||||||||
| Databases and Files | Distributed algorithms for dynamic replication of data |
|
|
The authors discuss two distributed algorithms for dynamic replication of a data-item in communication networks. | none | |||||||||||||
| Adaptive file allocation in distributed computer systems |
|
King's Coll., London, UK Print publication: Issue 6 (December 1994) |
Being reviewed by David Acker | |||||||||||||||
| Algorithms for High Performance, Wide-Area, Distributed File Downloads | James S. Plank, Scott Atchley, Ying Ding, and Micah Beck. | University of Tenessee |
|
Reviewed by David Vaglia | ||||||||||||||
| Data/File Structures | Interactive execution of distributed algorithms |
|
|
none | ||||||||||||||
|
|
Steven D. Gribble, Eric A. Brewer, Joseph M.
Hellerstein, and David Culler. |
The University of California at Berkeley. |
Description of DHash and the way to implement it
(not too technical) For more information, refer to my presentation about Distributed Hash Tables |
none | ||||||||||||||
| Robust and Efficient Data Management for a Distributed Hash Table. | Josh Cates | Master's thesis, Massachusetts Institute of Technology, May 2003. | A "book" about DHash and solutions for dynamicity, scalability and availibility problems that encounter the old-style DHash. | none | ||||||||||||||
|
Artificial Intelligence
|
Sequential Learning in Distributed Neural Networkswithout Catastrophic Forgetting: A Single and Realistic Self-Refreshing Memory Can Do It |
|
|
none | ||||||||||||||
| Mechanical verification of distributed algorithms in higher-order logic |
|
University of California at Los Angeles | A distributed application of HOL (high-order first logic). The article discusses how can HOL be separated and processed in parallel. | none | ||||||||||||||
| Technical Articles |
Commands Transfer
Protocol (CTP) - A New Networking Protocol for Distributed or Parallel
Computations |
Lev Naumov | www.thecodeproject.com | The implementation of the CTP that combines the benefits of both UDP and TCP. The article actually implements this protocol and discusses how and when this protocol's data transfer is better than TCP. | Reviewed by David Acker | |||||||||||||
| .NET Distributed Transactions on Enterprise Services: a demo | Alberto Venditti | www.thecodeproject.com | A database-related technical article in which the author describes how to develop transactional classes under the .Net environment (The classes are build in VB .Net) and can be used with ASP .net. | Reviewed by Sebastian Niezgoda | ||||||||||||||
Reviews
Review 1: MSN Search and
Learning to Rank, Article brought by:
Ducson Nguyen
Review 2: New PassMark Version 2.0 Employs Neural Network Technology to Fight Online Fraud. Brought by Duson Nyugen.
Review 3: Pathmark Stores, Inc. Taking On "Bottom of Basket Loss" With Evolution Robotics’ LaneHawk. Brought by Karen Cosgrove
Review 4: Jabber. Brought by David Vaglia
Review 5: Enabling High Performance Data Transfers brought by: David Acker
Review 6: Messaging is the Right Way to Build a Distributed System brought by: Sebastian Niezgoda
Review 7: Google's New High Protein Diet By Chris Sherman , Brought by: Justin Wetherell.