跳到内容
DispatchAtlas
搜索

基准模型

dispatchatlas.bench 在求解器或活动消费基准证据之前先定义它。一个基准族声明其分类法、 领域剖面、剖面类、假设、引用证据、规模包络、种子命名空间,以及输出模式。物化用 dispatchatlas.core 验证每个生成的问题,特征化该实例,将其包裹在一个来源信封中,并记录 稳定哈希。

该目录将通用组合-优化调度族与 distributed-computing 调度作为co-equal同侪覆盖,因此该平台 并非一个仅-distributed-computing 工具。

可运行示例: examples/benchmark_continuum.py 即时生成、特征化并编目一个连续统基准图集。

调度族

每个调度族被物化为一个带至少一个生成器剖面的一等目录同侪。下面的目录表由基准生成器注册表 与引用矩阵生成,因此其族总数与来源引用可从行本身计数。表格上方的一张族-分布图展示各族剖面如何分布于各个调度族类别。

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 使该杠杆显式化。

在协同分配之外,三个连续统族行使其各自的结构杠杆。elastic-serverless-autoscale 族行使 可塑执行:每个函数调用声明不止一个执行模式——一个仅-在家的窄模式与一个从小型共享突发 池借用一个 worker 以更早完成的宽模式——因此调度为每个任务选择一个模式,而顺序决定哪些调用 认领稀缺的宽-且-快模式。distributed-training-gang 族行使帮派协同调度:一个同步 数据-并行训练作业的 workers 共享一个帮派并必须在一次全有或全无的启动中于不同加速器上共同 启动——workers 复用加速器池且作业随时间到达,因此一个作业在足够加速器同时空出之前无法开始, 而顺序决定哪个作业最先获取其完整 worker 集。multi-tenant-fair-share 族行使 主导-资源公平:若干非对称-规模的租户在一个共享节点池上放置放置-灵活的任务,而 主导-资源-份额目标对最多-与最少-被服务租户的主导份额之间的离差打分——因此放置,即每个租户 占用哪些资源,是平衡或扭曲它的杠杆。可运行的 examples/serverless_autoscale_study.pyexamples/distributed_training_gang_study.pyexamples/multi_tenant_fairshare_study.py 使这三个杠杆显式化。

剖面类

剖面类含义
classical派生自一个标准组合-优化语料。
structurally-complex携带优先级、DAG,或资源-网络结构。
ioe-complete万物互联-完整的分布式场景。
trace-backed基于一个具名的真实世界负载轨迹。
domain-specific为单一运营领域量身定制。

证据标签

标签用途
smoke用于测试、示例、文档与预览的小型确定性实例。
exploratory尚未有引用支撑或完全特征化的可信材料。
候选证据等级等待试点、统计与活动关卡的有引用支撑材料。
完整活动证据等级已通过引用、特征化、统计、披露与质量关卡的证据。

烟雾目录绝非最终评估证据。它们存在以证明生成器、验证、特征化、引用检查与持久化快速运作。 门户目录与下载以这一小型烟雾规模(一个三-资源池)预览每个连续统族;一个协同分配族无法在 如此小的池上展现不相交-资源并行性,因此该独特结构是一个研究-规模属性。 build_continuum_full_catalog() 以每个族声明的研究规模物化它——更大的资源池与任务计数, 在那里协同分配、争用与放置结构真正显现——用于研究-级基准包。

分类法

分类法覆盖调度结构、环境、基础设施真实性、目标特征、约束特征、不确定性,以及动态性。 示例包括 DAG 工作流、独立任务批、serverless 函数、容器与 VM 整合、edge 与 cloud 环境、 公开轨迹、多-目标优化、deadline、数据局部性、churn,以及动态到达。

引用矩阵

基准主张针对 CitationMatrix 检查。候选与完整活动证据-等级主张除非引用有引用支撑的来源, 否则验证失败。不被支持的材料必须保持 exploratory,直到证据被添加。

来源集在 default_citation_matrix() 中以稳定来源标识符、可解析引用与一份记录的许可姿态 声明。它跨越三个层级:标准组合-优化语料(仅引用与链接,绝不捆绑)、生产集群轨迹,以及一组 广泛的当代真实世界 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)用 load_reference_suite(suite_id, instances_root=...) 从 操作者下载并放置于本地 resources/ 树下的文件摄取。摄取完全离线运行,复用与合成生成器 相同的验证、特征化、哈希与来源信封,并为每个问题打上其 suite_idupstream_instance_id 印记。仅-注册表套件以其引用与检索指针记录,不带捆绑解析器。

最佳-已知-解注册表

逐-实例最佳已知值绝不随 DispatchAtlas 分发。操作者将它们作为 JSON 文件摄取到一个私有的 resources/benchmarks/bks/ 目录之下,每个套件一个文件,每个文件携带 schema_versionsuite_id、追踪器 source_id、检索日期,以及取值条目(实例标识符、目标、取值、 最优-或-上界种类、可选下界)。load_best_known_registry 针对参考套件与引用矩阵验证每个 文件,并在未知套件、未知追踪器、重复条目或不一致界值上失败关闭。没有已摄取的注册表, 相对-偏差度量就完全不可用——它们绝不被部分计算,且任何公开表面上都不出现最佳已知值。

校准分歧

合成通用族锚定于规范套件,而不声称复现其生成方案。已知分歧被记录而非隐藏:

已发表惯例合成惯例
换装流水车间SDST-Taillard 换装为处理时间的 10/50/100/125%三个换装族,代价 = 族 + 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])

捆绑的烟雾目录将两个 distributed-computing 族(cloud/edge 独立-任务与 workflow DAG)与十四个 通用调度族(机器调度、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,
)

那些完整活动证据-等级目录有引用支撑、经特征化、哈希-链接,且在活动、披露与发布关卡提升 特定主张之前仍标记为校准证据。