The exhaustive list of topics in Distributed Algorithms in which we provide Help with Homework Assignment and Help with Project is as follows:
- Synchronous networks
- Synchronous ring networks
- Leader election
- Breadth-first search
- Broadcast and converge cast
- Shortest paths.
- Spanning trees
- Minimum spanning trees
- Fault-tolerant consensus
- Link failures
- K-set-agreement
- Asynchronous distributed computing
- Interacting state machines (I/O automata)
- Distributed algorithms
- Non-fault-tolerant algorithms for asynchronous networks
- Leader election
- Breadth-first search
- Shortest paths
- Broadcast and converge cast.
- Spanning trees
- Synchronizers
- Time
- Clocks
- State-machine simulation.
- Vector timestamps.
- Stable property detection
- Distributed termination
- Global snapshots
- Deadlock detection.
- Asynchronous shared-memory systems
- Mutual exclusion algorithms.
- Resource allocation
- The Dining Philosophers problem
- Shared-memory multiprocessors
- Contention
- Caching
- Locality
- Reading/writing locks.
- Shared-memory systems.
- Atomic objects
- Atomic snapshot algorithms
- Atomic read/write register algorithms
- Locking algorithms
- Optimistic algorithms
- Lock-free algorithms
- Lazy algorithms.
- Transactional memory
- Obstruction-free and lock
- Wait-free computability
- Wait-free vs. F-fault-tolerant atomic objects
- Boosting fault-tolerance.
- Self-stabilizing algorithms
- Timing-based systems
- Modeling and verification
- Timing-based algorithms for mutual exclusion and consensus
- Clock synchronization