本文へスキップ
DispatchAtlas
検索

ベンチマークモデル

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).

Benchmark family distributiondistributed-computing47flow-shop7job-shop6machine-scheduling3rcpsp3open-shop1rcpsp-max1setup-flow-shop1
How the 69 benchmark families distribute across scheduling-family categories — the IoE / Edge–Fog–Cloud continuum families dominate, while the classical combinatorial-scheduling families (job-shop, flow-shop, machine-scheduling, RCPSP, setup flow-shop) demonstrate the corpus’s reach into general scheduling. Hover or focus a bar to read its count.

Showing 69 of 69 family profiles.

Benchmark families — 69 rows, build-inlined from the public family bundle.
Distinctive againstEvidenceCitation statusSource citations
accelerator-coscheduling
accelerator-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-computingioe-completepublished 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)smokecitation-backed
  • ghodsi-drf-2011 Ghodsi, Zaharia, Hindman, Konwinski, Shenker, and Stoica, USENIX NSDI 2011.
  • gandiva-2018 Xiao et al., USENIX OSDI 2018, 595-610.
aerial-edge
aerial-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-computingioe-completeaerial-edge MEC simulators (no flying-fog loiter placement)smokecitation-backed
  • edgecloudsim-2018 Sonmez, Ozgovde, and Ersoy, Transactions on Emerging Telecommunications Technologies, 29(11):e3493, 2018.
  • aerial-mec-survey-2022 Song, Qin, Hao, Hou, Wang, and Sun, arXiv:2208.13965, 2022.
anytime-inference
anytime-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-computingioe-completepublished 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 timelinesssmokecitation-backed
blocking-flow-shop
blocking-flow-shop
flow-shopclassicalsmokecitation-backed
bulk-synchronous-graph
bulk-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-computingioe-completepublished 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)smokecitation-backed
  • valiant-bsp-1990 Valiant, Communications of the ACM, 33(8):103-111, 1990.
  • pregel-2010 Malewicz, Austern, Bik, Dehnert, Horn, Leiser, and Czajkowski, ACM SIGMOD 2010, 135-146.
carbon-aware
carbon-aware
flexible jobs defer to low-carbon-intensity windows under a time-varying grid carbon signal while honoring their SLA deadlines
distributed-computingioe-completeElectricity-Maps grid carbon-intensity and CityLearn carbon-aware community signalssmokecitation-backed
  • electricity-maps-grid-ci Electricity Maps, electricitymaps-contrib (open-source parsers and public grid carbon-intensity data).
  • citylearn-v2 Nweye, Kaspar, Buscemi, et al., 2024 (arXiv:2405.03848); Vazquez-Canteli et al., ACM BuildSys 2019.
cloud-independent
cloud-edge-independent
distributed-computingdomain-specificsmokecitation-backed
  • cloudsim-2011 Calheiros, Ranjan, Beloglazov, De Rose, and Buyya, Software: Practice and Experience, 2011.
  • dynamic-cloudsim-2015 Bux and Leser, Future Generation Computer Systems, 2015.
  • edge-vision-2016 Shi, Cao, Zhang, Li, and Xu, IEEE Internet of Things Journal, 2016.
coflow-scheduling
coflow-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-computingioe-completedatacenter coflow schedulers (no continuum tier-placement barrier)smokecitation-backed
compact-job-shop
compact-job-shop
job-shopclassicalsmokecitation-backed
  • or-library-1990 Beasley, Journal of the Operational Research Society, 41(11):1069-1072, 1990.
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
confidential-edge
confidential-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-computingioe-completeedge enclave runtimes (no security-classified Pareto placement)smokecitation-backed
  • occlum-asplos-2020 Shen, Tian, Chen, Chen, Wang, Xu, Yan, and Xia, International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) 2020.
  • confidential-edge-zobaed-2025 Zobaed and Amini Salehi, Software: Practice and Experience, 2025.
cyber-physical
cyber-physical
control cycles arrive periodically under a time-varying tariff
distributed-computingioe-completeperiodic hard-real-time task models and smart-grid demand-side scheduling formulations (no edge-fog-cloud tier placement under a Pareto contract)smokecitation-backed
  • liu-layland-1973 Liu and Layland, Journal of the ACM, 20(1):46-61, 1973.
  • smart-grid-dsm-2012 Logenthiran, Srinivasan, and Shun, IEEE Transactions on Smart Grid, 3(3):1244-1252, 2012.
  • citylearn-v2 Nweye, Kaspar, Buscemi, et al., 2024 (arXiv:2405.03848); Vazquez-Canteli et al., ACM BuildSys 2019.
data-locality
data-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-computingioe-completecluster locality schedulers (no continuum data-residency placement)smokecitation-backed
datacenter-colocation
datacenter-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-computingioe-completeGoogle Borg ClusterData2019 priority-tiered cell tracessmokecitation-backed
  • google-cluster-data Reiss, Wilkes, and Hellerstein, Google cluster-usage traces, 2011; Wilkes, ClusterData2019 v3, 2020.
  • borg-2020 Tirmazi, Barker, Deng, Haque, Qin, Hand, Harchol-Balter, and Wilkes, EuroSys 2020.
digital-twin-sync
digital-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-computingioe-completedigital-twin edge frameworks (no joint Pareto placement)smokecitation-backed
  • digital-twin-diten-2022 Tang, Chen, Koketsu Rodrigues, Zhao, and Kato, IEEE Open Journal of the Communications Society, 3:1360-1381, 2022.
disaggregated-memory
disaggregated-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-computingioe-completepublished CXL memory-pooling and tiered-memory systems (socket-local page placement, no edge-fog-cloud tier scheduling under a Pareto contract)smokecitation-backed
  • pond-cxl-2023 Li, Berger, Hsu, Ernst, Zardoshti, Novakovic, Shah, Rajadnya, Lee, Agarwal, Hill, Fontoura, and Bianchini, ASPLOS 2023.
  • tpp-cxl-2023 Maruf, Wang, Dhanotia, Weiner, Agarwal, Bhattacharya, Petersen, Chowdhury, Kanaujia, and Chauhan, ASPLOS 2023.
distributed-assembly-flow-shop
distributed-assembly-flow-shop
flow-shopclassicalsmokecitation-backed
  • hatami-ruiz-2013 Hatami, Ruiz, and Andrés-Romano, International Journal of Production Research, 51(17):5292-5308, 2013.
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
distributed-flexible-job-shop
distributed-flexible-job-shop
job-shopstructurally-complexsmokecitation-backed
distributed-permutation-flow-shop
distributed-permutation-flow-shop
flow-shopclassicalsmokecitation-backed
  • naderi-ruiz-2010 Naderi and Ruiz, Computers & Operations Research, 37(4):754-768, 2010.
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
distributed-training-gang
distributed-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-computingioe-completepublished 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 contractsmokecitation-backed
  • gang-scheduling-1995 Feitelson and Rudolph, Job Scheduling Strategies for Parallel Processing (JSSPP), LNCS 949, Springer, 1995, 1-18.
  • large-minibatch-sgd-2017 Goyal, Dollar, Girshick, Noordhuis, Wesolowski, Kyrola, Tulloch, Jia, and He, arXiv:1706.02677, 2017.
distributed-transaction
distributed-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-computingioe-completepublished 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)smokecitation-backed
  • calvin-2012 Thomson, Diamond, Weng, Ren, Shao, and Abadi, ACM SIGMOD 2012.
  • spanner-2012 Corbett et al., USENIX OSDI 2012.
edge-offloading
edge-offloading-mec
each task chooses between local edge execution and remote offload
distributed-computingioe-completeiFogSim MEC offloading scenariossmokecitation-backed
  • ifogsim-2017 Gupta, Vahid Dastjerdi, Ghosh, and Buyya, Software: Practice and Experience, 47(9):1275-1296, 2017.
  • ifogsim2-2022 Mahmud, Pallewatta, Goudarzi, and Buyya, Journal of Systems and Software, 190:111351, 2022.
  • edge-vision-2016 Shi, Cao, Zhang, Li, and Xu, IEEE Internet of Things Journal, 2016.
  • shanghai-telecom-edge Wang, Guo, Zhang, Yang, Zhou, and Shen, IEEE Transactions on Mobile Computing, 20(3):939-953, 2021.
edge-placement
edge-placement
services place on edge servers near their user population and migrate as demand shifts across base-station coverage cells
distributed-computingioe-completeEUA edge-user-allocation and Shanghai-Telecom base-station placement tracessmokecitation-backed
  • eua-dataset Lai, He, Abdelrazek, Chen, Bao, Grundy, Hosking, and Yang, ICSOC 2018.
  • shanghai-telecom-edge Wang, Guo, Zhang, Yang, Zhou, and Shen, IEEE Transactions on Mobile Computing, 20(3):939-953, 2021.
elastic-serverless-autoscale
elastic-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-computingioe-completepublished 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 contractsmokecitation-backed
facility-assignment
facility-assignment
machine-schedulingclassicalsmokecitation-backed
  • hooker-2007 Hooker, Operations Research, 55(3):588-602, 2007.
failure-recovery
failure-recovery
a failed task re-places its checkpoint state to a surviving tier
distributed-computingioe-completeBorg cluster failure-event tracessmokecitation-backed
  • google-cluster-data Reiss, Wilkes, and Hellerstein, Google cluster-usage traces, 2011; Wilkes, ClusterData2019 v3, 2020.
  • borg-2020 Tirmazi, Barker, Deng, Haque, Qin, Hand, Harchol-Balter, and Wilkes, EuroSys 2020.
federated-learning
federated-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-computingioe-completeFedScale and Oort federated-learning device-participation benchmarkssmokecitation-backed
  • fedscale-2022 Lai, Dai, Singapuram, Liu, Zhu, Madhyastha, and Chowdhury, ICML 2022 (PMLR 162); arXiv:2105.11367.
  • oort-2021 Lai, Zhu, Madhyastha, and Chowdhury, USENIX OSDI 2021.
flexible-job-shop
flexible-job-shop
job-shopclassicalsmokecitation-backed
flow-shop
permutation-flow-shop
flow-shopclassicalsmokecitation-backed
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
  • vallada-ruiz-framinan-2015 Vallada, Ruiz, and Framinan, European Journal of Operational Research, 240(3):666-677, 2015.
fpga-partitioning
fpga-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-computingioe-completepublished 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 contractsmokecitation-backed
frontierco-fjsp
frontierco-fjsp
job-shopclassicalsmokecitation-backed
  • frontierco Feng, Sun, Li, Talwalkar, and Yang, arXiv:2505.16952, 2026 (ICLR 2026).
  • behnke-geiger-2012 Behnke and Geiger, Helmut-Schmidt-University Hamburg working paper, 2012.
  • naderi-roshanaei-2022 Naderi and Roshanaei, INFORMS Journal on Optimization, 4(1):1-28, 2022.
generative-inference-serving
generative-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-computingioe-completepublished single-replica generative-model serving systems (no edge-fog-cloud tier placement under a Pareto contract)smokecitation-backed
gpu-ml
gpu-ml
training and inference jobs claim accelerators and gang-schedule replicas
distributed-computingioe-completeAlibaba PAI, Philly, and Helios GPU-cluster tracessmokecitation-backed
hybrid-flow-shop
hybrid-flow-shop
flow-shopclassicalsmokecitation-backed
  • ruiz-vazquez-2010 Ruiz and Vázquez-Rodríguez, European Journal of Operational Research, 205(1):1-18, 2010.
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
immersive-xr
immersive-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-computingioe-completeILLIXR extended-reality systems testbedsmokecitation-backed
  • illixr-2021 Huzaifa, Desai, Grayson, et al., IEEE IISWC 2021.
intermittent-edge
intermittent-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-computingioe-completeintermittent-computing runtimes (no continuum energy-window placement)smokecitation-backed
iot-edge
iot-edge
many small sensor readings arrive periodically and aggregate at the edge
distributed-computingioe-completepublished wireless-sensor-network telemetry datasets and in-network aggregation deployments (raw sensor readings, not edge-fog-cloud tier scheduling under a Pareto contract)smokecitation-backed
  • intel-lab-data Bodik, Hong, Guestrin, Madden, Paskin, and Thibaux, Intel Berkeley Research Lab / MIT CSAIL, 2004.
  • milano-cdr-2015 Barlacchi, De Nadai, Larcher, et al., Scientific Data, 2:150055, 2015.
job-shop
job-shop
job-shopclassicalsmokecitation-backed
  • or-library-1990 Beasley, Journal of the Operational Research Society, 41(11):1069-1072, 1990.
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
  • applegate-cook-1991 Applegate and Cook, ORSA Journal on Computing, 3(2):149-156, 1991.
  • demirkol-mehta-uzsoy-1998 Demirkol, Mehta, and Uzsoy, European Journal of Operational Research, 109(1):137-141, 1998.
  • storer-wu-vaccari-1992 Storer, Wu, and Vaccari, Management Science, 38(10):1495-1509, 1992.
  • rl4co-2023 Berto, Hua, Park, et al., arXiv:2306.17100, 2023 (KDD 2025).
kv-cache-placement
kv-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-computingioe-completepublished 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 contractsmokecitation-backed
machine-scheduling
machine-scheduling-unrelated
machine-schedulingclassicalsmokecitation-backed
  • or-library-1990 Beasley, Journal of the Operational Research Society, 41(11):1069-1072, 1990.
microservice-dag
microservice-dag
services form an acyclic call graph pinned by role to a tier
distributed-computingioe-completeAlibaba v2021 microservice-trace call graphssmokecitation-backed
mixed-criticality
mixed-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-computingioe-completepublished 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)smokecitation-backed
moe-expert-parallel
moe-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-computingioe-completepublished dense generative-model serving systems (uniform per-replica KV-cache admission, not sparse token-to-expert routing under load imbalance and a Pareto contract)smokecitation-backed
multi-objective-pfsp
multi-objective-pfsp
flow-shopclassicalsmokecitation-backed
  • minella-ruiz-2008 Minella, Ruiz, and Ciavotta, INFORMS Journal on Computing, 20(3):451-471, 2008.
  • taillard-1993 Taillard, European Journal of Operational Research, 1993.
multi-project-rcpsp
multi-project-rcpsp
rcpspstructurally-complexsmokecitation-backed
  • van-eynde-vanhoucke-2020 Van Eynde and Vanhoucke, Journal of Scheduling, 23(3):301-325, 2020.
  • psplib-1997 Kolisch and Sprecher, European Journal of Operational Research, 96(1):205-216, 1997.
multi-tenant-fair-share
multi-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-computingioe-completepublished 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 objectivesmokecitation-backed
  • ghodsi-drf-2011 Ghodsi, Zaharia, Hindman, Konwinski, Shenker, and Stoica, USENIX NSDI 2011.
  • borg-2020 Tirmazi, Barker, Deng, Haque, Qin, Hand, Harchol-Balter, and Wilkes, EuroSys 2020.
network-slicing
network-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-computingioe-complete5G slicing orchestration (no joint Pareto placement)smokecitation-backed
  • network-slicing-afolabi-2018 Afolabi, Taleb, Samdanis, Ksentini, and Flinck, IEEE Communications Surveys & Tutorials, 20(3):2429-2453, 2018.
no-wait-flow-shop
no-wait-flow-shop
flow-shopclassicalsmokecitation-backed
open-shop
open-shop
open-shopclassicalsmokecitation-backed
orbital-edge
orbital-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-computingioe-completeLENS real-measurement LEO satellite-network tracessmokecitation-backed
pipeline-parallel-training
pipeline-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-computingioe-completepublished 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)smokecitation-backed
  • gpipe-2019 Huang, Cheng, Bapna, Firat, Chen, Chen, Lee, Ngiam, Le, Wu, and Chen, NeurIPS 2019.
  • pipedream-2019 Narayanan, Harlap, Phanishayee, Seshadri, Devanur, Ganger, Gibbons, and Zaharia, SOSP 2019.
rcpsp
rcpsp-renewable
rcpspstructurally-complexsmokecitation-backed
  • psplib-1997 Kolisch and Sprecher, European Journal of Operational Research, 96(1):205-216, 1997.
rcpsp-max
rcpsp-max
rcpsp-maxstructurally-complexsmokecitation-backed
  • bartusch-moehring-1988 Bartusch, Möhring, and Radermacher, Annals of Operations Research, 16(1):199-240, 1988.
  • psplib-1997 Kolisch and Sprecher, European Journal of Operational Research, 96(1):205-216, 1997.
rcpsp-multi-mode
rcpsp-multi-mode
rcpspstructurally-complexsmokecitation-backed
  • van-peteghem-vanhoucke-2014 Van Peteghem and Vanhoucke, European Journal of Operational Research, 235(1):62-72, 2014.
  • psplib-1997 Kolisch and Sprecher, European Journal of Operational Research, 96(1):205-216, 1997.
reentrant-fab
reentrant-fab
job-shopstructurally-complexsmokecitation-backed
  • smt2020-2020 Kopp, Hassoun, Kalir, and Mönch, IEEE Transactions on Semiconductor Manufacturing, 33(4):522-531, 2020.
replica-placement
replica-placement
a replica runs where its data shard already lives
distributed-computingioe-completeCRUSH replicated-data placementsmokecitation-backed
  • crush-2006 Weil, Brandt, Miller, and Maltzahn, Proceedings of the 2006 ACM/IEEE Conference on Supercomputing (SC'06), 2006.
  • google-cluster-data Reiss, Wilkes, and Hellerstein, Google cluster-usage traces, 2011; Wilkes, ClusterData2019 v3, 2020.
serverless-cold-start
serverless-cold-start
a cold invocation pays a container provisioning penalty
distributed-computingioe-completeAzure Functions serverless-in-the-wild tracessmokecitation-backed
  • azure-public-dataset Cortez et al., SOSP'17 Resource Central; Shahrad et al., USENIX ATC'20 Serverless in the Wild; Hadary et al., USENIX OSDI'20 Protean (AzureTracesForPacking2020).
  • sebs-2021 Copik, Kwasniewski, Besta, Podstawski, and Hoefler, ACM/IFIP Middleware 2021.
service-function-chain
service-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-computingioe-completepublished 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)smokecitation-backed
  • nfv-survey-2016 Mijumbi, Serrat, Gorricho, Bouten, De Turck, and Boutaba, IEEE Communications Surveys & Tutorials, 18(1):236-262, 2016.
  • sfc-placement-2014 Mehraghdam, Keller, and Karl, IEEE CloudNet 2014, 7-13.
setup-flow-shop
setup-flow-shop
setup-flow-shopclassicalsmokecitation-backed
  • allahverdi-survey-2008 Allahverdi, Ng, Cheng, and Kovalyov, European Journal of Operational Research, 187(3):985-1032, 2008.
  • allahverdi-survey-2015 Allahverdi, European Journal of Operational Research, 246(2):345-378, 2015.
smartnic-offload
smartnic-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-computingioe-completepublished mobile-edge computation-offloading models (device-to-edge latency offload, not in-server host-to-NIC energy offload under a Pareto contract)smokecitation-backed
split-inference-serving
split-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-computingioe-completedatacenter inference serving (no edge-cloud partition placement)smokecitation-backed
  • alpaserve-osdi-2023 Li, Zheng, Zhong, Liu, Sheng, Jin, Huang, Chen, Zhang, Gonzalez, and Stoica, USENIX Symposium on Operating Systems Design and Implementation (OSDI) 2023, 663-679.
  • neurosurgeon-asplos-2017 Kang, Hauswald, Gao, Rovinski, Mudge, Mars, and Tang, International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) 2017.
spot-preemptible
spot-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-computingioe-completecloud spot schedulers (no continuum eviction-deadline placement)smokecitation-backed
  • harvest-vms-ambati-osdi-2020 Ambati, Goiri, Frujeri, Gun, Wang, Dolan, Corell, Pasupuleti, Moscibroda, Elnikety, Fontoura, and Bianchini, USENIX Symposium on Operating Systems Design and Implementation (OSDI) 2020, 735-751.
  • spot-eviction-yang-www-2022 Yang, Pang, Zhang, Qiao, Wang, Couturier, Bansal, Ram, Qin, Ma, Goiri, Cortez, Baladhandayutham, Ruhle, Rajmohan, Lin, and Zhang, The Web Conference (WWW) 2022 Companion, 152-156.
storage-io-tiering
storage-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-computingioe-completepublished 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 contractsmokecitation-backed
  • msr-cambridge-block-2008 Narayanan, Donnelly, and Rowstron, ACM Transactions on Storage 4(3):10, 2008 (USENIX FAST 2008); MSR Cambridge enterprise volume block-I/O trace via the SNIA IOTTA repository.
streaming-window
streaming-window
events arrive online in bounded windows and must close within one
distributed-computingioe-completeParallel Workloads Archive online arrivalssmokecitation-backed
  • parallel-workloads-archive Feitelson, Tsafrir, and Krakov, Journal of Parallel and Distributed Computing, 74(10):2967-2982, 2014.
  • dspbench-2020 Bordin, Griebler, Mencagli, Geyer, and Fernandes, IEEE Access, 8:222900-222917, 2020.
time-sensitive-networking
time-sensitive-networking
each time-triggered flow releases on a fixed period and must finish within one cycle under a hard, jitter-free deadline
distributed-computingioe-completeEdgeCloudSim best-effort scenarios (no gating)smokecitation-backed
  • tsn-craciunas-2016 Craciunas, Serna Oliver, Chmelik, and Steiner, RTNS 2016, ACM, 183-192.
  • edgecloudsim-2018 Sonmez, Ozgovde, and Ersoy, Transactions on Emerging Telecommunications Technologies, 29(11):e3493, 2018.
unrelated-parallel-setup
unrelated-parallel-setup
machine-schedulingstructurally-complexsmokecitation-backed
  • vallada-ruiz-2011 Vallada and Ruiz, European Journal of Operational Research, 211(3):612-622, 2011.
  • allahverdi-survey-2015 Allahverdi, European Journal of Operational Research, 246(2):345-378, 2015.
vehicular-offloading
vehicular-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-computingioe-completeEdgeCloudSim / SUMO vehicular-edge mobility scenariossmokecitation-backed
  • lust-scenario Codecà, Frank, Faye, and Engel, IEEE Intelligent Transportation Systems Magazine, 9(2):52-63, 2017.
  • edgecloudsim-2018 Sonmez, Ozgovde, and Ersoy, Transactions on Emerging Telecommunications Technologies, 29(11):e3493, 2018.
video-analytics
video-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-computingioe-completeedge video-analytics clusters (no joint Pareto placement)smokecitation-backed
  • videoedge-2018 Hung, Ananthanarayanan, Bodik, Golubchik, Yu, Bahl, and Philipose, ACM/IEEE Symposium on Edge Computing (SEC) 2018, 115-131.
vm-allocation
vm-allocation
size-heterogeneous virtual-machine deployments pack onto hosts while each deployment's members spread across distinct failure domains for availability
distributed-computingioe-completeAzure Public Dataset Resource Central VM-allocation tracessmokecitation-backed
  • azure-public-dataset Cortez et al., SOSP'17 Resource Central; Shahrad et al., USENIX ATC'20 Serverless in the Wild; Hadary et al., USENIX OSDI'20 Protean (AzureTracesForPacking2020).
  • bitbrains-gwa-t12-2015 Shen, van Beek, and Iosup, IEEE/ACM CCGrid 2015, pp. 465-474; Bitbrains (now Solvinity) datacenter VM trace via the Grid Workloads Archive (GWA-T-12).
  • materna-gwa-t13-2014 Kohne, Spohr, Nagel, and Spinczyk, ACM CCB@Middleware 2014; Materna GmbH datacenter VM trace via the Grid Workloads Archive (GWA-T-13).
  • planetlab-workload-2012 Beloglazov and Buyya, Concurrency and Computation: Practice and Experience 24(13):1397-1420, 2012; PlanetLab/CoMon CPU-utilization workload bundled with CloudSim.
workflow-dag
workflow-dag
distributed-computingstructurally-complexsmokecitation-backed
  • stg-task-graphs Tobita and Kasahara, Journal of Scheduling, 5(5):379-394, 2002.
  • wfcommons-pegasus-instances Coleman, Casanova, Pottier, Kaushik, Deelman, and Ferreira da Silva, Future Generation Computer Systems, 128:16-27, 2022.
  • topcuoglu-heft-2002 Topcuoglu, Hariri, and Wu, IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, 2002.
  • canon-dag-bias-2019 Canon, El Sayah, and Héam, Euro-Par 2019, LNCS 11725.

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-unrelatedclassicalOR-Library
Job-shopjob-shop-classicalclassicalOR-Library, Taillard
柔軟 job-shop(FJSP)flexible-job-shopclassicalBrandimarte; Hurink-Jurisch-Thole
順列フローショップpermutation-flow-shopclassicalTaillard
順序依存セットアップフローショップ(SDST)setup-flow-shopclassicalAllahverdi et al. (2008); Allahverdi (2015)
資源制約プロジェクトスケジューリング(RCPSP)rcpsp-renewablestructurally-complexPSPLIB
Distributed-computing(cloud/edge)cloud-edge-capacitydomain-specificCloudSim; DynamicCloudSim; Edge vision
Distributed-computing(workflow DAG)workflow-dagstructurally-complexStandard 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.pyexamples/distributed_training_gang_study.py、 および examples/multi_tenant_fairshare_study.py がこれら3つのレバーを明示します。

プロファイルクラス

プロファイルクラス意味
classical標準的な組合せ-最適化コーパスから派生する。
structurally-complex優先順位、DAG、または資源-ネットワーク構造を持つ。
ioe-completeInternet-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 デバイス-参加ベンチマーク、拡張-現実システムテストベッド、 および低-地球-軌道衛星-ネットワークトレース:

Source idReferenceLicense posture
cloudsim-2011CloudSim学術
dynamic-cloudsim-2015DynamicCloudSim学術
edge-vision-2016Edge Computing: Vision and Challenges学術
or-library-1990OR-Library引用-とリンク-のみ
psplib-1997PSPLIB引用-とリンク-のみ
van-eynde-vanhoucke-2020Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling引用-とリンク-のみ
taillard-1993Benchmarks for basic scheduling problems引用-とリンク-のみ
gonzalez-sahni-1976Open shop scheduling to minimize finish time学術
ruiz-vazquez-2010The hybrid flow shop scheduling problem学術
smt2020-2020SMT2020—A Semiconductor Manufacturing Testbedcite-and-link-only
hooker-2007Planning and Scheduling by Logic-Based Benders Decomposition学術
naderi-ruiz-2010The distributed permutation flowshop scheduling problem学術
hall-sriskandarajah-1996A survey of machine scheduling problems with blocking and no-wait in process学術
minella-ruiz-2008A review and evaluation of multiobjective algorithms for the flowshop scheduling problem学術
bartusch-moehring-1988Scheduling project networks with resource constraints and time windows学術
hatami-ruiz-2013The distributed assembly permutation flowshop scheduling problem学術
brandimarte-1993Flexible job shop by tabu search引用-とリンク-のみ
de-giovanni-pezzella-2010An improved genetic algorithm for the distributed and flexible job-shop scheduling problem学術
frontiercoFrontierCO: real-world large-scale ML-for-CO evaluationusable-and-citable
behnke-geiger-2012Test instances for the flexible job shop scheduling problem with work centerscite-and-link-only
naderi-roshanaei-2022Critical-path-search logic-based Benders decomposition for flexible job shop schedulingcite-and-link-only
hurink-jurisch-thole-1994Multi-purpose-machine job shop引用-とリンク-のみ
allahverdi-survey-2008A survey of scheduling problems with setup times or costs学術
allahverdi-survey-2015The third comprehensive survey on scheduling problems with setup times/costs学術
vallada-ruiz-2011A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times学術
stg-task-graphsA standard task graph set for fair evaluation of multiprocessor scheduling algorithms標準
google-cluster-dataBorg cluster workload tracesCC-BY-4.0、使用可かつ引用可
twitter-cache-traces-2020Twitter in-memory cache cluster tracesCC-BY-4.0、使用可かつ引用可
m100-exadata-2023M100 ExaData supercomputer telemetry and job traceCC-BY-4.0、使用可かつ引用可
borg-2020Borg: the Next Generation学術
azure-public-datasetAzure Public DatasetCC-BY-4.0、使用可かつ引用可
alibaba-cluster-dataAlibaba cluster trace program引用-のみ
parallel-workloads-archiveParallel Workloads Archive引用-のみ
bitbrains-gwa-t12-2015GWA-T-12 Bitbrains business-critical VM trace引用-のみ
materna-gwa-t13-2014GWA-T-13 Materna enterprise datacenter VM trace引用-のみ
msr-cambridge-block-2008MSR Cambridge enterprise block-I/O traces (Write Off-Loading)引用-のみ
planetlab-workload-2012PlanetLab CPU-utilization consolidation traces引用-のみ
dspbench-2020DSPBench stream-processing benchmark suite学術
ifogsim-2017iFogSim toolkit学術
edgecloudsim-2018EdgeCloudSim学術
aerial-mec-survey-2022Aerial mobile edge computing survey学術
crush-2006CRUSH decentralized replica placement学術
smart-grid-dsm-2012Smart-grid demand-side management学術
liu-layland-1973Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment学術
philly-traces-2019Philly DNN-training cluster traceオープン、使用可かつ引用可
helios-traces-2021Helios GPU-datacenter traceオープン、使用可かつ引用可
acmetrace-2024AcmeTrace language-model-development cluster traceCC-BY-4.0
alibaba-pai-gpu-2020Alibaba PAI MLaaS GPU trace引用-のみ
azure-inference-trace-2023Azure model-inference serving traceCC-BY-4.0、使用可かつ引用可
deathstarbench-2019DeathStarBench microservice suiteApache-2.0、使用可かつ引用可
alibaba-microservice-characterization-2021Alibaba microservice characterization学術
train-ticket-benchmarkTrain-Ticket microservice benchmarkApache-2.0、使用可かつ引用可
sebs-2021SeBS serverless benchmark suiteBSD-3-Clause、使用可かつ引用可
functionbench-2019FunctionBench serverless workloadsオープン、使用可かつ引用可
wfcommons-pegasus-instancesWfCommons scientific-workflow instancesオープン、使用可かつ引用可
bharathi-synthetic-workflows-2008Synthetic scientific-workflow libraryオープン、使用可かつ引用可
nrel-eagle-jobs-2023NREL Eagle supercomputer job traceCC-BY-4.0、使用可かつ引用可
eua-datasetEdge-User-Allocation datasetオープン、使用可かつ引用可
shanghai-telecom-edgeShanghai Telecom access trace引用-のみ、研究
lust-scenarioLuxembourg SUMO Traffic scenario学術、使用可かつ引用可
intel-lab-dataIntel Lab Data (54-node in-network aggregation)引用-とリンク-のみ
milano-cdr-2015Milan and Trentino urban datasetCC-BY-4.0、使用可かつ引用可
citylearn-v2CityLearn grid-interactive benchmarkMIT、使用可かつ引用可
electricity-maps-grid-ciElectricity Maps grid carbon-intensityオープンパーサ(MIT)、データ層は様々
nexmark-benchmarkNEXMark streaming-query benchmarkオープン、使用可かつ引用可
yahoo-streaming-benchmark-2016Yahoo Streaming BenchmarkApache-2.0、使用可かつ引用可
fedscale-2022FedScale federated-learning benchmarkApache-2.0、使用可かつ引用可
oort-2021Oort guided participant selectionApache-2.0、使用可かつ引用可
illixr-2021ILLIXR extended-reality testbedNCSA、使用可かつ引用可
lens-2024LENS LEO satellite-network tracesCC-BY-SA-4.0、使用可かつ引用可
tsn-craciunas-2016Scheduling Real-Time Communication in IEEE 802.1Qbv TSN学術
network-slicing-afolabi-2018Network Slicing and Softwarization: A Survey学術
digital-twin-diten-2022Survey on Digital Twin Edge Networks (DITEN) Toward 6G学術
videoedge-2018VideoEdge: Processing Camera Streams using Hierarchical Clusters学術
alpaserve-osdi-2023AlpaServe: Statistical Multiplexing with Model Parallelism for Deep Learning Serving学術
neurosurgeon-asplos-2017Neurosurgeon: Collaborative Intelligence Between the Cloud and Mobile Edge学術
occlum-asplos-2020Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGX学術
confidential-edge-zobaed-2025Confidential Computing across Edge-to-Cloud for Machine Learning: A Survey Study学術
batteryless-lucia-pldi-2015A Simpler, Safer Programming and Execution Model for Intermittent Systems学術
batteryless-hester-sensys-2017The Future of Sensing is Batteryless, Intermittent, and Awesome学術
harvest-vms-ambati-osdi-2020Providing SLOs for Resource-Harvesting VMs in Cloud Platforms学術
spot-eviction-yang-www-2022Spot Virtual Machine Eviction Prediction in Microsoft Cloud学術
delay-scheduling-zaharia-eurosys-2010Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling学術
geo-analytics-iridium-pu-sigcomm-2015Low Latency Geo-distributed Data Analytics学術
coflow-chowdhury-hotnets-2012Coflow: A Networking Abstraction for Cluster Applications学術
varys-chowdhury-sigcomm-2014Efficient Coflow Scheduling with Varys学術
vllm-pagedattention-2023Efficient Memory Management for Large Language Model Serving with PagedAttention学術
orca-serving-2022Orca: A Distributed Serving System for Transformer-Based Generative Models学術
pond-cxl-2023Pond: CXL-Based Memory Pooling Systems for Cloud Platforms学術
tpp-cxl-2023TPP: Transparent Page Placement for CXL-Enabled Tiered-Memory学術
ipipe-smartnic-2019Offloading Distributed Applications onto SmartNICs using iPipe学術
e3-smartnic-2019E3: Energy-Efficient Microservices on SmartNIC-Accelerated Servers学術
switch-transformers-2022Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity学術
lina-moe-2023Accelerating Distributed MoE Training and Inference with Lina学術
gpipe-2019GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism学術
pipedream-2019PipeDream: Generalized Pipeline Parallelism for DNN Training学術
vestal-2007Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance学術
mixed-criticality-survey-2017A Survey of Research into Mixed Criticality Systems学術
valiant-bsp-1990A Bridging Model for Parallel Computation学術
pregel-2010Pregel: A System for Large-Scale Graph Processing学術
nfv-survey-2016Network Function Virtualization: State-of-the-Art and Research Challenges学術
sfc-placement-2014Specifying and Placing Chains of Virtual Network Functions学術
ghodsi-drf-2011Dominant Resource Fairness: Fair Allocation of Multiple Resource Types学術
gandiva-2018Gandiva: Introspective Cluster Scheduling for Deep Learning学術
calvin-2012Calvin: Fast Distributed Transactions for Partitioned Database Systems学術
spanner-2012Spanner: Google's Globally-Distributed Database学術
amorphos-2018Sharing, Protection, and Compatibility for Reconfigurable Fabric with AmorphOS学術
fpga-online-placement-2003Online Scheduling and Placement of Real-Time Tasks to Partially Reconfigurable Devices学術
imprecise-computation-1991Algorithms for Scheduling Imprecise Computations学術
branchynet-2016BranchyNet: Fast Inference via Early Exiting from Deep Neural Networks学術
moldable-parallelizable-tasks-1992Approximate Algorithms for Scheduling Parallelizable Tasks学術
serverless-rise-2019The Rise of Serverless Computing学術
gang-scheduling-1995Parallel Job Scheduling: Issues and Approaches学術
large-minibatch-sgd-2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour学術
fisher-thompson-1963Probabilistic learning combinations of local job-shop scheduling rules引用-とリンク-のみ
lawrence-1984Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement)引用-とリンク-のみ
adams-balas-zawack-1988The shifting bottleneck procedure for job shop scheduling標準
applegate-cook-1991A computational study of the job-shop scheduling problem標準
storer-wu-vaccari-1992New search spaces for sequencing problems with application to job shop scheduling標準
yamada-nakano-1992A genetic algorithm applicable to large-scale job-shop problems引用-とリンク-のみ
demirkol-mehta-uzsoy-1998Benchmarks for shop scheduling problems標準
dauzere-peres-paulli-1997General multiprocessor job-shop scheduling using tabu search標準
vallada-ruiz-framinan-2015New hard benchmark for flowshop scheduling problems minimising makespan標準
ruiz-maroto-alcaraz-2005Flowshop scheduling with sequence dependent setup times using advanced metaheuristics標準
van-peteghem-vanhoucke-2014Metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances標準
debels-vanhoucke-2007A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem標準
cicirello-wtsds-benchmarkWeighted tardiness scheduling with sequence-dependent setups: a benchmark library標準
crauwels-potts-vanwassenhove-1998Local search heuristics for the single machine total weighted tardiness scheduling problem学術
van-hoorn-2018The current state of bounds on benchmark instances of the job-shop scheduling problem学術
scheduleopt-benchmarksScheduleOpt benchmark collection: JSPLib and FJSPLib instances with verified bounds標準
zenodo-pfsp-bks-2021Permutation flow-shop: best-known makespans and schedules for Taillard and VRF benchmarks標準
solutionsupdate-ugent-rcpspBest known results for the resource-constrained project scheduling problem産業
cloud-datasets-survey-2025Public Datasets for Cloud Computing: A Comprehensive Survey学術
fog-placement-survey-2023Fog/edge node placement survey学術
topcuoglu-heft-2002Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing学術
canon-dag-bias-2019A Comparison of Random Task Graph Generation Methods for Scheduling Problems学術
ifogsim2-2022iFogSim2 extended fog/edge simulator学術
rl4co-2023RL4CO reinforcement-learning-for-CO benchmark学術

正準参照スイート

default_reference_suites() のレジストリは、各汎用スケジューリングファミリが係留する 正準の公刊インスタンススイートを記録します:識別子、ファミリ、インスタンス数、取得 ポインタ、およびそのスイートの境界を公表する最良-既知-解トラッカー。古典スイートは 引用とリンクのみです——DispatchAtlas がサードパーティのインスタンスファイルをバンドル または再配布することは決してありません。

スイートファミリインスタンス数ダウンロードBKS トラッカー
fisher-thompsonjob-shop3OR-Libraryvan-hoorn-2018, scheduleopt-benchmarks
lawrencejob-shop40JSPLIB ミラーvan-hoorn-2018, scheduleopt-benchmarks
adams-balas-zawackjob-shop5JSPLIB ミラーvan-hoorn-2018, scheduleopt-benchmarks
applegate-cook-orbjob-shop10JSPLIB ミラーvan-hoorn-2018, scheduleopt-benchmarks
storer-wu-vaccarijob-shop20JSPLIB ミラーvan-hoorn-2018, scheduleopt-benchmarks
yamada-nakanojob-shop4JSPLIB ミラーvan-hoorn-2018, scheduleopt-benchmarks
taillard-jspjob-shop80JSPLIB ミラーvan-hoorn-2018, scheduleopt-benchmarks
demirkol-dmujob-shop80JSPLIB ミラーscheduleopt-benchmarks
brandimarte-mk柔軟 job-shop15SchedulingLab ミラーscheduleopt-benchmarks
hurink-fjsp柔軟 job-shop198SchedulingLab ミラーscheduleopt-benchmarks
dauzere-peres-paulli柔軟 job-shop18SchedulingLab ミラーscheduleopt-benchmarks
taillard-pfspフローショップ120OR-Libraryzenodo-pfsp-bks-2021
vrf-pfspフローショップ480SOA グループサイトzenodo-pfsp-bks-2021
sdst-taillard-ruizセットアップフローショップ480SOA グループサイト最良解はインスタンスに同梱
cicirello-wt-sds機械スケジューリング120Harvard Dataversecicirello-wtsds-benchmark
or-library-smtwt機械スケジューリング375OR-Librarycrauwels-potts-vanwassenhove-1998
vallada-ruiz-upmsp機械スケジューリング1640(報告値)SOA グループサイト
psplibRCPSP2040PSPLIB サイトpsplib-1997
mmlibRCPSP4320(報告値)OR&S ランディングページsolutionsupdate-ugent-rcpsp
rg300RCPSP480OR&S ランディングページsolutionsupdate-ugent-rcpsp

バンドルされたパーサを持つスイート(標準 job-shop テキスト、Taillard フローショップ 行列、.fjs 柔軟 job-shop、WfCommons WfFormat JSON)は、オペレーターがダウンロード してローカルの resources/ ツリー下に配置したファイルから load_reference_suite(suite_id, instances_root=...) で取り込まれます。取り込みは完全に オフラインで走り、合成生成器と同じ検証、特徴づけ、ハッシュ化、来歴エンベロープを再利用 し、各問題にその suite_idupstream_instance_id を刻印します。レジストリ-のみの スイートは、バンドルされたパーサなしに、その引用と取得ポインタとともに記録されます。

最良-既知-解レジストリ

インスタンス-毎の最良-既知値が DispatchAtlas とともに出荷されることは決してありません。 オペレーターはそれらを、プライベートな resources/benchmarks/bks/ ディレクトリ下の JSON ファイルとして、スイートごとに1ファイルで取り込みます。各ファイルは schema_versionsuite_id、トラッカーの source_id、取得日、および値エントリ (インスタンス識別子、目的、値、最適-または-上界の種別、任意の下界)を運びます。 load_best_known_registry はすべてのファイルを参照スイートと引用マトリクスに対して 検証し、未知のスイート、未知のトラッカー、重複エントリ、または不整合な境界に対して 閉じて失敗します。取り込まれたレジストリなしでは、相対-乖離メトリックは単に利用不能 です——それらが部分的に計算されることは決してなく、いかなる公開面にも最良-既知値は 現れません。

較正乖離

合成の汎用ファミリは、その生成スキームを再現すると主張することなく、正準スイートに 係留されます。既知の乖離は隠されるのではなく文書化されます:

ファミリ公刊慣行合成慣行
セットアップフローショップ処理時間の 10/50/100/125% の SDST-Taillard セットアップ3つのセットアップファミリ、コスト = ファミリ + 1
機械スケジューリング(R||Cmax)U[1,100] 処理時間クラスと相関-機械バリアントペア-毎の速度係数 0.5–2.0

公刊慣行に対する比較は、合成ファミリを通じてではなく、取り込まれた正準インスタンスを 経由します。

特徴づけ

各具現化問題は以下についての正規化記述子を受け取ります:

  • 機会密度
  • 互換性疎性
  • 競合と過負荷
  • 依存深度
  • 通信圧力
  • セットアップ強度
  • 負荷偏りと異質性
  • 目的衝突
  • 不確実性と動性
  • ソルバー感度

現実-ギャップ橋渡し

各完全キャンペーン証拠-グレードプロファイルは現実-ギャップ橋渡しを宣言します:その状態 (syntheticcalibrated-synthetictrace-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,
)

それらの完全キャンペーン証拠-グレードカタログは引用-裏付け、特徴づけ済み、ハッシュ-リンク 済みであり、キャンペーン、開示、公開ゲートが特定の主張を昇格させるまでは較正証拠として ラベル付けされたままです。