Skip to main content
Glama
112,480 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"Techniques for Multi-Model Integration" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • A
    license
    Not graded
    quality
    A
    maintenance
    Connects Codex to local and cloud language models from MoE4All, GLM, DeepSeek, and OpenAI-compatible endpoints through a controlled MCP worker boundary, enabling read-only worker analysis, provider configuration, and VS Code model setup while keeping write authority with Codex.
    1
    MIT
  • F
    license
    Not graded
    quality
    B
    maintenance
    Enables AI agents and MCP clients to dispatch queries to the most suitable model among 70+ LLMs by scoring intent, budget, cost, and latency, returning structured routing decisions with execution telemetry. It runs as a zero-dependency Python MCP server that plugs into Claude Desktop, Cursor, and other MCP-compatible clients.
    8
    -
  • F
    license
    Not graded
    quality
    B
    maintenance
    Enables dynamic, intent- and budget-aware routing of queries across 70+ LLMs by balancing cost and latency through Pareto-optimal model selection. Integrates with MCP clients like Claude Desktop and Cursor for automated multi-model execution.
    7
    -
  • A
    license
    A
    quality
    A
    maintenance
    An MCP server that seats multiple LLMs as a council, letting your assistant query them in parallel or in sequence, relay answers for cross-critique, and merge conclusions within one conversation.
    6
    77 PyPI
    2
    MIT
  • A
    license
    A
    quality
    A
    maintenance
    MCP server that pings 130+ free coding LLM models across 17 providers in real-time, ranks them by latency, and helps AI agents pick the fastest available model.
    21
    43 PyPI
    MIT
  • A
    license
    B
    quality
    B
    maintenance
    A flexible proxy server that aggregates multiple backend MCP servers into a single interface using STDIO or SSE transports. It supports dynamic server management via an HTTP API and utilizes namespacing to prevent tool conflicts across connected services.
    3
    1
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables selecting the best AI model and reasoning effort for any task by analyzing task requirements and live pricing, balancing intelligence, speed, and cost. Provides model recommendations, comparisons, and routing status through MCP tools.
    18 npm
    2
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    An MCP server that exposes web lookup, save note, and list notes tools for a router-research-writer agent pipeline, enabling coordinated multi-agent workflows via the Model Context Protocol.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    An MCP server that proxies multiple MCP servers, allowing you to configure and access multiple MCP servers through a single endpoint with namespace support.
    4
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Exposes enterprise tools to third-party AI agents through a single guard that authorizes each call against default-deny, purpose-scoped entitlements, executes it, and writes a hash-chained, tamper-evident decision trace the firm owns. It also verifies signed vendor webhooks and enforces a strict versioned contract, so agent activity stays scoped, auditable, and portable across vendors.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    A flexible MCP proxy server that connects to and routes between multiple backend MCP servers over STDIO or SSE, enabling dynamic management and namespacing of tools.
    111
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Routes subagent tasks across Claude and OpenAI lanes by task kind and quota state, deciding whether to spawn a single model, run a duel of both vendors, or run both and ship the merge. It records duels with attested proof-of-run session ids, grades sides blind with one judge per vendor, and tracks per-kind standings and lane pacing.
    MIT