GenPark Distributed Deadlock Wait-For-Graph Detector
LocalAbout GenPark Distributed Deadlock Wait-For-Graph Detector
A Python standard-library skill that detects cycles in distributed lock wait-for graphs using Tarjan's strongly connected component algorithm and selects a low-cost victim transaction. It is intended for distributed systems handling lock deadlocks.
Key features
- 01Wait-for graph cycle detection
- 02Tarjan SCC analysis
- 03Victim transaction arbitration
- 04Python standard-library implementation
Use cases
- 01Detect cycles in distributed lock graphs
- 02Choose a victim transaction during deadlock resolution
MCP support
It can be configured as an MCP server for Claude Desktop or Cursor. The README does not specify its tools or returned data.
Configuration
Local server config is the same for every client. Copy it into your client’s MCP config file.
We haven’t collected a package or remote endpoint for this server. Follow the instructions in the project README.
Tools
Local servers expose tools only once running on your machine, and the maintainer has not provided a tool list.
Details
From the project READMEgenpark-distributed-deadlock-wait-for-graph-detector-skill
Real-time Tarjan SCC cycle detection on lock Wait-For-Graphs with minimal-cost victim transaction arbitrator
Quick Installation & MCP Integration
Add to your Claude Desktop or Cursor configuration:
{
"mcpServers": {
"genpark-distributed-deadlock-wait-for-graph-detector-skill": {
"command": "python",
"args": ["mcp_server.py"]
}
}
}
Zero Dependencies
Implemented entirely in Python 3 standard library.
Comments
New to MCP?
From what the protocol is to installing your first server, these answers cover most first questions.
An open protocol that defines how AI applications connect to external tools and data in a uniform way. Clients talk to the model; MCP servers provide tools, resources and prompt templates. They exchange standard messages, so one server can be reused by many clients.