ベンチマークモデル
dispatchatlas.bench は、ソルバーやキャンペーンが消費する前にベンチマーク証拠を定義します。
ベンチマークファミリは、その分類法、ドメインプロファイル、プロファイルクラス、前提、引用
証拠、スケールエンベロープ、シード名前空間、および出力スキーマを宣言します。具現化は生成
された各問題を dispatchatlas.core で検証し、インスタンスを特徴づけ、来歴エンベロープで
包み、安定ハッシュを記録します。
カタログは、汎用の組合せ-最適化スケジューリングファミリと distributed-computing スケジ ューリングをco-equalな同位として網羅するため、プラットフォームは distributed-computing 専用ツールではありません。
実行可能な例: examples/benchmark_continuum.py は連続体ベンチマークアトラスをその場で生成・特徴づけ・カタログ化します。
スケジューリングファミリ
各スケジューリングファミリは、少なくとも1つの生成器プロファイルを持つ一級カタログ同位と して具現化されます。下のカタログ表はベンチマーク生成器レジストリと引用マトリクスから生成 されるため、そのファミリ合計とソース引用は行そのものから数えられます。表の上にあるファミリ分布グラフは、ファミリプロファイルがスケジューリングファミリのカテゴリにどのように分布しているかを示します。
Generated from the benchmark generator registry and the citation matrix: 69 family profiles across 8 scheduling families — distributed-computing (47), flow-shop (7), job-shop (6), machine-scheduling (3), open-shop (1), rcpsp (3), rcpsp-max (1), setup-flow-shop (1).
Showing 69 of 69 family profiles.
| Distinctive against | Evidence | Citation status | Source citations | |||
|---|---|---|---|---|---|---|
accelerator-coschedulingaccelerator-coscheduling a heterogeneous datacenter job needs a compute resource and a scarce accelerator at the same time, so every job co-allocates two simultaneous resource demands held together for its whole run; the accelerator pool is scarce, so jobs sharing an accelerator serialize on it while jobs on disjoint resources run in parallel, and the scheduler reasons over a multi-resource co-allocation problem rather than a single-unit-demand one | distributed-computing | ioe-complete | published single-resource continuum schedulers (one unit resource demand per task, not the simultaneous co-allocation of a compute resource and a scarce accelerator held together under a Pareto contract) | smoke | citation-backed |
|
aerial-edgeaerial-edge a loitering UAV is a flying fog node that serves the ground region beneath it for a fixed loiter window before moving to the next pass, so sorties group into successive loiter passes pinned to the fog tier the platform embodies while overhead | distributed-computing | ioe-complete | aerial-edge MEC simulators (no flying-fog loiter placement) | smoke | citation-backed |
|
anytime-inferenceanytime-inference an edge accelerator serves deep-learning inference requests that each complete a mandatory minimal-accuracy early-exit branch and may run an optional refinement to full accuracy when their latency deadline allows; every request declares a mandatory duration below its full duration and a tight latency deadline, and arrivals are spaced shorter than a full inference so requests queue and contend, so the scheduler decides which requests refine and which deliver the early-exit result -- an imprecise-computation quality-versus-timeliness trade-off | distributed-computing | ioe-complete | published edge-cloud split inference and datacenter inference serving (a fixed full-accuracy computation per request), neither of which lets a request drop an optional refinement to meet its deadline so the schedule order trades accuracy for timeliness | smoke | citation-backed |
|
blocking-flow-shopblocking-flow-shop | flow-shop | classical | — | smoke | citation-backed |
|
bulk-synchronous-graphbulk-synchronous-graph an iterative graph computation runs as a sequence of supersteps separated by global barriers, so each superstep's vertex partitions compute and exchange messages and every partition of the next superstep waits on all partitions of the prior one; the slowest partition therefore gates each superstep, and the scheduler reasons over a barrier-synchronized partition-balancing problem rather than an overlap-friendly pipeline or an independent-task one | distributed-computing | ioe-complete | published pipeline or independent-task schedulers (an overlap-friendly wavefront or unsynchronized tasks, not supersteps separated by global barriers where the slowest partition gates each round under a Pareto contract) | smoke | citation-backed |
|
carbon-awarecarbon-aware flexible jobs defer to low-carbon-intensity windows under a time-varying grid carbon signal while honoring their SLA deadlines | distributed-computing | ioe-complete | Electricity-Maps grid carbon-intensity and CityLearn carbon-aware community signals | smoke | citation-backed |
|
cloud-independentcloud-edge-independent | distributed-computing | domain-specific | — | smoke | citation-backed |
|
coflow-schedulingcoflow-scheduling a distributed-computing stage completes only when the last network transfer of its coflow lands, not the first, so a coflow's completion time is the maximum over its member flows; every coflow emits data-heavy flow tasks that place freely across the fabric plus a barrier task that depends on all of them, so the barrier gates the group and the coflow-completion-time is an all-or-nothing footprint | distributed-computing | ioe-complete | datacenter coflow schedulers (no continuum tier-placement barrier) | smoke | citation-backed |
|
compact-job-shopcompact-job-shop | job-shop | classical | — | smoke | citation-backed |
|
confidential-edgeconfidential-edge tasks are classified by data sensitivity -- a confidential task that touches protected data must execute inside the enclave-capable trusted tier so its data never leaves the trusted boundary, while a public task draws a free placement affinity across the fabric | distributed-computing | ioe-complete | edge enclave runtimes (no security-classified Pareto placement) | smoke | citation-backed |
|
cyber-physicalcyber-physical control cycles arrive periodically under a time-varying tariff | distributed-computing | ioe-complete | periodic hard-real-time task models and smart-grid demand-side scheduling formulations (no edge-fog-cloud tier placement under a Pareto contract) | smoke | citation-backed |
|
data-localitydata-locality a query over a large dataset is cheaper to run where the data already resides than to ship the data across the WAN fabric; each task's input lives on one tier (edge sensor logs, fog warm aggregates, or cloud cold archives) and the task pins to that tier so its heavy input never crosses the fabric, with the data tiers cycled so placement spans the whole edge-fog-cloud continuum | distributed-computing | ioe-complete | cluster locality schedulers (no continuum data-residency placement) | smoke | citation-backed |
|
datacenter-colocationdatacenter-colocation latency-sensitive service jobs and deferrable batch jobs share multi-tenant cells, so high-priority-band jobs claim capacity ahead of low-band jobs under contention | distributed-computing | ioe-complete | Google Borg ClusterData2019 priority-tiered cell traces | smoke | citation-backed |
|
digital-twin-syncdigital-twin-sync each physical asset periodically syncs its state to its fog/cloud twin and must finish within a freshness (Age-of-Information) window before the twin's state goes stale | distributed-computing | ioe-complete | digital-twin edge frameworks (no joint Pareto placement) | smoke | citation-backed |
|
disaggregated-memorydisaggregated-memory a CXL-pooled cloud platform backs each socket with a small local DRAM tier and a shared far-memory pool, and every VM draws a long-tailed memory working set, so a few memory-hungry tenants dominate a socket's local budget while far-memory access inflates a VM's runtime in proportion to the working set it spills to the pool; the scheduler reasons over local-versus-pool placement rather than core-count placement | distributed-computing | ioe-complete | published CXL memory-pooling and tiered-memory systems (socket-local page placement, no edge-fog-cloud tier scheduling under a Pareto contract) | smoke | citation-backed |
|
distributed-assembly-flow-shopdistributed-assembly-flow-shop | flow-shop | classical | — | smoke | citation-backed |
|
distributed-flexible-job-shopdistributed-flexible-job-shop | job-shop | structurally-complex | — | smoke | citation-backed |
|
distributed-permutation-flow-shopdistributed-permutation-flow-shop | flow-shop | classical | — | smoke | citation-backed |
|
distributed-training-gangdistributed-training-gang a GPU cluster runs synchronous data-parallel training jobs; each job is a gang of workers that must START TOGETHER on distinct accelerators (every all-reduce step synchronizes the workers), so a job cannot begin until enough accelerators are free simultaneously; the workers reuse the accelerator pool and jobs arrive over time, so jobs queue and the scheduler decides which job acquires a full simultaneously-free worker set first -- an all-or-nothing gang co-start, not an independent placement of each worker | distributed-computing | ioe-complete | published GPU-cluster and inference-serving families that place each task independently; none requires a whole job's worker set to co-start simultaneously on distinct accelerators, so no other family forbids a partial start -- the gang-scheduling all-or-nothing constraint under a Pareto contract | smoke | citation-backed |
|
distributed-transactiondistributed-transaction a partitioned database runs transactions that each acquire exclusive locks on a variable read/write set of data shards, so every transaction co-allocates a randomly drawn subset of shards held together for its whole run; two transactions whose shard sets intersect serialize while disjoint transactions commit in parallel, so the scheduler reasons over a variable-cardinality lock-conflict graph rather than a fixed two-resource hold | distributed-computing | ioe-complete | published replica-placement schedulers (a single shard pinned per task for locality, not a variable-cardinality exclusive lock set co-allocated per transaction forming a conflict graph under a Pareto contract) | smoke | citation-backed |
|
edge-offloadingedge-offloading-mec each task chooses between local edge execution and remote offload | distributed-computing | ioe-complete | iFogSim MEC offloading scenarios | smoke | citation-backed |
|
edge-placementedge-placement services place on edge servers near their user population and migrate as demand shifts across base-station coverage cells | distributed-computing | ioe-complete | EUA edge-user-allocation and Shanghai-Telecom base-station placement traces | smoke | citation-backed |
|
elastic-serverless-autoscaleelastic-serverless-autoscale a serverless platform serves function invocations on a shared worker pool, and every invocation is moldable: it may run on one, two, or four concurrent workers, where a wider allocation runs shorter by a sublinear speedup but spends more total worker-seconds; each request declares its execution modes and arrivals are spaced shorter than a base invocation so the pool is contended, so the scheduler picks each invocation's worker width -- a moldable latency-versus-cost choice rather than a fixed resource hold | distributed-computing | ioe-complete | published serverless cold-start and fixed-width co-allocation families (accelerator co-scheduling, fpga partitioning), each of which holds one fixed resource set per task; none lets a request choose among several worker-count modes so the schedule order trades latency for resource cost under a Pareto contract | smoke | citation-backed |
|
facility-assignmentfacility-assignment | machine-scheduling | classical | — | smoke | citation-backed |
|
failure-recoveryfailure-recovery a failed task re-places its checkpoint state to a surviving tier | distributed-computing | ioe-complete | Borg cluster failure-event traces | smoke | citation-backed |
|
federated-learningfederated-learning each training round selects a subset of heterogeneous, straggler-prone edge clients that train on non-IID local data, then a fog or cloud aggregator combines their updates | distributed-computing | ioe-complete | FedScale and Oort federated-learning device-participation benchmarks | smoke | citation-backed |
|
flexible-job-shopflexible-job-shop | job-shop | classical | — | smoke | citation-backed |
|
flow-shoppermutation-flow-shop | flow-shop | classical | — | smoke | citation-backed |
|
fpga-partitioningfpga-partitioning a multi-tenant reconfigurable FPGA hosts tenant kernels that each occupy a contiguous region of fabric tiles, so every kernel co-allocates a contiguous run of tiles held together for its whole residency; two kernels whose tile intervals overlap cannot be co-resident and serialize while kernels on disjoint tile spans run in parallel, so the scheduler reasons over an interval-overlap conflict graph rather than a fixed two-resource hold or a random-subset lock set | distributed-computing | ioe-complete | published accelerator co-scheduling (a fixed compute-plus-accelerator pair) and shard-lock transactions (a random subset of resources), neither of which constrains the co-allocated set to a spatially contiguous tile interval whose overlaps form an interval conflict graph under a Pareto contract | smoke | citation-backed |
|
frontierco-fjspfrontierco-fjsp | job-shop | classical | — | smoke | citation-backed |
|
generative-inference-servinggenerative-inference-serving a transformer inference replica batches autoregressive requests that each hold key-value-cache memory proportional to their token count for the whole decode, so a long-tailed sequence mix fragments a fixed cache budget and the scheduler reasons over memory-bound admission rather than GPU-count placement; every request's decode duration and KV-cache demand scale with its drawn token count | distributed-computing | ioe-complete | published single-replica generative-model serving systems (no edge-fog-cloud tier placement under a Pareto contract) | smoke | citation-backed |
|
gpu-mlgpu-ml training and inference jobs claim accelerators and gang-schedule replicas | distributed-computing | ioe-complete | Alibaba PAI, Philly, and Helios GPU-cluster traces | smoke | citation-backed |
|
hybrid-flow-shophybrid-flow-shop | flow-shop | classical | — | smoke | citation-backed |
|
immersive-xrimmersive-xr each extended-reality frame runs a latency-critical perception, render, and display pipeline placed across the device, edge, and cloud within a hard motion-to-photon deadline | distributed-computing | ioe-complete | ILLIXR extended-reality systems testbed | smoke | citation-backed |
|
intermittent-edgeintermittent-edge a batteryless sensor harvests ambient energy into a small buffer, runs until the buffer depletes, then sleeps to recharge; a job too large for one duty-cycle window is checkpointed at power loss and resumed in the next, so it is a precedence chain of edge-pinned per-window segments each bounded by the constant energy window | distributed-computing | ioe-complete | intermittent-computing runtimes (no continuum energy-window placement) | smoke | citation-backed |
|
iot-edgeiot-edge many small sensor readings arrive periodically and aggregate at the edge | distributed-computing | ioe-complete | published wireless-sensor-network telemetry datasets and in-network aggregation deployments (raw sensor readings, not edge-fog-cloud tier scheduling under a Pareto contract) | smoke | citation-backed |
|
job-shopjob-shop | job-shop | classical | — | smoke | citation-backed |
|
kv-cache-placementkv-cache-placement a distributed key-value cache tier serves a catalog of cache objects whose request rate follows a heavy Zipfian popularity skew, so a few hot objects absorb most of the traffic; each object is placement-flexible, carrying one single-node mode per cache-tier node, so the scheduler chooses which tier node hosts it, and an object's working set -- the transfer volume staged onto its host tier -- scales with its popularity rank, so the hottest object carries the largest working set and a cold-tail object the smallest; a naive uniform placement strands a hot, large-working-set object on a far tier and pays its transfer across the fabric, while a locality-aware placement pins the hottest objects to near tiers to shrink makespan and cost | distributed-computing | ioe-complete | published cache and content-placement families (consistent-hashing replica placement, CDN content distribution) that place each object uniformly or by a hash; none scales each object's working set with a Zipfian popularity rank so the hot objects carry a strictly larger transfer volume, making popularity-skewed near-tier pinning the lever a locality-aware placement pulls under the Pareto contract | smoke | citation-backed |
|
machine-schedulingmachine-scheduling-unrelated | machine-scheduling | classical | — | smoke | citation-backed |
|
microservice-dagmicroservice-dag services form an acyclic call graph pinned by role to a tier | distributed-computing | ioe-complete | Alibaba v2021 microservice-trace call graphs | smoke | citation-backed |
|
mixed-criticalitymixed-criticality a safety-critical real-time mix runs tasks of differing criticality, and a high-criticality task is budgeted with a conservative high-assurance worst-case execution time and a tight deadline while a low-criticality task carries a smaller best-effort budget and a loose deadline, so the criticality tiering lives in the duration and deadline structure; the scheduler reasons over which assured-criticality tasks to guarantee under contention rather than a uniform-assurance deadline-scheduling one | distributed-computing | ioe-complete | published uniform-assurance real-time deadline schedulers (one worst-case execution time and deadline class per task, not criticality-tiered WCET budgets with tighter high-assurance deadlines under a Pareto contract) | smoke | citation-backed |
|
moe-expert-parallelmoe-expert-parallel a sparsely-activated mixture-of-experts model routes each token batch to one expert and the experts are spread across devices, and expert popularity is long-tailed, so a few hot experts receive most token batches while many stay cold and the all-to-all routing exchange dominates fabric traffic; the scheduler reasons over an expert-placement and load-balancing problem rather than a dense uniform-replica serving one | distributed-computing | ioe-complete | published dense generative-model serving systems (uniform per-replica KV-cache admission, not sparse token-to-expert routing under load imbalance and a Pareto contract) | smoke | citation-backed |
|
multi-objective-pfspmulti-objective-pfsp | flow-shop | classical | — | smoke | citation-backed |
|
multi-project-rcpspmulti-project-rcpsp | rcpsp | structurally-complex | — | smoke | citation-backed |
|
multi-tenant-fair-sharemulti-tenant-fair-share a shared cluster serves several tenants whose workloads compete for one node pool; each task is placement-flexible, carrying one single-node mode per pool node, so the scheduler chooses which node it occupies; tenants are sized asymmetrically, so even a load-balanced placement leaves the heavy tenants holding a larger fraction of their busiest node -- a higher dominant resource share -- than the light ones, and a fairness-aware scheduler rebalances placement to shrink the dominant-share spread | distributed-computing | ioe-complete | published multi-tenant colocation families (Borg-style priority colocation, vm allocation) that fix each task's resource and score makespan or cost; none lets the scheduler choose each tenant task's node and scores the dominant-resource-share spread between tenants as a fairness objective | smoke | citation-backed |
|
network-slicingnetwork-slicing isolated slice classes (latency-critical, broadband, massive-IoT) each carry their own service-level deadline and placement, and same-class slices spread across tiers for resilience | distributed-computing | ioe-complete | 5G slicing orchestration (no joint Pareto placement) | smoke | citation-backed |
|
no-wait-flow-shopno-wait-flow-shop | flow-shop | classical | — | smoke | citation-backed |
|
open-shopopen-shop | open-shop | classical | — | smoke | citation-backed |
|
orbital-edgeorbital-edge tasks schedule across ground terminals, moving low-earth-orbit satellites, and cloud backhaul under time-varying connectivity as satellites enter and leave coverage and hand work over | distributed-computing | ioe-complete | LENS real-measurement LEO satellite-network traces | smoke | citation-backed |
|
pipeline-parallel-trainingpipeline-parallel-training a deep network is split into successive pipeline stages pinned across edge-to-cloud tiers and the training mini-batch is divided into micro-batches, so each micro-batch flows forward stage by stage while each stage runs its micro-batches in issue order; the two precedence families form a diagonal wavefront whose warm-up and cool-down idle slots are the pipeline bubbles, and deeper stages carry rising compute, so the scheduler reasons over a stage-partition and bubble-minimizing problem rather than a synchronous data-parallel all-reduce one | distributed-computing | ioe-complete | published data-parallel / gang-scheduled training systems (synchronous all-reduce over co-located replicas, not a stage-by-micro-batch pipeline wavefront with warm-up and cool-down bubbles under a Pareto contract) | smoke | citation-backed |
|
rcpsprcpsp-renewable | rcpsp | structurally-complex | — | smoke | citation-backed |
|
rcpsp-maxrcpsp-max | rcpsp-max | structurally-complex | — | smoke | citation-backed |
|
rcpsp-multi-modercpsp-multi-mode | rcpsp | structurally-complex | — | smoke | citation-backed |
|
reentrant-fabreentrant-fab | job-shop | structurally-complex | — | smoke | citation-backed |
|
replica-placementreplica-placement a replica runs where its data shard already lives | distributed-computing | ioe-complete | CRUSH replicated-data placement | smoke | citation-backed |
|
serverless-cold-startserverless-cold-start a cold invocation pays a container provisioning penalty | distributed-computing | ioe-complete | Azure Functions serverless-in-the-wild traces | smoke | citation-backed |
|
service-function-chainservice-function-chain an NFV packet flow traverses a linear ordered chain of typed virtual network functions -- firewall, intrusion detection, deep packet inspection, address translation -- each pinned to a tier that hosts its function type, so the chain is a strict total order and the flow crosses the edge-fog-cloud fabric in a fixed sequence; the scheduler reasons over a chain-placement problem under an end-to-end latency budget rather than the branching role-pinned call graph of a microservice | distributed-computing | ioe-complete | published microservice call-graph schedulers (a branching role-pinned acyclic call graph, not a strict linear chain of function-typed network functions under an end-to-end latency budget and a Pareto contract) | smoke | citation-backed |
|
setup-flow-shopsetup-flow-shop | setup-flow-shop | classical | — | smoke | citation-backed |
|
smartnic-offloadsmartnic-offload a SmartNIC-accelerated server pairs a fast host CPU with a low-power on-NIC processor, and every microservice draws a long-tailed compute intensity, so most are light enough to offload onto the energy-frugal NIC cores while a few compute-heavy services must stay host-bound; a service's runtime scales with its intensity, so the scheduler reasons over an energy-versus-latency offload-placement problem rather than a uniform host placement one | distributed-computing | ioe-complete | published mobile-edge computation-offloading models (device-to-edge latency offload, not in-server host-to-NIC energy offload under a Pareto contract) | smoke | citation-backed |
|
split-inference-servingsplit-inference-serving each inference request partitions a deep model at a layer cut -- a light head runs the early layers on the edge near the sensor and a heavy tail runs the later layers in the cloud, consuming the head's intermediate feature map under a per-request end-to-end latency SLO | distributed-computing | ioe-complete | datacenter inference serving (no edge-cloud partition placement) | smoke | citation-backed |
|
spot-preemptiblespot-preemptible a cloud provider rents idle capacity at a discount as revocable spot instances reclaimed after a short lease; eviction-tolerant batch work pins to the cloud spot tier under a hard lease deadline (the eviction horizon), while latency-critical interactive work pins to the stable edge on-demand tier with no eviction deadline | distributed-computing | ioe-complete | cloud spot schedulers (no continuum eviction-deadline placement) | smoke | citation-backed |
|
storage-io-tieringstorage-io-tiering a tiered storage pool serves I/O-bound jobs whose runtime is dominated by moving a job's I/O volume through the storage node it lands on; each job is placement-flexible, carrying one single-node mode per tier node, and the mode duration is tier-dependent -- a seek floor plus the I/O volume divided by that tier's I/O bandwidth, which differs by tier (a fast cloud array sustains far more bytes/second than a slow edge disk); a job's I/O volume follows a heavy-tailed falloff over its I/O-demand rank, so a few I/O-heavy jobs carry most of the bytes and have a large cross-tier duration spread, while the light tail barely varies; a naive placement strands an I/O-heavy job on a low-bandwidth tier and pays its volume slowly, while a bandwidth-aware placement pins the heavy jobs to fast tiers to shrink makespan and cost | distributed-computing | ioe-complete | published storage-tiering and hierarchical-storage-management families that migrate blocks between fast and slow tiers by access frequency; none models the heterogeneous-tier I/O bandwidth as a placement-flexible per-tier mode whose duration is the I/O volume divided by that tier's bandwidth, so an I/O-heavy job's cross-tier duration spread is the bottleneck-relief lever a bandwidth-aware placement pulls under the Pareto contract | smoke | citation-backed |
|
streaming-windowstreaming-window events arrive online in bounded windows and must close within one | distributed-computing | ioe-complete | Parallel Workloads Archive online arrivals | smoke | citation-backed |
|
time-sensitive-networkingtime-sensitive-networking each time-triggered flow releases on a fixed period and must finish within one cycle under a hard, jitter-free deadline | distributed-computing | ioe-complete | EdgeCloudSim best-effort scenarios (no gating) | smoke | citation-backed |
|
unrelated-parallel-setupunrelated-parallel-setup | machine-scheduling | structurally-complex | — | smoke | citation-backed |
|
vehicular-offloadingvehicular-offloading a vehicle's tasks share an arrival time and a roadside-unit dwell deadline, and hand over from the roadside unit to the fog tier as the vehicle drives on | distributed-computing | ioe-complete | EdgeCloudSim / SUMO vehicular-edge mobility scenarios | smoke | citation-backed |
|
video-analyticsvideo-analytics each camera streams frames that must be analyzed within a tight real-time latency bound, placed hierarchically with edge inference near the camera and cloud aggregation | distributed-computing | ioe-complete | edge video-analytics clusters (no joint Pareto placement) | smoke | citation-backed |
|
vm-allocationvm-allocation size-heterogeneous virtual-machine deployments pack onto hosts while each deployment's members spread across distinct failure domains for availability | distributed-computing | ioe-complete | Azure Public Dataset Resource Central VM-allocation traces | smoke | citation-backed |
|
workflow-dagworkflow-dag | distributed-computing | structurally-complex | — | smoke | citation-backed |
|
Per-instance characterization and download eligibility live in the benchmark catalog; this table is the family-and-citation inventory.
上のコンポーネントは完全な生成インベントリを担います——下の古典および distributed-computing コアファミリに加え、Edge–Fog–Cloud ファミリの連続体です。それらの基礎的コアファミリを ドキュメント形式で:
| ファミリ | プロファイル | プロファイルクラス | 主要コーパス |
|---|---|---|---|
| 機械スケジューリング(R||Cmax、非関連機械) | machine-scheduling-unrelated | classical | OR-Library |
| Job-shop | job-shop-classical | classical | OR-Library, Taillard |
| 柔軟 job-shop(FJSP) | flexible-job-shop | classical | Brandimarte; Hurink-Jurisch-Thole |
| 順列フローショップ | permutation-flow-shop | classical | Taillard |
| 順序依存セットアップフローショップ(SDST) | setup-flow-shop | classical | Allahverdi et al. (2008); Allahverdi (2015) |
| 資源制約プロジェクトスケジューリング(RCPSP) | rcpsp-renewable | structurally-complex | PSPLIB |
| Distributed-computing(cloud/edge) | cloud-edge-capacity | domain-specific | CloudSim; DynamicCloudSim; Edge vision |
| Distributed-computing(workflow DAG) | workflow-dag | structurally-complex | Standard Task Graph Set |
非関連機械および柔軟 job-shop ファミリは各インスタンスに CostModel 実行時間マトリクスを
付加し、問題 JSON と共に具現化マトリクスとしてエクスポートします。順序依存セットアップ
フローショップファミリは代わりに CostModel セットアップマトリクスを付加します:機械上で
異なるファミリのジョブ間の切替はセットアップ時間を要するため、セットアップ目的は類似ジョブ
のグループ化を報います。挙げられた具名の標準コーパスは引用とリンクのみで、リポジトリ内で
再配布されることは決してありません。
いくつかの連続体ファミリはマルチ-資源協調割当を行使します:各タスクは同時に複数の資源を
要求し、コンストラクタはその全期間それらを一緒に保持します(ドメイン契約
を参照)。accelerator-coscheduling ファミリはジョブごとに計算ノードと希少アクセラレータ
を協調割当します;distributed-transaction ファミリはトランザクションごとにデータシャード
の可変-基数ロックセットを協調割当します;そして fpga-partitioning ファミリはテナント
カーネルごとに再構成可能ファブリックタイルの空間的に連続した連なりを協調割当します。資源
集合が交差するタスクは直列化し、互いに素なタスクは並行して走ります——実行可能な
examples/inspect_coallocation.py
がそのレバーを明示します。
協調割当を超えて、3つの連続体ファミリがそれぞれ独自の構造的レバーを行使します。
elastic-serverless-autoscale ファミリは成形可能実行を行使します:各関数呼出は複数の
実行モードを宣言します——狭い在宅のみモードと、より早く終えるために小さな共有バースト
プールから worker を借りる広いモード——そのためスケジュールはタスクごとに1モードを選び、
順序がどの呼出が希少な広-かつ-速モードを獲得するかを決めます。distributed-training-gang
ファミリはギャング協調スケジューリングを行使します:同期データ-並列訓練ジョブの workers
はギャングを共有し、オール・オア・ナッシングの起動で異なるアクセラレータ上で共起動せねば
なりません——workers はアクセラレータプールを再利用しジョブは時間とともに到着するため、
十分なアクセラレータが同時に空くまでジョブは開始できず、順序がどのジョブが最初にその完全な
worker 集合を獲得するかを決めます。multi-tenant-fair-share ファミリは支配-資源公平性を
行使します:複数の非対称-規模のテナントが共有ノードプール上に配置-柔軟なタスクを置き、
支配-資源-シェア目的が最も多く-および最も少なく-供給されたテナントの支配シェア間の広がりを
採点します——そのため配置、すなわち各テナントがどの資源を占めるかが、それを均衡させるか歪め
るレバーです。実行可能な
examples/serverless_autoscale_study.py、
examples/distributed_training_gang_study.py、
および
examples/multi_tenant_fairshare_study.py
がこれら3つのレバーを明示します。
プロファイルクラス
| プロファイルクラス | 意味 |
|---|---|
classical | 標準的な組合せ-最適化コーパスから派生する。 |
structurally-complex | 優先順位、DAG、または資源-ネットワーク構造を持つ。 |
ioe-complete | Internet-of-Everything-完全な分散シナリオ。 |
trace-backed | 具名の実世界ワークロードトレースに基づく。 |
domain-specific | 単一の運用ドメインに合わせて調整。 |
証拠ラベル
| ラベル | 用途 |
|---|---|
smoke | テスト、例、ドキュメント、プレビュー用の小さな決定論的インスタンス。 |
exploratory | まだ引用-裏付けも完全な特徴づけもされていない妥当な素材。 |
| 候補証拠グレード | パイロット、統計、キャンペーンゲートを待つ引用-裏付け素材。 |
| 完全キャンペーン証拠グレード | 引用、特徴づけ、統計、開示、品質ゲートを通過した証拠。 |
スモークカタログは決して最終評価証拠ではありません。それらは生成器、検証、特徴づけ、引用
チェック、永続化が素早く機能することを証明するために存在します。ポータルカタログとダウン
ロードはこの小さなスモークスケール(三-資源プール)で各連続体ファミリをプレビューします;
協調割当ファミリはこれほど小さなプールでは互いに素-資源並列性を示せないため、その特徴的構造
は研究-スケール特性です。build_continuum_full_catalog() は各ファミリをその宣言された研究
スケールで具現化します——協調割当、競合、配置構造が真に現れる、より大きな資源プールとタスク
数で——研究-グレードのベンチマークバンドルのために。
分類法
分類法はスケジューリング構造、環境、インフラ現実性、目的特徴、制約特徴、不確実性、および 動性を網羅します。例には DAG ワークフロー、独立タスクバッチ、serverless 関数、コンテナ および VM 統合、edge および cloud 環境、公開トレース、多-目的最適化、deadline、データ 局所性、churn、動的到着が含まれます。
引用マトリクス
ベンチマーク主張は CitationMatrix に対してチェックされます。候補および完全キャンペーン
証拠-グレード主張は、引用-裏付けソースを参照しない限り検証に失敗します。裏付けのない素材は
証拠が追加されるまで exploratory のままでなければなりません。
ソース集合は default_citation_matrix() で、安定したソース識別子、解決可能な参照、記録
されたライセンス姿勢とともに宣言されます。3つの層にまたがります:標準的な組合せ-最適化
コーパス(引用とリンクのみ、決してバンドルされない)、本番クラスタトレース、そして広範な
当代の実世界 Edge–Fog–Cloud-連続体データセット——GPU および machine-learning クラスタ
トレース、マイクロサービスおよび serverless ベンチマークスイート、科学-ワークフロー
トレース、スーパーコンピュータジョブトレース、edge-placement およびモビリティデータセット、
IoT およびセルラー-需要データセット、グリッド炭素およびエネルギー信号、ストリーム-処理
ワークロード、federated-learning デバイス-参加ベンチマーク、拡張-現実システムテストベッド、
および低-地球-軌道衛星-ネットワークトレース:
正準参照スイート
default_reference_suites() のレジストリは、各汎用スケジューリングファミリが係留する
正準の公刊インスタンススイートを記録します:識別子、ファミリ、インスタンス数、取得
ポインタ、およびそのスイートの境界を公表する最良-既知-解トラッカー。古典スイートは
引用とリンクのみです——DispatchAtlas がサードパーティのインスタンスファイルをバンドル
または再配布することは決してありません。
| スイート | ファミリ | インスタンス数 | ダウンロード | BKS トラッカー |
|---|---|---|---|---|
fisher-thompson | job-shop | 3 | OR-Library | van-hoorn-2018, scheduleopt-benchmarks |
lawrence | job-shop | 40 | JSPLIB ミラー | van-hoorn-2018, scheduleopt-benchmarks |
adams-balas-zawack | job-shop | 5 | JSPLIB ミラー | van-hoorn-2018, scheduleopt-benchmarks |
applegate-cook-orb | job-shop | 10 | JSPLIB ミラー | van-hoorn-2018, scheduleopt-benchmarks |
storer-wu-vaccari | job-shop | 20 | JSPLIB ミラー | van-hoorn-2018, scheduleopt-benchmarks |
yamada-nakano | job-shop | 4 | JSPLIB ミラー | van-hoorn-2018, scheduleopt-benchmarks |
taillard-jsp | job-shop | 80 | JSPLIB ミラー | van-hoorn-2018, scheduleopt-benchmarks |
demirkol-dmu | job-shop | 80 | JSPLIB ミラー | scheduleopt-benchmarks |
brandimarte-mk | 柔軟 job-shop | 15 | SchedulingLab ミラー | scheduleopt-benchmarks |
hurink-fjsp | 柔軟 job-shop | 198 | SchedulingLab ミラー | scheduleopt-benchmarks |
dauzere-peres-paulli | 柔軟 job-shop | 18 | SchedulingLab ミラー | scheduleopt-benchmarks |
taillard-pfsp | フローショップ | 120 | OR-Library | zenodo-pfsp-bks-2021 |
vrf-pfsp | フローショップ | 480 | SOA グループサイト | zenodo-pfsp-bks-2021 |
sdst-taillard-ruiz | セットアップフローショップ | 480 | SOA グループサイト | 最良解はインスタンスに同梱 |
cicirello-wt-sds | 機械スケジューリング | 120 | Harvard Dataverse | cicirello-wtsds-benchmark |
or-library-smtwt | 機械スケジューリング | 375 | OR-Library | crauwels-potts-vanwassenhove-1998 |
vallada-ruiz-upmsp | 機械スケジューリング | 1640(報告値) | SOA グループサイト | — |
psplib | RCPSP | 2040 | PSPLIB サイト | psplib-1997 |
mmlib | RCPSP | 4320(報告値) | OR&S ランディングページ | solutionsupdate-ugent-rcpsp |
rg300 | RCPSP | 480 | OR&S ランディングページ | solutionsupdate-ugent-rcpsp |
バンドルされたパーサを持つスイート(標準 job-shop テキスト、Taillard フローショップ
行列、.fjs 柔軟 job-shop、WfCommons WfFormat JSON)は、オペレーターがダウンロード
してローカルの resources/ ツリー下に配置したファイルから
load_reference_suite(suite_id, instances_root=...) で取り込まれます。取り込みは完全に
オフラインで走り、合成生成器と同じ検証、特徴づけ、ハッシュ化、来歴エンベロープを再利用
し、各問題にその suite_id と upstream_instance_id を刻印します。レジストリ-のみの
スイートは、バンドルされたパーサなしに、その引用と取得ポインタとともに記録されます。
最良-既知-解レジストリ
インスタンス-毎の最良-既知値が DispatchAtlas とともに出荷されることは決してありません。
オペレーターはそれらを、プライベートな resources/benchmarks/bks/ ディレクトリ下の
JSON ファイルとして、スイートごとに1ファイルで取り込みます。各ファイルは
schema_version、suite_id、トラッカーの source_id、取得日、および値エントリ
(インスタンス識別子、目的、値、最適-または-上界の種別、任意の下界)を運びます。
load_best_known_registry はすべてのファイルを参照スイートと引用マトリクスに対して
検証し、未知のスイート、未知のトラッカー、重複エントリ、または不整合な境界に対して
閉じて失敗します。取り込まれたレジストリなしでは、相対-乖離メトリックは単に利用不能
です——それらが部分的に計算されることは決してなく、いかなる公開面にも最良-既知値は
現れません。
較正乖離
合成の汎用ファミリは、その生成スキームを再現すると主張することなく、正準スイートに 係留されます。既知の乖離は隠されるのではなく文書化されます:
| ファミリ | 公刊慣行 | 合成慣行 |
|---|---|---|
| セットアップフローショップ | 処理時間の 10/50/100/125% の SDST-Taillard セットアップ | 3つのセットアップファミリ、コスト = ファミリ + 1 |
| 機械スケジューリング(R||Cmax) | U[1,100] 処理時間クラスと相関-機械バリアント | ペア-毎の速度係数 0.5–2.0 |
公刊慣行に対する比較は、合成ファミリを通じてではなく、取り込まれた正準インスタンスを 経由します。
特徴づけ
各具現化問題は以下についての正規化記述子を受け取ります:
- 機会密度
- 互換性疎性
- 競合と過負荷
- 依存深度
- 通信圧力
- セットアップ強度
- 負荷偏りと異質性
- 目的衝突
- 不確実性と動性
- ソルバー感度
現実-ギャップ橋渡し
各完全キャンペーン証拠-グレードプロファイルは現実-ギャップ橋渡しを宣言します:その状態
(synthetic、calibrated-synthetic、trace-backed、または externally-sourced)、
較正証拠、ドメインシナリオ、移行と擾乱カバレッジ、および残余現実-ギャップリスク。完全
キャンペーン証拠グレードへの昇格は、移行と擾乱カバレッジが宣言されない限り閉じて失敗し、
calibrated-synthetic プロファイルは較正対象の trace-backed 参照を命名せねばなりません。
Calibrated-synthetic ファミリはそのトレース参照を明示的に命名します;取り込まれた正準
スイートは externally-sourced 橋渡しを運び、WfCommons アダプタは最初の外部-解析
trace-backed インスタンスソースであり、distribution_distance_score に実 trace-backed 参照の
脚を与えます。
具名の較正メトリックは、calibrated-synthetic プロファイルの特徴づけ特徴分布とその
trace-backed 参照インスタンスのそれとの間の特徴-毎の 1-Wasserstein(土運び)距離を報告
します。特徴-毎の距離は単一の現実-ギャップスコアに集約されます;最大-乖離しきい値(既定
0.25)を超えるスコアは、プロファイルがその参照から離れすぎて漂流し較正に失敗したことを
意味します。メトリックは具現化インスタンスと具名の参照トレースから再現可能です。
from dispatchatlas.bench import (
build_smoke_catalog,
metrics_from_instance_set,
distribution_distance_score,
)
catalogs = {c.config.profile_id: c for c in build_smoke_catalog()}
synthetic = metrics_from_instance_set(catalogs["cloud-edge-capacity"])
reference = metrics_from_instance_set(catalogs["workflow-dag"])
score = distribution_distance_score(
synthetic, reference, reference_trace_id="google-cluster-data"
)層別化とサブセット選択
difficulty_score は競合、過負荷、依存-深度、ソルバー-感度記述子を正規化難易度スコアに
集約し、stratify_instances は具現化インスタンスを低、中、高難易度層にビン分けします。
select_benchmark_subset はファミリ、プロファイルクラス、難易度層でフィルタした決定論的
サブセットを、問題識別子順に選び、選択を再現可能にします。
スモークカタログ
from dispatchatlas.bench import build_smoke_catalog, smoke_benchmark_provider
catalogs = build_smoke_catalog(root_seed=20260527)
provider = smoke_benchmark_provider(root_seed=20260527)
first_problem = provider.get_problem(provider.list_problem_ids()[0])バンドルされたスモークカタログは、2つの distributed-computing ファミリ(cloud/edge 独立-タスクと workflow DAG)を、14の汎用スケジューリングファミリ(機械スケジューリング、 job-shop、柔軟 job-shop、順列フローショップ、順序依存セットアップフローショップ、RCPSP、オープンショップ、ハイブリッドフローショップ、分散順列フローショップ、ノーウェイトフローショップ、ブロッキングフローショップ、分散組立フローショップ、多目的順列フローショップ、RCPSP/max) とco-equalな同位として含みます。各インスタンスはルートシードから決定論的であり、引用-裏付け 生成器メタデータを用いつつ、スモーク開発素材としてラベル付けされたままです。
候補完全カタログ
候補完全キャンペーンカタログは、より大きな設定問題数とより厳格な証拠ラベルで同じ具現化 パスを用います:
from dispatchatlas.bench import build_full_catalog, full_benchmark_provider
catalogs = build_full_catalog(root_seed=2026052713, problem_count_per_profile=30)
provider = full_benchmark_provider(
root_seed=2026052713,
problem_count_per_profile=30,
)それらの完全キャンペーン証拠-グレードカタログは引用-裏付け、特徴づけ済み、ハッシュ-リンク 済みであり、キャンペーン、開示、公開ゲートが特定の主張を昇格させるまでは較正証拠として ラベル付けされたままです。