{ "id": "reliability-block-single-queue", "schemaVersion": 2, "title": { "ja": "並列化した入口とワーカー — 単一キューが全経路を止める", "en": "Redundant Gateways and Workers — One Queue Stops Every Path" }, "summary": { "ja": "直列のキューと並列の入口・ワーカー群を故障経路図で示す。二重化した末端だけでは、共有する単一キューの停止に耐えない", "en": "A reliability block diagram with serial queueing and parallel gateway and worker groups. Duplicated endpoints cannot tolerate failure of the one shared queue." }, "capturedAt": "2026-09-25", "categories": [ "presentation" ], "tags": [ "data-viz", "minimal" ], "useCases": [ "architecture", "testing" ], "format": "slide-16x9", "density": "medium", "layout": { "kind": "flow", "canvas": { "w": 1920, "h": 1080 }, "margin": { "top": 82, "right": 120, "bottom": 82, "left": 120 } }, "type": { "title": { "size": 44, "weight": 700, "tracking": "0.01em" }, "subtitle": { "size": 22, "weight": 400 }, "groupLabel": { "size": 20, "weight": 500 }, "nodeLabel": { "size": 23, "weight": 700 }, "singleLabel": { "size": 24, "weight": 700 }, "singleMeta": { "size": 20, "weight": 500 }, "edgeLabel": { "size": 20, "weight": 500 }, "legendTitle": { "size": 22, "weight": 700 }, "legendBody": { "size": 20, "weight": 400 }, "conclusion": { "size": 26, "weight": 500 } }, "colors": { "ground": "#FFFFFF", "surface": "#F4F6F9", "ink": "#131820", "muted": "#667183", "accent": "#1F5FA8", "rule": "#DBE1E9", "series": [ "#2F6FB5", "#A85A2E", "#1C8C79" ] }, "rules": [ { "ja": "直列の要素は処理経路のすべてで必要である。1つが停止するとその経路は完了しない", "en": "Every element in a series path is required; failure of one prevents that path from completing." }, { "ja": "並列の要素はどれか1系統で役割を果たす構成として読む。共有する故障要因や切替不良は別途検証する", "en": "Read each parallel group as able to serve through any one path. Shared failure causes and failover behavior require separate analysis." }, { "ja": "複数の経路が共有する単一キューを強調する。後段の台数だけを数えると端から端の可用性を見誤る", "en": "Emphasize the single queue shared by every route. Counting only downstream replicas overstates end-to-end availability." }, { "ja": "架空の構成例であり、稼働率や独立故障の数値を表していない", "en": "This is a fictional topology; it does not claim availability or independent-failure probabilities." } ], "cover": "https://design-vault.pages.dev/_astro/cover.zQuvTq4b.png", "assets": [], "shortlist": false, "status": "published", "relations": { "similar": [] }, "license": "Original", "publishedAt": null, "reproduction": { "spec": { "format": "slide-16x9", "density": "medium", "layout": { "kind": "flow", "canvas": { "w": 1920, "h": 1080 }, "margin": { "top": 82, "right": 120, "bottom": 82, "left": 120 } }, "type": { "title": { "size": 44, "weight": 700, "tracking": "0.01em" }, "subtitle": { "size": 22, "weight": 400 }, "groupLabel": { "size": 20, "weight": 500 }, "nodeLabel": { "size": 23, "weight": 700 }, "singleLabel": { "size": 24, "weight": 700 }, "singleMeta": { "size": 20, "weight": 500 }, "edgeLabel": { "size": 20, "weight": 500 }, "legendTitle": { "size": 22, "weight": 700 }, "legendBody": { "size": 20, "weight": 400 }, "conclusion": { "size": 26, "weight": 500 } }, "colors": { "ground": "#FFFFFF", "surface": "#F4F6F9", "ink": "#131820", "muted": "#667183", "accent": "#1F5FA8", "rule": "#DBE1E9", "series": [ "#2F6FB5", "#A85A2E", "#1C8C79" ] }, "rules": [ "Every element in a series path is required; failure of one prevents that path from completing.", "Read each parallel group as able to serve through any one path. Shared failure causes and failover behavior require separate analysis.", "Emphasize the single queue shared by every route. Counting only downstream replicas overstates end-to-end availability.", "This is a fictional topology; it does not claim availability or independent-failure probabilities." ] }, "prompt": { "ja": "以下の仕様でスライドを 1 枚作ってください。\n\n- 版面 1920 × 1080\n- 余白 上 82 右 120 下 82 左 120\n\n## 文字（版面 1920px に対する px）\ntitle 44px / 700 / 字間 0.01em\nsubtitle 22px / 400\ngroupLabel 20px / 500\nnodeLabel 23px / 700\nsingleLabel 24px / 700\nsingleMeta 20px / 500\nedgeLabel 20px / 500\nlegendTitle 22px / 700\nlegendBody 20px / 400\nconclusion 26px / 500\n\n## 配色\n地 #FFFFFF / 面 #F4F6F9 / 文字 #131820 / 補助 #667183 / 強調 #1F5FA8 / 罫 #DBE1E9 / #2F6FB5 / #A85A2E / #1C8C79\n\n## 外すと崩れる点\n- 直列の要素は処理経路のすべてで必要である。1つが停止するとその経路は完了しない\n- 並列の要素はどれか1系統で役割を果たす構成として読む。共有する故障要因や切替不良は別途検証する\n- 複数の経路が共有する単一キューを強調する。後段の台数だけを数えると端から端の可用性を見誤る\n- 架空の構成例であり、稼働率や独立故障の数値を表していない\n\n内容は［ここに自分の内容を書く］に置き換えてください。寸法と配色はそのまま守ってください。\n正確に再現する場合は、この HTML をそのまま使ってください: https://design-vault.pages.dev/designs/reliability-block-single-queue/pattern.html", "en": "Produce one slide to the following specification.\n\n- Canvas 1920 × 1080\n- Margin top 82 right 120 bottom 82 left 120\n\n## Type (px against a 1920px canvas)\ntitle 44px / 700 / tracking 0.01em\nsubtitle 22px / 400\ngroupLabel 20px / 500\nnodeLabel 23px / 700\nsingleLabel 24px / 700\nsingleMeta 20px / 500\nedgeLabel 20px / 500\nlegendTitle 22px / 700\nlegendBody 20px / 400\nconclusion 26px / 500\n\n## Colour\nGround #FFFFFF / Surface #F4F6F9 / Ink #131820 / Muted #667183 / Accent #1F5FA8 / Rule #DBE1E9 / #2F6FB5 / #A85A2E / #1C8C79\n\n## Constraints — dropping these breaks it\n- Every element in a series path is required; failure of one prevents that path from completing.\n- Read each parallel group as able to serve through any one path. Shared failure causes and failover behavior require separate analysis.\n- Emphasize the single queue shared by every route. Counting only downstream replicas overstates end-to-end availability.\n- This is a fictional topology; it does not claim availability or independent-failure probabilities.\n\nReplace the content with [your content]. Keep the measurements and colours as given.\nFor an exact reproduction, use the verbatim HTML at https://design-vault.pages.dev/designs/reliability-block-single-queue/pattern.html." }, "code": { "html": "\n\n並列化した入口とワーカー — 単一キューが全経路を止める\n\n\n\n \n \n \n \n \n \n \n \n \n 並列化した入口とワーカー — 単一キューが全経路を止める\n 架空のイベント処理基盤 / 直列の工程はすべて必要、並列の組はどれか1系統で通過\n \n\n 入口プール · いずれか1台\n ワーカープール · いずれか1台\n イベント\n\n \n \n \n \n \n \n \n 入口 A\n 入口 B\n OR\n\n \n \n \n \n キュー\n 1系統 · 単一障害点\n\n \n \n \n \n \n \n \n ワーカー A\n ワーカー B\n OR\n\n \n \n \n \n \n \n 結果先 A\n 結果先 B\n OR\n \n \n \n 応答\n\n \n 読み方\n \n 直列の1ブロックが停止すると、後段へ進めない\n \n 並列の組はどれか1系統で処理を続けられる想定\n 入口とワーカーを二重化しても、共有キューが止まればイベント処理は止まる。\n \n\n", "url": "https://design-vault.pages.dev/designs/reliability-block-single-queue/pattern.html", "fonts": [ "https://design-vault.pages.dev/designs/reliability-block-single-queue/font.css", "https://design-vault.pages.dev/designs/reliability-block-single-queue/font-0.woff2", "https://design-vault.pages.dev/designs/reliability-block-single-queue/font-1.woff2", "https://design-vault.pages.dev/designs/reliability-block-single-queue/font-2.woff2" ] } }, "urls": { "ja": "https://design-vault.pages.dev/designs/reliability-block-single-queue", "en": "https://design-vault.pages.dev/en/designs/reliability-block-single-queue" }, "notesMarkdown": "この図はイベント処理の「成功経路」をブロックで表したもの。入口・ワーカー・結果先はそれぞれ\nどれか1台で処理できる並列群だが、すべての要求は同じキューを通る。\n\nそのため入口やワーカーを増やしても、キューが止まれば後段へ進めない。現実の可用性を計算する\nには共通電源・ネットワーク・ソフトウェア障害や切替動作も確認する必要があり、この図は構造上の\n単一障害点を読むための架空例に限る。" }