<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Index on Le Site de François</title><link>https://lesitedefrancois.be/en/ai/</link><description>Recent content in Index on Le Site de François</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2026 François</copyright><atom:link href="https://lesitedefrancois.be/en/ai/index.xml" rel="self" type="application/rss+xml"/><item><title>Context window</title><link>https://lesitedefrancois.be/en/ai/context-window/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/context-window/</guid><description>&lt;p&gt;The &lt;strong&gt;context window&lt;/strong&gt; is the maximum span of tokens—input prompt plus model-generated output—that an &lt;strong&gt;LLM&lt;/strong&gt; can process in a single forward pass chain without truncating or sliding attention. It is set by &lt;strong&gt;model architecture&lt;/strong&gt; (positional encoding limit, e.g. 8K, 128K, 1M+ in newer models) and by practical &lt;strong&gt;VRAM&lt;/strong&gt; on the serving &lt;strong&gt;GPU&lt;/strong&gt;, because the &lt;strong&gt;KV cache&lt;/strong&gt; scales with total sequence length. Its objective is to bound memory and compute: longer windows enable whole documents, multi-turn chat history, and large &lt;strong&gt;RAG&lt;/strong&gt; payloads in one shot, but cost more on every &lt;strong&gt;prefill&lt;/strong&gt; and &lt;strong&gt;decode&lt;/strong&gt; step. APIs expose this as &lt;code&gt;max_tokens&lt;/code&gt;, context limits, or model cards; exceeding it yields errors or silent truncation.&lt;/p&gt;</description></item><item><title>CUDA (Compute Unified Device Architecture)</title><link>https://lesitedefrancois.be/en/ai/cuda/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/cuda/</guid><description>&lt;p&gt;&lt;strong&gt;CUDA (Compute Unified Device Architecture)&lt;/strong&gt; is NVIDIA&amp;rsquo;s software platform for general-purpose computing on GPUs. Its objective is to give developers a familiar C/C++ (and Fortran, Python bindings) programming model with explicit control over &lt;strong&gt;kernels&lt;/strong&gt; (functions that run on the device), &lt;strong&gt;streams&lt;/strong&gt; (ordered queues of work), and &lt;strong&gt;memory spaces&lt;/strong&gt; (host, device, unified). CUDA sits above the GPU driver and below frameworks such as cuDNN, NCCL, and higher-level ML stacks; it is the layer that makes it practical to implement custom operators, HPC solvers, and inference engines that are not covered by a closed library. For AI, virtually every major training and inference stack ultimately depends on CUDA (or a CUDA-compatible runtime) on NVIDIA hardware.&lt;/p&gt;</description></item><item><title>cuDNN (CUDA Deep Neural Network library)</title><link>https://lesitedefrancois.be/en/ai/cudnn/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/cudnn/</guid><description>&lt;p&gt;&lt;strong&gt;cuDNN (CUDA Deep Neural Network library)&lt;/strong&gt; is NVIDIA’s library of highly optimized &lt;strong&gt;GPU kernels&lt;/strong&gt; for operations that dominate deep learning: convolutions, matrix multiplies used in attention, pooling, normalization (batch/layer), activations, and recurrent cells. Its objective is to deliver near-peak performance on &lt;strong&gt;CUDA&lt;/strong&gt;-capable GPUs without every framework author hand-writing assembly-tuned kernels. &lt;strong&gt;PyTorch&lt;/strong&gt;, TensorFlow, and many &lt;strong&gt;inference&lt;/strong&gt; engines call cuDNN (directly or via cuBLAS) under the hood for training and serving. cuDNN sits between raw &lt;strong&gt;CUDA&lt;/strong&gt; and application code; version alignment with the CUDA toolkit and driver is mandatory for supported deployments.&lt;/p&gt;</description></item><item><title>Decode</title><link>https://lesitedefrancois.be/en/ai/decode/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/decode/</guid><description>&lt;p&gt;&lt;strong&gt;Decode&lt;/strong&gt; is the second stage of &lt;strong&gt;LLM inference&lt;/strong&gt;: after &lt;strong&gt;prefill&lt;/strong&gt; has stored keys and values for the prompt, the model generates &lt;strong&gt;one new token per forward pass&lt;/strong&gt;, appends it to the sequence, extends the &lt;strong&gt;KV cache&lt;/strong&gt;, and repeats until a stop condition (EOS token, max length, or API limit). Its objective is fluent continuation—answer text, code, or tool-call JSON—at acceptable &lt;strong&gt;inter-token latency&lt;/strong&gt; and cluster &lt;strong&gt;throughput&lt;/strong&gt; (tokens per second across many concurrent sessions). Decode drives the “typing” experience in chat UIs; prefill drives how long users wait before the first character appears.&lt;/p&gt;</description></item><item><title>DOCA (Data Center Infrastructure on a Chip Architecture)</title><link>https://lesitedefrancois.be/en/ai/doca/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/doca/</guid><description>&lt;p&gt;&lt;strong&gt;DOCA (Data Center Infrastructure on a Chip Architecture)&lt;/strong&gt; is NVIDIA&amp;rsquo;s software framework for building and operating services on &lt;strong&gt;BlueField DPUs&lt;/strong&gt;. Its objective is to standardize how operators and ISVs develop &lt;strong&gt;infrastructure applications&lt;/strong&gt;—OVS offload, firewall/VNF, storage targets, RDMA/RoCE control, TLS inspection, telemetry agents—on Arm cores and hardware accelerators embedded in the NIC, using a consistent set of libraries instead of ad hoc kernel modules on the host. DOCA spans drivers, userspace APIs, reference pipelines, and marketplace-packaged applications; it is the DPU counterpart to CUDA on GPUs, oriented toward I/O and packet processing rather than tensor math.&lt;/p&gt;</description></item><item><title>DPU (Data Processing Unit)</title><link>https://lesitedefrancois.be/en/ai/dpu/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/dpu/</guid><description>&lt;p&gt;A &lt;strong&gt;DPU (Data Processing Unit)&lt;/strong&gt;—also marketed as an infrastructure processing unit or &lt;strong&gt;SmartNIC&lt;/strong&gt;—is a programmable accelerator placed on the network path between servers and the fabric. Its objective is to &lt;strong&gt;offload infrastructure work&lt;/strong&gt; that would otherwise consume host CPU cycles and pollute caches: virtual switching (OVS), overlay encapsulation (VXLAN/Geneve), storage initiation (NVMe-oF), firewalling, TLS termination, telemetry export, and increasingly &lt;strong&gt;zero-trust&lt;/strong&gt; policy enforcement. In AI clusters, DPUs help preserve GPU servers for model compute by moving east-west networking, storage, and security functions to the NIC. A DPU is not a replacement for a training GPU; it complements it by making the surrounding data-center network and storage stack more efficient and isolatable.&lt;/p&gt;</description></item><item><title>Fine-tuning / LoRA</title><link>https://lesitedefrancois.be/en/ai/fine-tuning-lora/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/fine-tuning-lora/</guid><description>&lt;p&gt;&lt;strong&gt;Fine-tuning&lt;/strong&gt; is &lt;strong&gt;training&lt;/strong&gt; continued from a pretrained &lt;strong&gt;LLM&lt;/strong&gt; (or other model) on a smaller, task-specific dataset so behavior matches a domain—support tone, internal jargon, classification format, or tool-use style—without pretraining from scratch. &lt;strong&gt;LoRA (Low-Rank Adaptation)&lt;/strong&gt; is a &lt;strong&gt;parameter-efficient&lt;/strong&gt; fine-tuning method: instead of updating all billions of weights, small low-rank matrices are inserted into attention (and sometimes MLP) layers and only those adapters are trained, drastically cutting VRAM and checkpoint size. The objective is better task accuracy or alignment at lower cost than full fine-tuning; adapters can be swapped per tenant while a frozen base model stays shared. Fine-tuning differs from &lt;strong&gt;RAG&lt;/strong&gt;, which injects external facts at inference time without changing weights.&lt;/p&gt;</description></item><item><title>GPU (Graphics Processing Unit)</title><link>https://lesitedefrancois.be/en/ai/gpu/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/gpu/</guid><description>&lt;p&gt;A &lt;strong&gt;GPU (Graphics Processing Unit)&lt;/strong&gt; is a specialized processor designed to execute a very large number of arithmetic operations in parallel. Its original objective was real-time rendering; in modern &lt;strong&gt;AI&lt;/strong&gt; and &lt;strong&gt;HPC&lt;/strong&gt; infrastructure the same silicon is used to accelerate matrix multiplications, convolutions, and other kernels that dominate neural network training and inference. Unlike a general-purpose host, a GPU optimizes for &lt;strong&gt;throughput&lt;/strong&gt;: many warps or wavefronts hide memory latency while the device keeps SIMD units busy. In a data-center stack, GPUs typically sit in PCIe or NVLink-attached servers (or on integrated AI appliances) and are scheduled by frameworks such as PyTorch, TensorFlow, or vLLM through a runtime such as &lt;strong&gt;CUDA&lt;/strong&gt; or ROCm.&lt;/p&gt;</description></item><item><title>Guardrails</title><link>https://lesitedefrancois.be/en/ai/guardrails/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/guardrails/</guid><description>&lt;p&gt;&lt;strong&gt;Guardrails&lt;/strong&gt; are controls wrapped around &lt;strong&gt;LLM inference&lt;/strong&gt; to reduce harmful, non-compliant, or off-policy behavior without replacing the base model. Their objective is &lt;strong&gt;AI safety and governance&lt;/strong&gt; in production: block or rewrite prompts that attempt &lt;strong&gt;prompt injection&lt;/strong&gt; or jailbreaks, filter toxic or leaked &lt;strong&gt;PII&lt;/strong&gt; in outputs, enforce topic allowlists, validate structured tool calls, and log decisions for audit. Guardrails sit on the &lt;strong&gt;request path&lt;/strong&gt; (before tokens reach the model or after the model proposes a draft response), combining rule engines, classifiers, regex, and sometimes smaller models. They complement—not replace—application auth, network policy, and human review; enterprises treat them as mandatory for customer-facing and internal copilots.&lt;/p&gt;</description></item><item><title>Inference</title><link>https://lesitedefrancois.be/en/ai/inference/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/inference/</guid><description>&lt;p&gt;&lt;strong&gt;Inference&lt;/strong&gt; is the operational phase of machine learning where a &lt;strong&gt;trained model&lt;/strong&gt; is applied to new inputs to produce outputs: next tokens in an LLM, bounding boxes in vision, embeddings for search, or scores in tabular models. Its objective is reliable &lt;strong&gt;serving&lt;/strong&gt; at scale—honoring latency targets (time to first token, p99 completion time), throughput (requests or tokens per second), availability, and cost per query—rather than improving weights. In generative AI, inference splits into &lt;strong&gt;prefill&lt;/strong&gt; (processing the prompt in one or few forward passes) and &lt;strong&gt;decode&lt;/strong&gt; (autoregressive generation of each output token), each with different bottlenecks. Production inference adds API gateways, auth, rate limiting, observability, model versioning, A/B tests, and guardrails; the model file is read-mostly while &lt;strong&gt;KV cache&lt;/strong&gt; and batch state are ephemeral per session.&lt;/p&gt;</description></item><item><title>InfiniBand</title><link>https://lesitedefrancois.be/en/ai/infiniband/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/infiniband/</guid><description>&lt;p&gt;&lt;strong&gt;InfiniBand&lt;/strong&gt; is a high-performance &lt;strong&gt;network fabric&lt;/strong&gt; designed for datacenter and HPC clusters, natively supporting &lt;strong&gt;RDMA&lt;/strong&gt; (Remote Direct Memory Access) with low latency, high bandwidth, and features such as adaptive routing and congestion control at the link layer. Its objective in &lt;strong&gt;AI&lt;/strong&gt; is to connect many &lt;strong&gt;GPU&lt;/strong&gt; servers so &lt;strong&gt;distributed training&lt;/strong&gt; (gradient all-reduce via &lt;strong&gt;NCCL&lt;/strong&gt;) and multi-node &lt;strong&gt;inference&lt;/strong&gt; (tensor parallel, &lt;strong&gt;llm-d&lt;/strong&gt; prefill/decode &lt;strong&gt;KV&lt;/strong&gt; transfer) are not limited by TCP overhead on a &lt;strong&gt;CPU&lt;/strong&gt;. InfiniBand NICs (e.g. NVIDIA ConnectX) present verbs APIs; subnets are managed with an &lt;strong&gt;Subnet Manager&lt;/strong&gt; and partitioned for multi-tenant isolation.&lt;/p&gt;</description></item><item><title>KV cache (Key-Value Cache)</title><link>https://lesitedefrancois.be/en/ai/kv-cache/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/kv-cache/</guid><description>&lt;p&gt;The &lt;strong&gt;KV cache (key-value cache)&lt;/strong&gt; is the stored result of the &lt;strong&gt;attention&lt;/strong&gt; layers for tokens already processed in a sequence. During &lt;strong&gt;autoregressive decode&lt;/strong&gt;, each new token only needs a forward pass that depends on prior context; recomputing keys and values for all earlier tokens every step would be wasteful. The cache therefore holds, per layer and per sequence, the &lt;strong&gt;K&lt;/strong&gt; and &lt;strong&gt;V&lt;/strong&gt; tensors produced when those tokens were first seen (during &lt;strong&gt;prefill&lt;/strong&gt; for the prompt, then extended one token at a time during decode). The objective is lower &lt;strong&gt;time per output token&lt;/strong&gt; and lower FLOPs; the cost is &lt;strong&gt;GPU memory&lt;/strong&gt;: cache size grows with batch × layers × heads × sequence_length × head_dim, and is often the limit on concurrent sessions or context length before model weights fill VRAM.&lt;/p&gt;</description></item><item><title>LLM (Large Language Model)</title><link>https://lesitedefrancois.be/en/ai/llm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/llm/</guid><description>&lt;p&gt;An &lt;strong&gt;LLM (large language model)&lt;/strong&gt; is a deep neural network—almost always a &lt;strong&gt;Transformer&lt;/strong&gt;—trained on large amounts of text (and sometimes multimodal data) to model the probability of the next token given prior context. Its objective at &lt;strong&gt;training&lt;/strong&gt; time is to minimize prediction error over billions of tokens, producing weights that encode grammar, facts (with limitations), reasoning patterns, and task-following behavior after alignment or instruction tuning. At &lt;strong&gt;inference&lt;/strong&gt; time the same model &lt;strong&gt;generates&lt;/strong&gt; completions, answers questions, summarizes documents, or drives agents; production systems expose it through APIs (often OpenAI-compatible) backed by engines such as &lt;strong&gt;vLLM&lt;/strong&gt; or &lt;strong&gt;NIM&lt;/strong&gt;. LLMs power chatbots, code assistants, RAG pipelines, and enterprise copilots.&lt;/p&gt;</description></item><item><title>llm-d</title><link>https://lesitedefrancois.be/en/ai/llm-d/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/llm-d/</guid><description>&lt;p&gt;&lt;strong&gt;llm-d&lt;/strong&gt; is an open-source &lt;strong&gt;distributed inference serving stack&lt;/strong&gt; for production LLM workloads on &lt;strong&gt;Kubernetes&lt;/strong&gt;. Its objective is not to replace model servers such as &lt;strong&gt;vLLM&lt;/strong&gt; or SGLang but to sit above them and fix cluster-scale problems: which replica should receive the next request, how to split &lt;strong&gt;prefill&lt;/strong&gt; (compute-heavy) from &lt;strong&gt;decode&lt;/strong&gt; (memory-bandwidth-heavy), how to share or tier &lt;strong&gt;KV cache&lt;/strong&gt; state, and how to scale MoE models with wide expert parallelism. llm-d publishes “well-lit path” guides—benchmarked Helm recipes and architectures—so teams reach strong time-to-first-token and throughput without hand-rolling schedulers. The project is a &lt;strong&gt;CNCF sandbox&lt;/strong&gt; effort with contributors including &lt;strong&gt;Red Hat&lt;/strong&gt;, IBM, Google, and cloud partners.&lt;/p&gt;</description></item><item><title>MCP (Model Context Protocol)</title><link>https://lesitedefrancois.be/en/ai/mcp/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/mcp/</guid><description>&lt;p&gt;&lt;strong&gt;MCP (Model Context Protocol)&lt;/strong&gt; is an open standard for how &lt;strong&gt;LLM applications&lt;/strong&gt; discover and invoke &lt;strong&gt;tools&lt;/strong&gt;, read structured &lt;strong&gt;resources&lt;/strong&gt;, and exchange &lt;strong&gt;prompts&lt;/strong&gt; with external systems through MCP &lt;strong&gt;servers&lt;/strong&gt; and &lt;strong&gt;clients&lt;/strong&gt;. The objective is interchangeable integrations: instead of every chat product implementing bespoke plugins for Git, databases, or ticketing, a tool provider ships an MCP server and any compatible client (IDE, assistant, agent runtime) can use it with consistent auth and capability negotiation. MCP complements HTTP &lt;strong&gt;inference&lt;/strong&gt; APIs—it sits at the orchestration layer where the model decides which tool to call, not inside &lt;strong&gt;vLLM&lt;/strong&gt;’s token loop. It is widely associated with &lt;strong&gt;agentic&lt;/strong&gt; workflows (multi-step plans, code execution, retrieval).&lt;/p&gt;</description></item><item><title>MIG (Multi-Instance GPU)</title><link>https://lesitedefrancois.be/en/ai/mig/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/mig/</guid><description>&lt;p&gt;&lt;strong&gt;MIG (Multi-Instance GPU)&lt;/strong&gt; is an NVIDIA &lt;strong&gt;GPU&lt;/strong&gt; partitioning mode on datacenter accelerators (e.g. &lt;strong&gt;A100&lt;/strong&gt;, &lt;strong&gt;H100&lt;/strong&gt;) that splits one physical card into up to seven &lt;strong&gt;GPU instances (GIs)&lt;/strong&gt;, each with isolated &lt;strong&gt;streaming multiprocessors&lt;/strong&gt;, memory bandwidth, and &lt;strong&gt;HBM&lt;/strong&gt; capacity. The objective is &lt;strong&gt;higher utilization&lt;/strong&gt; in multi-tenant environments: several smaller models or dev/test workloads share one expensive GPU without time-slicing contention as severe as full-card sharing. Each MIG instance appears to the OS and &lt;strong&gt;CUDA&lt;/strong&gt; as a separate GPU with fixed resources; workloads cannot oversubscribe another instance’s memory. MIG suits &lt;strong&gt;inference&lt;/strong&gt; and modest training more often than massive single-job training that needs the entire GPU and &lt;strong&gt;NVLink&lt;/strong&gt; domain.&lt;/p&gt;</description></item><item><title>NCCL (NVIDIA Collective Communications Library)</title><link>https://lesitedefrancois.be/en/ai/nccl/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/nccl/</guid><description>&lt;p&gt;&lt;strong&gt;NCCL (NVIDIA Collective Communications Library)&lt;/strong&gt; implements &lt;strong&gt;collective operations&lt;/strong&gt;—&lt;strong&gt;all-reduce&lt;/strong&gt;, &lt;strong&gt;broadcast&lt;/strong&gt;, &lt;strong&gt;reduce-scatter&lt;/strong&gt;, &lt;strong&gt;all-gather&lt;/strong&gt;, and others—optimized for &lt;strong&gt;NVIDIA GPUs&lt;/strong&gt; across &lt;strong&gt;NVLink&lt;/strong&gt; within a node and &lt;strong&gt;RDMA&lt;/strong&gt; (&lt;strong&gt;InfiniBand&lt;/strong&gt; or &lt;strong&gt;RoCE&lt;/strong&gt;) across nodes. Its objective in &lt;strong&gt;AI&lt;/strong&gt; is to make &lt;strong&gt;distributed training&lt;/strong&gt; and multi-GPU &lt;strong&gt;inference&lt;/strong&gt; (tensor parallelism) scale: gradient shards must merge every step; attention and MLP partitions must exchange activations with minimal latency. Frameworks (&lt;strong&gt;PyTorch&lt;/strong&gt; DDP/FSDP, &lt;strong&gt;vLLM&lt;/strong&gt; tensor parallel) call NCCL (or delegate to it) rather than hand-rolling socket code.&lt;/p&gt;</description></item><item><title>NIM (NVIDIA Inference Microservices)</title><link>https://lesitedefrancois.be/en/ai/nim/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/nim/</guid><description>&lt;p&gt;&lt;strong&gt;NIM (NVIDIA Inference Microservices)&lt;/strong&gt; are &lt;strong&gt;container images&lt;/strong&gt; and Helm charts that deliver ready-to-run &lt;strong&gt;inference endpoints&lt;/strong&gt; for specific models (LLMs, vision, embedding, reranking, and more). The objective is to shrink time-to-production: instead of assembling CUDA drivers, frameworks, model weights, and an OpenAI-compatible server yourself, operators pull a NIM that bundles a performance-tuned engine (often &lt;strong&gt;TensorRT-LLM&lt;/strong&gt; or Triton-backed paths), default model artifacts or download hooks, health checks, and a stable HTTP/gRPC API. NIMs are sized for &lt;strong&gt;GPU&lt;/strong&gt; deployment and target enterprise MLOps teams that want versioned, scannable containers with predictable resource requests rather than bespoke notebooks turned into scripts.&lt;/p&gt;</description></item><item><title>NVLink</title><link>https://lesitedefrancois.be/en/ai/nvlink/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/nvlink/</guid><description>&lt;p&gt;&lt;strong&gt;NVLink&lt;/strong&gt; is NVIDIA’s proprietary &lt;strong&gt;high-speed interconnect&lt;/strong&gt; between GPUs (and, on some platforms, between GPUs and CPUs) inside a server or across an &lt;strong&gt;NVLink switch&lt;/strong&gt; system (e.g. NVL72-class racks). Its objective is to move tensors—activations, gradients, &lt;strong&gt;KV cache&lt;/strong&gt; shards, or partial attention results—at much higher bandwidth and lower latency than &lt;strong&gt;PCIe&lt;/strong&gt; or general &lt;strong&gt;Ethernet&lt;/strong&gt;, so multi-GPU &lt;strong&gt;training&lt;/strong&gt; and large-model &lt;strong&gt;inference&lt;/strong&gt; (tensor parallelism) are not bottlenecked on the bus. NVLink domains define which GPUs can treat each other’s memory as peer-accessible for &lt;strong&gt;CUDA&lt;/strong&gt; and &lt;strong&gt;NCCL&lt;/strong&gt; without leaving the box.&lt;/p&gt;</description></item><item><title>Prefill</title><link>https://lesitedefrancois.be/en/ai/prefill/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/prefill/</guid><description>&lt;p&gt;&lt;strong&gt;Prefill&lt;/strong&gt; is the first stage of &lt;strong&gt;LLM inference&lt;/strong&gt; after a user (or &lt;strong&gt;RAG&lt;/strong&gt; pipeline) submits a prompt: the model runs a forward pass over &lt;strong&gt;all input tokens at once&lt;/strong&gt; (or in chunked blocks for very long contexts) to compute hidden states and populate the &lt;strong&gt;KV cache&lt;/strong&gt; for every layer. Its objective is to prepare context the model will attend to during generation; the user-visible metric is often &lt;strong&gt;time to first token (TTFT)&lt;/strong&gt;, which is dominated by prefill for long prompts. Prefill is &lt;strong&gt;compute-intensive&lt;/strong&gt; (large matrix multiplies across the full sequence) compared with &lt;strong&gt;decode&lt;/strong&gt;, which adds one token at a time. In chat, each new user message typically triggers a new prefill over the accumulated conversation (unless caching optimizations apply).&lt;/p&gt;</description></item><item><title>Quantization</title><link>https://lesitedefrancois.be/en/ai/quantization/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/quantization/</guid><description>&lt;p&gt;&lt;strong&gt;Quantization&lt;/strong&gt; is the process of representing a model’s &lt;strong&gt;weights&lt;/strong&gt; and/or &lt;strong&gt;activations&lt;/strong&gt; with fewer bits than full &lt;strong&gt;FP32&lt;/strong&gt; training precision—commonly &lt;strong&gt;FP16&lt;/strong&gt;, &lt;strong&gt;BF16&lt;/strong&gt;, &lt;strong&gt;FP8&lt;/strong&gt;, &lt;strong&gt;INT8&lt;/strong&gt;, or &lt;strong&gt;INT4&lt;/strong&gt; (GPTQ, AWQ, GGUF-style formats). The objective is lower &lt;strong&gt;GPU memory&lt;/strong&gt; (larger models or more concurrent sessions per card), higher &lt;strong&gt;throughput&lt;/strong&gt;, and sometimes faster kernels on hardware with native low-precision units, at the cost of possible quality degradation if pushed too aggressively. Quantization can be applied &lt;strong&gt;post-training&lt;/strong&gt; (calibration on a sample dataset) or during &lt;strong&gt;training&lt;/strong&gt; (quantization-aware training). For &lt;strong&gt;inference&lt;/strong&gt;, serving engines &lt;strong&gt;vLLM&lt;/strong&gt; and &lt;strong&gt;NIM&lt;/strong&gt; load quantized checkpoints and dispatch to vendor libraries (TensorRT-LLM, CUTLASS, etc.) that implement fused low-precision matmuls.&lt;/p&gt;</description></item><item><title>RAG (Retrieval-Augmented Generation)</title><link>https://lesitedefrancois.be/en/ai/rag/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/rag/</guid><description>&lt;p&gt;&lt;strong&gt;RAG (retrieval-augmented generation)&lt;/strong&gt; is an architecture pattern, not a single product: before the &lt;strong&gt;LLM&lt;/strong&gt; generates an answer, a &lt;strong&gt;retriever&lt;/strong&gt; finds relevant chunks from a knowledge base (wikis, tickets, PDFs, databases) and injects them into the prompt as context. The objective is &lt;strong&gt;grounded&lt;/strong&gt; responses—fewer hallucinations on company facts, answers that reflect documents updated yesterday, and traceability to sources—without running full &lt;strong&gt;fine-tuning&lt;/strong&gt; every time content changes. A typical pipeline embeds queries and documents with an &lt;strong&gt;embedding model&lt;/strong&gt;, stores vectors in a search index, retrieves top-k passages, optionally &lt;strong&gt;reranks&lt;/strong&gt; them, then calls the LLM with a system prompt plus retrieved text. RAG is the dominant enterprise pattern for private AI assistants and support bots.&lt;/p&gt;</description></item><item><title>RDMA (Remote Direct Memory Access)</title><link>https://lesitedefrancois.be/en/ai/rdma/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/rdma/</guid><description>&lt;p&gt;&lt;strong&gt;RDMA (Remote Direct Memory Access)&lt;/strong&gt; allows a network adapter to transfer data between the memory of two machines with &lt;strong&gt;little CPU overhead&lt;/strong&gt;, low latency, and often &lt;strong&gt;kernel bypass&lt;/strong&gt; (userspace stacks such as &lt;strong&gt;verbs&lt;/strong&gt; on InfiniBand or RoCE). Its objective in AI infrastructure is to keep &lt;strong&gt;GPUs&lt;/strong&gt; fed and synchronized: &lt;strong&gt;distributed training&lt;/strong&gt; exchanges gradients quickly, &lt;strong&gt;disaggregated inference&lt;/strong&gt; (&lt;strong&gt;llm-d&lt;/strong&gt;) moves &lt;strong&gt;KV cache&lt;/strong&gt; blocks between prefill and decode nodes, and &lt;strong&gt;NVMe-oF&lt;/strong&gt; storage delivers checkpoints without the host spending cycles copying every byte. &lt;strong&gt;DPUs&lt;/strong&gt; and &lt;strong&gt;SmartNICs&lt;/strong&gt; also use RDMA paths for storage and east-west traffic while the host CPU runs models.&lt;/p&gt;</description></item><item><title>RoCE (RDMA over Converged Ethernet)</title><link>https://lesitedefrancois.be/en/ai/roce/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/roce/</guid><description>&lt;p&gt;&lt;strong&gt;RoCE (RDMA over Converged Ethernet)&lt;/strong&gt; implements &lt;strong&gt;RDMA&lt;/strong&gt; semantics on &lt;strong&gt;Ethernet&lt;/strong&gt; (RoCEv2 uses UDP/IP), so NICs can perform remote memory access with low &lt;strong&gt;CPU&lt;/strong&gt; utilization over the same physical switches many enterprises already operate. Its objective is to deliver InfiniBand-like &lt;strong&gt;GPU&lt;/strong&gt; communication economics—fast &lt;strong&gt;NCCL&lt;/strong&gt; all-reduces, &lt;strong&gt;NVMe-oF&lt;/strong&gt;, &lt;strong&gt;llm-d&lt;/strong&gt; KV moves—without maintaining a separate InfiniBand fabric. RoCE requires &lt;strong&gt;lossless Ethernet&lt;/strong&gt; behavior: Priority Flow Control (&lt;strong&gt;PFC&lt;/strong&gt;), Explicit Congestion Notification (&lt;strong&gt;ECN&lt;/strong&gt;), buffer tuning, and often dedicated traffic classes so RDMA traffic is not dropped under burst load.&lt;/p&gt;</description></item><item><title>ROCm (Radeon Open Compute)</title><link>https://lesitedefrancois.be/en/ai/rocm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/rocm/</guid><description>&lt;p&gt;&lt;strong&gt;ROCm (Radeon Open Compute)&lt;/strong&gt; is AMD’s software stack for &lt;strong&gt;GPU compute&lt;/strong&gt; on datacenter &lt;strong&gt;Instinct&lt;/strong&gt; accelerators (and select consumer GPUs in community setups). Its objective mirrors &lt;strong&gt;CUDA&lt;/strong&gt; for NVIDIA: provide kernel compilers (&lt;strong&gt;HIP&lt;/strong&gt;), math libraries (rocBLAS, rocFFT), collective communication (&lt;strong&gt;RCCL&lt;/strong&gt;, analogous to &lt;strong&gt;NCCL&lt;/strong&gt;), and framework integrations so &lt;strong&gt;PyTorch&lt;/strong&gt; and inference runtimes can execute training and &lt;strong&gt;inference&lt;/strong&gt; on AMD hardware. ROCm is positioned as an open platform (Linux-first) for customers who want accelerator choice or who standardize on AMD in HPC and AI clusters.&lt;/p&gt;</description></item><item><title>TensorRT</title><link>https://lesitedefrancois.be/en/ai/tensorrt/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/tensorrt/</guid><description>&lt;p&gt;&lt;strong&gt;TensorRT&lt;/strong&gt; is NVIDIA’s SDK for &lt;strong&gt;optimizing and deploying&lt;/strong&gt; trained neural networks for &lt;strong&gt;inference&lt;/strong&gt; on NVIDIA &lt;strong&gt;GPUs&lt;/strong&gt;. Its objective is minimum latency and maximum throughput: it ingests a model (ONNX, TensorFlow, PyTorch export, or framework-specific parsers), applies graph optimizations (layer fusion, constant folding, kernel autotuning), selects precisions (&lt;strong&gt;FP32&lt;/strong&gt;, &lt;strong&gt;FP16&lt;/strong&gt;, &lt;strong&gt;INT8&lt;/strong&gt;, &lt;strong&gt;FP8&lt;/strong&gt;), and produces a &lt;strong&gt;serialized engine&lt;/strong&gt; executed by a lightweight runtime. For LLMs, &lt;strong&gt;TensorRT-LLM&lt;/strong&gt; extends this with attention-specific fusions, inflight batching, and multi-GPU serving patterns; many &lt;strong&gt;NIM&lt;/strong&gt; microservices bundle TensorRT-LLM–optimized engines rather than raw PyTorch loops.&lt;/p&gt;</description></item><item><title>Training</title><link>https://lesitedefrancois.be/en/ai/training/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/training/</guid><description>&lt;p&gt;&lt;strong&gt;Training&lt;/strong&gt; is the phase of machine learning where &lt;strong&gt;model parameters&lt;/strong&gt; are adjusted to minimize a &lt;strong&gt;loss&lt;/strong&gt; on a dataset. For deep learning, that means repeated &lt;strong&gt;forward passes&lt;/strong&gt; (compute predictions), &lt;strong&gt;backward passes&lt;/strong&gt; (propagate gradients via autodiff), and &lt;strong&gt;optimizer steps&lt;/strong&gt; (update weights)—from scratch pretraining, continued pretraining, or &lt;strong&gt;fine-tuning&lt;/strong&gt; (full, LoRA, or other parameter-efficient methods). The objective is model quality (accuracy, perplexity, task metrics) within a compute and time budget, not millisecond response to end users. Training jobs are batch-oriented: large minibatches, epochs over terabytes of tokens or images, checkpointing to durable storage, and experiment tracking. LLM training at scale uses &lt;strong&gt;distributed&lt;/strong&gt; strategies—data parallel, tensor parallel, pipeline parallel, and expert parallel for MoE—coordinated by frameworks such as PyTorch with FSDP or DeepSpeed.&lt;/p&gt;</description></item><item><title>vLLM</title><link>https://lesitedefrancois.be/en/ai/vllm/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://lesitedefrancois.be/en/ai/vllm/</guid><description>&lt;p&gt;&lt;strong&gt;vLLM&lt;/strong&gt; is an open-source library and serving stack for &lt;strong&gt;large language model (LLM) inference&lt;/strong&gt;. Its objective is to turn a trained model into a production service that sustains many concurrent users with low latency and high &lt;strong&gt;tokens per second&lt;/strong&gt; per GPU. vLLM targets the inference phase (prefill + decode), not training: it loads weights onto accelerators, batches incoming prompts, schedules decode steps, and streams completions back to clients over HTTP/gRPC (often via an OpenAI-compatible API). It has become a de facto engine behind many private and cloud AI gateways because it ships integrations for Hugging Face models, LoRA adapters, tensor parallelism, pipeline parallelism, speculative decoding, and quantization (GPTQ, AWQ, FP8).&lt;/p&gt;</description></item></channel></rss>