Results for “distributed-systems”

Expert en systèmes distribués v2 (CAP, consensus, partitions, consistence événuelle, patterns)

The English summary is being prepared. Showing the original description.

System architecture design and review. Use when designing architecture, evaluating microservices vs monolith, writing ADRs, choosing a database, planning for scalability, reviewing system design, or generating architecture diagrams.

The English summary is being prepared. Showing the original description.

When designing distributed systems for scalability, reliability, and consistency. Covers CAP/PACELC theorems, consistency models (strong, eventual, causal), replication patterns (leader-follower, multi-leader, leaderless), partitioning strategies (hash, range, geographic), transaction patterns (saga, event sourcing, CQRS), resilience patterns (circuit breaker, bulkhead), service discovery, and caching strategies for building fault-tolerant distributed architectures.

The English summary is being prepared. Showing the original description.

Applies microservices for independent deployment and per-service scaling. Use when teams need autonomous release cycles with distinct capability scaling needs.

The English summary is being prepared. Showing the original description.

Applies CQRS and Event Sourcing for read/write separation and audit trails. Use when designing systems with complex domain logic or full state-change history.

The English summary is being prepared. Showing the original description.

Applies client-server architecture for web/mobile apps. Use when designing systems with centralized backend services, trust boundaries, or offline-first sync.

The English summary is being prepared. Showing the original description.

Think and work like an expert Distributed Systems Researcher. Use when a task calls for Distributed Systems Researcher judgment. Reasons from failure models, consistency contracts, and tail-latency-and-recovery performance through TLA+ model checking, Jepsen and Porcupine linearizability checking, and YCSB/DeathStarBench benchmarking with iptables and kill -9 fault injection, while treating unbounded leases and split-brain, clock skew under NTP, and GC-induced p99 spikes as first-class failure modes.

The English summary is being prepared. Showing the original description.

Designs consensus, quorums, leases, idempotency, and CRDTs. Use when facing split brain, fencing tokens, exactly-once claims, duplicate retries, stale reads, or leader flapping.

The English summary is being prepared. Showing the original description.

Comprehensive reference for inter-process communication mechanisms -- every way processes can talk on a computer. Covers sockets (TCP, UDP, Unix domain), WebSockets, SSE, pipes (named/anonymous), shared memory (mmap, shm_open), message queues, signals, D-Bus, XPC (macOS), gRPC, REST, stdin/stdout, file-based coordination, and clipboard. Performance benchmarks, platform availability, and code examples for each. Special focus on which IPC works best for AI agent coordination. Activate on: "IPC", "inter-process communication", "process communication", "how do I talk between processes", "Unix socket vs TCP", "shared memory", "named pipe", "WebSocket vs SSE", "gRPC vs REST", "agent coordination IPC", "XPC service", "message passing", "stdout pipe", "D-Bus", "mmap". NOT for: distributed systems design (use distributed-systems), network protocol design (use networking), message queue infrastructure like Kafka (use data-pipeline-engineer).

The English summary is being prepared. Showing the original description.

Implementing the `Idempotency-Key` HTTP header pattern (Stripe-pioneered, IETF-standardizing) so retries don't double-charge or duplicate side effects — full Postgres schema with recovery-point state machine, fingerprint check, in-progress lock with 409 response, and 24h retention. Grounded in Stripe blog/docs, the IETF httpapi WG draft, and Brandur Leach's canonical implementation.

The English summary is being prepared. Showing the original description.

Comprehensive guide to designing reliable, scalable data systems covering databases, streaming, and consistency

The English summary is being prepared. Showing the original description.

Foundational impossibility result proving consensus cannot be guaranteed in asynchronous systems with even one faulty process

The English summary is being prepared. Showing the original description.

Choose multi-agent architectures using environment-first analysis, coordination pressure, commitment tuning, and knowledge levels. Use for autonomy design, protocol choice, and coordination failures. NOT for single-agent planning, centralized schedulers, or prompt-only swarms.

The English summary is being prepared. Showing the original description.

Foundational concurrent computation model where actors communicate exclusively through asynchronous message passing

The English summary is being prepared. Showing the original description.

Expert-level distributed systems theory covering consistency models, consensus algorithms, fault tolerance, replication, distributed transactions, and the CAP theorem.

The English summary is being prepared. Showing the original description.

Decompose systems into microservices and apply canonical distributed-systems patterns. Use this skill whenever the user wants to split a monolith into services, design service boundaries, choose between microservices and a modular monolith, implement sagas or the outbox pattern, set up CQRS or event sourcing, configure an API gateway or BFF, add resilience (circuit breakers, retries, timeouts), or implement distributed tracing with OpenTelemetry. Also trigger for distributed transactions, service discovery, event-driven architecture, contract testing with Pact, canary releases, and idempotent consumers.

The English summary is being prepared. Showing the original description.

Expert en systèmes distribués (CAP theorem, consensus, partitions, vector clocks)

The English summary is being prepared. Showing the original description.

Foundational impossibility result proving consensus cannot be guaranteed in asynchronous systems with even one faulty process

The English summary is being prepared. Showing the original description.

Foundational concurrent computation model where actors communicate exclusively through asynchronous message passing

The English summary is being prepared. Showing the original description.