Lewati ke konten
DispatchAtlas
Cari

Model Benchmark

dispatchatlas.bench mendefinisikan bukti benchmark sebelum solver atau kampanye mengonsumsinya. Sebuah famili benchmark mendeklarasikan taksonomi, profil domain, kelas profil, asumsi, bukti sitasi, amplop skala, ruang-nama benih, dan skema keluarannya. Materialisasi memvalidasi setiap masalah yang dihasilkan dengan dispatchatlas.core, mengkarakterisasi instans, membungkusnya dalam amplop provenans, dan mencatat hash stabil.

Katalog mencakup famili penjadwalan optimisasi-kombinatorial generik dan penjadwalan distributed-computing sebagai rekan co-equal, sehingga platform bukan alat hanya-distributed-computing.

Contoh yang dapat dijalankan: examples/benchmark_continuum.py menghasilkan, mengkarakterisasi, dan mengatalogkan atlas benchmark kontinum secara langsung.

Famili Penjadwalan

Setiap famili penjadwalan dimaterialisasi sebagai rekan katalog kelas-satu dengan setidaknya satu profil generator. Tabel katalog di bawah dihasilkan dari registri generator benchmark dan matriks sitasi, sehingga total famili dan sitasi sumbernya dapat dihitung dari baris itu sendiri. Sebuah diagram distribusi-famili di atas tabel menunjukkan bagaimana profil famili tersebar di seluruh kategori famili-penjadwalan.

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.

Komponen di atas membawa inventaris yang dihasilkan lengkap — famili inti klasik dan distributed-computing di bawah ditambah kontinum famili Edge–Fog–Cloud. Famili inti fondasional itu dalam bentuk dokumen:

FamiliProfilKelas profilKorpus utama
Penjadwalan mesin (R||Cmax, mesin tak-terkait)machine-scheduling-unrelatedclassicalOR-Library
Job-shopjob-shop-classicalclassicalOR-Library, Taillard
Job-shop fleksibel (FJSP)flexible-job-shopclassicalBrandimarte; Hurink-Jurisch-Thole
Flow-shop permutasipermutation-flow-shopclassicalTaillard
Flow-shop setup bergantung-urutan (SDST)setup-flow-shopclassicalAllahverdi et al. (2008); Allahverdi (2015)
Penjadwalan proyek terbatas-sumber-daya (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

Famili mesin-tak-terkait dan job-shop fleksibel melampirkan matriks waktu-eksekusi CostModel ke setiap instans, diekspor sebagai matriks termaterialisasi di samping JSON masalah. Famili flow-shop setup bergantung-urutan justru melampirkan matriks setup CostModel: pergantian antara pekerjaan dari famili berbeda pada satu mesin memakan waktu setup, sehingga tujuan setup memberi ganjaran pengelompokan pekerjaan serupa. Korpus standar bernama yang disebutkan hanya disitasi dan ditautkan dan tidak pernah didistribusikan-ulang di dalam repositori.

Beberapa famili kontinum melatih ko-alokasi multi-sumber-daya: setiap tugas menuntut lebih dari satu sumber daya sekaligus dan konstruktor menahannya bersama selama seluruh durasinya (lihat Kontrak Domain). Famili accelerator-coscheduling meng-ko-alokasi sebuah node komputasi dan sebuah akselerator langka per pekerjaan; famili distributed-transaction meng-ko-alokasi sebuah set kunci kardinalitas-variabel dari shard data per transaksi; dan famili fpga-partitioning meng-ko-alokasi sebuah deret ubin fabric-rekonfigurabel yang kontigu secara spasial per kernel penyewa. Tugas yang set sumber dayanya berpotongan terserialisasi sementara tugas yang lepas berjalan bersamaan — yang dapat dijalankan examples/inspect_coallocation.py membuat tuasnya eksplisit.

Di luar ko-alokasi, tiga famili kontinum melatih tuas strukturalnya sendiri. Famili elastic-serverless-autoscale melatih eksekusi dapat-dibentuk: setiap pemanggilan fungsi mendeklarasikan lebih dari satu mode eksekusi — mode sempit hanya-di-rumah dan mode lebar yang meminjam sebuah worker dari kolam burst bersama kecil untuk selesai lebih cepat — sehingga jadwal memilih satu mode per tugas dan urutan memutuskan pemanggilan mana yang mengklaim mode lebar-dan-cepat yang langka. Famili distributed-training-gang melatih ko-penjadwalan geng: para worker dari pekerjaan pelatihan data-paralel sinkron berbagi sebuah geng dan harus ko-mulai pada akselerator berbeda dalam peluncuran semua-atau-tidak — para worker memakai-ulang kolam akselerator dan pekerjaan tiba seiring waktu, sehingga sebuah pekerjaan tak dapat mulai sampai cukup akselerator bebas serentak, dan urutan memutuskan pekerjaan mana yang lebih dulu memperoleh set worker penuhnya. Famili multi-tenant-fair-share melatih keadilan sumber-daya-dominan: beberapa penyewa berukuran-asimetris menempatkan tugas fleksibel-penempatan pada kolam node bersama, dan tujuan bagian-sumber-daya-dominan menilai sebaran antara bagian dominan penyewa yang paling- dan paling-sedikit-dilayani — sehingga penempatan, sumber daya mana yang ditempati tiap penyewa, adalah tuas yang menyeimbangkan atau memiringkannya. Yang dapat dijalankan examples/serverless_autoscale_study.py, examples/distributed_training_gang_study.py, dan examples/multi_tenant_fairshare_study.py membuat ketiga tuas ini eksplisit.

Kelas Profil

Kelas profilMakna
classicalBerasal dari korpus optimisasi-kombinatorial standar.
structurally-complexMembawa struktur presedensi, DAG, atau jaringan-sumber-daya.
ioe-completeSkenario terdistribusi Internet-of-Everything-lengkap.
trace-backedBerlandaskan jejak beban-kerja dunia-nyata bernama.
domain-specificDisesuaikan untuk satu domain operasional.

Label Bukti

LabelPenggunaan
smokeInstans deterministik kecil untuk pengujian, contoh, dokumen, dan pratinjau.
exploratoryMateri masuk-akal yang belum didukung-sitasi atau dikarakterisasi penuh.
tingkat bukti kandidatMateri didukung-sitasi yang menunggu gerbang pilot, statistik, dan kampanye.
tingkat bukti kampanye-penuhBukti yang telah lolos gerbang sitasi, karakterisasi, statistik, pengungkapan, dan kualitas.

Katalog smoke tidak pernah menjadi bukti evaluasi final. Mereka ada untuk membuktikan bahwa generator, validasi, karakterisasi, pemeriksaan sitasi, dan persistensi bekerja cepat. Katalog portal dan unduhan mempratinjau setiap famili kontinum pada skala smoke kecil ini (kolam tiga-sumber-daya); sebuah famili ko-alokasi tak dapat memamerkan paralelisme sumber-daya-lepas pada kolam sekecil itu, sehingga struktur khasnya adalah properti skala-riset. build_continuum_full_catalog() mematerialisasi setiap famili pada skala riset yang dideklarasikannya -- kolam sumber daya dan jumlah tugas yang lebih besar di mana struktur ko-alokasi, kontensi, dan penempatan sungguh-sungguh terwujud -- untuk bundel benchmark tingkat-riset.

Taksonomi

Taksonomi mencakup struktur penjadwalan, lingkungan, realisme infrastruktur, fitur tujuan, fitur batasan, ketidakpastian, dan dinamisme. Contoh termasuk workflow DAG, batch tugas independen, fungsi serverless, konsolidasi kontainer dan VM, lingkungan edge dan cloud, jejak publik, optimisasi multi-tujuan, deadline, lokalitas data, churn, dan kedatangan dinamis.

Matriks Sitasi

Klaim benchmark diperiksa terhadap CitationMatrix. Klaim tingkat-bukti kandidat dan kampanye-penuh gagal validasi kecuali mereka mereferensikan sumber yang didukung-sitasi. Materi yang tak didukung harus tetap exploratory sampai bukti ditambahkan.

Set sumber dideklarasikan dalam default_citation_matrix() dengan pengidentifikasi sumber stabil, referensi yang dapat-diselesaikan, dan postur lisensi tercatat. Ia merentang tiga tingkat: korpus optimisasi-kombinatorial standar (disitasi dan ditautkan saja, tak pernah dibundel), jejak kluster produksi, dan set luas dataset kontinum Edge–Fog–Cloud dunia-nyata kontemporer — jejak kluster GPU dan machine-learning, suite benchmark microservice dan serverless, jejak workflow-ilmiah, jejak pekerjaan superkomputer, dataset edge-placement dan mobilitas, dataset IoT dan permintaan-seluler, sinyal karbon dan energi grid, beban-kerja pemrosesan-aliran, benchmark partisipasi-perangkat federated-learning, testbed sistem realitas-diperluas, dan jejak jaringan-satelit orbit-bumi-rendah:

Source idReferenceLicense posture
cloudsim-2011CloudSimakademis
dynamic-cloudsim-2015DynamicCloudSimakademis
edge-vision-2016Edge Computing: Vision and Challengesakademis
or-library-1990OR-Libraryhanya-sitasi-dan-tautan
psplib-1997PSPLIBhanya-sitasi-dan-tautan
van-eynde-vanhoucke-2020Resource-constrained multi-project scheduling: benchmark datasets and decoupled schedulinghanya-sitasi-dan-tautan
taillard-1993Benchmarks for basic scheduling problemshanya-sitasi-dan-tautan
gonzalez-sahni-1976Open shop scheduling to minimize finish timeakademis
ruiz-vazquez-2010The hybrid flow shop scheduling problemakademis
smt2020-2020SMT2020—A Semiconductor Manufacturing Testbedcite-and-link-only
hooker-2007Planning and Scheduling by Logic-Based Benders Decompositionakademis
naderi-ruiz-2010The distributed permutation flowshop scheduling problemakademis
hall-sriskandarajah-1996A survey of machine scheduling problems with blocking and no-wait in processakademis
minella-ruiz-2008A review and evaluation of multiobjective algorithms for the flowshop scheduling problemakademis
bartusch-moehring-1988Scheduling project networks with resource constraints and time windowsakademis
hatami-ruiz-2013The distributed assembly permutation flowshop scheduling problemakademis
brandimarte-1993Flexible job shop by tabu searchhanya-sitasi-dan-tautan
de-giovanni-pezzella-2010An improved genetic algorithm for the distributed and flexible job-shop scheduling problemakademis
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 shophanya-sitasi-dan-tautan
allahverdi-survey-2008A survey of scheduling problems with setup times or costsakademis
allahverdi-survey-2015The third comprehensive survey on scheduling problems with setup times/costsakademis
vallada-ruiz-2011A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup timesakademis
stg-task-graphsA standard task graph set for fair evaluation of multiprocessor scheduling algorithmsstandar
google-cluster-dataBorg cluster workload tracesCC-BY-4.0, dapat dipakai dan disitasi
twitter-cache-traces-2020Twitter in-memory cache cluster tracesCC-BY-4.0, dapat dipakai dan disitasi
m100-exadata-2023M100 ExaData supercomputer telemetry and job traceCC-BY-4.0, dapat dipakai dan disitasi
borg-2020Borg: the Next Generationakademis
azure-public-datasetAzure Public DatasetCC-BY-4.0, dapat dipakai dan disitasi
alibaba-cluster-dataAlibaba cluster trace programhanya-sitasi
parallel-workloads-archiveParallel Workloads Archivehanya-sitasi
bitbrains-gwa-t12-2015GWA-T-12 Bitbrains business-critical VM tracehanya-sitasi
materna-gwa-t13-2014GWA-T-13 Materna enterprise datacenter VM tracehanya-sitasi
msr-cambridge-block-2008MSR Cambridge enterprise block-I/O traces (Write Off-Loading)hanya-sitasi
planetlab-workload-2012PlanetLab CPU-utilization consolidation traceshanya-sitasi
dspbench-2020DSPBench stream-processing benchmark suiteakademis
ifogsim-2017iFogSim toolkitakademis
edgecloudsim-2018EdgeCloudSimakademis
aerial-mec-survey-2022Aerial mobile edge computing surveyakademis
crush-2006CRUSH decentralized replica placementakademis
smart-grid-dsm-2012Smart-grid demand-side managementakademis
liu-layland-1973Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environmentakademis
philly-traces-2019Philly DNN-training cluster traceterbuka, dapat dipakai dan disitasi
helios-traces-2021Helios GPU-datacenter traceterbuka, dapat dipakai dan disitasi
acmetrace-2024AcmeTrace language-model-development cluster traceCC-BY-4.0
alibaba-pai-gpu-2020Alibaba PAI MLaaS GPU tracehanya-sitasi
azure-inference-trace-2023Azure model-inference serving traceCC-BY-4.0, dapat dipakai dan disitasi
deathstarbench-2019DeathStarBench microservice suiteApache-2.0, dapat dipakai dan disitasi
alibaba-microservice-characterization-2021Alibaba microservice characterizationakademis
train-ticket-benchmarkTrain-Ticket microservice benchmarkApache-2.0, dapat dipakai dan disitasi
sebs-2021SeBS serverless benchmark suiteBSD-3-Clause, dapat dipakai dan disitasi
functionbench-2019FunctionBench serverless workloadsterbuka, dapat dipakai dan disitasi
wfcommons-pegasus-instancesWfCommons scientific-workflow instancesterbuka, dapat dipakai dan disitasi
bharathi-synthetic-workflows-2008Synthetic scientific-workflow libraryterbuka, dapat dipakai dan disitasi
nrel-eagle-jobs-2023NREL Eagle supercomputer job traceCC-BY-4.0, dapat dipakai dan disitasi
eua-datasetEdge-User-Allocation datasetterbuka, dapat dipakai dan disitasi
shanghai-telecom-edgeShanghai Telecom access tracehanya-sitasi, riset
lust-scenarioLuxembourg SUMO Traffic scenarioakademis, dapat dipakai dan disitasi
intel-lab-dataIntel Lab Data (54-node in-network aggregation)hanya-sitasi-dan-tautan
milano-cdr-2015Milan and Trentino urban datasetCC-BY-4.0, dapat dipakai dan disitasi
citylearn-v2CityLearn grid-interactive benchmarkMIT, dapat dipakai dan disitasi
electricity-maps-grid-ciElectricity Maps grid carbon-intensityparser terbuka (MIT), tingkat data bervariasi
nexmark-benchmarkNEXMark streaming-query benchmarkterbuka, dapat dipakai dan disitasi
yahoo-streaming-benchmark-2016Yahoo Streaming BenchmarkApache-2.0, dapat dipakai dan disitasi
fedscale-2022FedScale federated-learning benchmarkApache-2.0, dapat dipakai dan disitasi
oort-2021Oort guided participant selectionApache-2.0, dapat dipakai dan disitasi
illixr-2021ILLIXR extended-reality testbedNCSA, dapat dipakai dan disitasi
lens-2024LENS LEO satellite-network tracesCC-BY-SA-4.0, dapat dipakai dan disitasi
tsn-craciunas-2016Scheduling Real-Time Communication in IEEE 802.1Qbv TSNakademis
network-slicing-afolabi-2018Network Slicing and Softwarization: A Surveyakademis
digital-twin-diten-2022Survey on Digital Twin Edge Networks (DITEN) Toward 6Gakademis
videoedge-2018VideoEdge: Processing Camera Streams using Hierarchical Clustersakademis
alpaserve-osdi-2023AlpaServe: Statistical Multiplexing with Model Parallelism for Deep Learning Servingakademis
neurosurgeon-asplos-2017Neurosurgeon: Collaborative Intelligence Between the Cloud and Mobile Edgeakademis
occlum-asplos-2020Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGXakademis
confidential-edge-zobaed-2025Confidential Computing across Edge-to-Cloud for Machine Learning: A Survey Studyakademis
batteryless-lucia-pldi-2015A Simpler, Safer Programming and Execution Model for Intermittent Systemsakademis
batteryless-hester-sensys-2017The Future of Sensing is Batteryless, Intermittent, and Awesomeakademis
harvest-vms-ambati-osdi-2020Providing SLOs for Resource-Harvesting VMs in Cloud Platformsakademis
spot-eviction-yang-www-2022Spot Virtual Machine Eviction Prediction in Microsoft Cloudakademis
delay-scheduling-zaharia-eurosys-2010Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Schedulingakademis
geo-analytics-iridium-pu-sigcomm-2015Low Latency Geo-distributed Data Analyticsakademis
coflow-chowdhury-hotnets-2012Coflow: A Networking Abstraction for Cluster Applicationsakademis
varys-chowdhury-sigcomm-2014Efficient Coflow Scheduling with Varysakademis
vllm-pagedattention-2023Efficient Memory Management for Large Language Model Serving with PagedAttentionakademis
orca-serving-2022Orca: A Distributed Serving System for Transformer-Based Generative Modelsakademis
pond-cxl-2023Pond: CXL-Based Memory Pooling Systems for Cloud Platformsakademis
tpp-cxl-2023TPP: Transparent Page Placement for CXL-Enabled Tiered-Memoryakademis
ipipe-smartnic-2019Offloading Distributed Applications onto SmartNICs using iPipeakademis
e3-smartnic-2019E3: Energy-Efficient Microservices on SmartNIC-Accelerated Serversakademis
switch-transformers-2022Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsityakademis
lina-moe-2023Accelerating Distributed MoE Training and Inference with Linaakademis
gpipe-2019GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelismakademis
pipedream-2019PipeDream: Generalized Pipeline Parallelism for DNN Trainingakademis
vestal-2007Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assuranceakademis
mixed-criticality-survey-2017A Survey of Research into Mixed Criticality Systemsakademis
valiant-bsp-1990A Bridging Model for Parallel Computationakademis
pregel-2010Pregel: A System for Large-Scale Graph Processingakademis
nfv-survey-2016Network Function Virtualization: State-of-the-Art and Research Challengesakademis
sfc-placement-2014Specifying and Placing Chains of Virtual Network Functionsakademis
ghodsi-drf-2011Dominant Resource Fairness: Fair Allocation of Multiple Resource Typesakademis
gandiva-2018Gandiva: Introspective Cluster Scheduling for Deep Learningakademis
calvin-2012Calvin: Fast Distributed Transactions for Partitioned Database Systemsakademis
spanner-2012Spanner: Google's Globally-Distributed Databaseakademis
amorphos-2018Sharing, Protection, and Compatibility for Reconfigurable Fabric with AmorphOSakademis
fpga-online-placement-2003Online Scheduling and Placement of Real-Time Tasks to Partially Reconfigurable Devicesakademis
imprecise-computation-1991Algorithms for Scheduling Imprecise Computationsakademis
branchynet-2016BranchyNet: Fast Inference via Early Exiting from Deep Neural Networksakademis
moldable-parallelizable-tasks-1992Approximate Algorithms for Scheduling Parallelizable Tasksakademis
serverless-rise-2019The Rise of Serverless Computingakademis
gang-scheduling-1995Parallel Job Scheduling: Issues and Approachesakademis
large-minibatch-sgd-2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourakademis
fisher-thompson-1963Probabilistic learning combinations of local job-shop scheduling ruleshanya-sitasi-dan-tautan
lawrence-1984Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement)hanya-sitasi-dan-tautan
adams-balas-zawack-1988The shifting bottleneck procedure for job shop schedulingstandar
applegate-cook-1991A computational study of the job-shop scheduling problemstandar
storer-wu-vaccari-1992New search spaces for sequencing problems with application to job shop schedulingstandar
yamada-nakano-1992A genetic algorithm applicable to large-scale job-shop problemshanya-sitasi-dan-tautan
demirkol-mehta-uzsoy-1998Benchmarks for shop scheduling problemsstandar
dauzere-peres-paulli-1997General multiprocessor job-shop scheduling using tabu searchstandar
vallada-ruiz-framinan-2015New hard benchmark for flowshop scheduling problems minimising makespanstandar
ruiz-maroto-alcaraz-2005Flowshop scheduling with sequence dependent setup times using advanced metaheuristicsstandar
van-peteghem-vanhoucke-2014Metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instancesstandar
debels-vanhoucke-2007A decomposition-based genetic algorithm for the resource-constrained project-scheduling problemstandar
cicirello-wtsds-benchmarkWeighted tardiness scheduling with sequence-dependent setups: a benchmark librarystandar
crauwels-potts-vanwassenhove-1998Local search heuristics for the single machine total weighted tardiness scheduling problemakademis
van-hoorn-2018The current state of bounds on benchmark instances of the job-shop scheduling problemakademis
scheduleopt-benchmarksScheduleOpt benchmark collection: JSPLib and FJSPLib instances with verified boundsstandar
zenodo-pfsp-bks-2021Permutation flow-shop: best-known makespans and schedules for Taillard and VRF benchmarksstandar
solutionsupdate-ugent-rcpspBest known results for the resource-constrained project scheduling problemindustri
cloud-datasets-survey-2025Public Datasets for Cloud Computing: A Comprehensive Surveyakademis
fog-placement-survey-2023Fog/edge node placement surveyakademis
topcuoglu-heft-2002Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computingakademis
canon-dag-bias-2019A Comparison of Random Task Graph Generation Methods for Scheduling Problemsakademis
ifogsim2-2022iFogSim2 extended fog/edge simulatorakademis
rl4co-2023RL4CO reinforcement-learning-for-CO benchmarkakademis

Suite Referensi Kanonik

Registri dalam default_reference_suites() merekam suite instans terpublikasi kanonik yang menjadi jangkar setiap famili penjadwalan generik: identitas, famili, jumlah instans, penunjuk pengambilan, dan pelacak best-known-solution yang menerbitkan batas untuk suite tersebut. Suite klasik hanya disitasi dan ditautkan — DispatchAtlas tidak pernah membundel atau mendistribusikan-ulang berkas instans pihak-ketiga.

SuiteFamiliInstansUnduhanPelacak BKS
fisher-thompsonjob-shop3OR-Libraryvan-hoorn-2018, scheduleopt-benchmarks
lawrencejob-shop40Mirror JSPLIBvan-hoorn-2018, scheduleopt-benchmarks
adams-balas-zawackjob-shop5Mirror JSPLIBvan-hoorn-2018, scheduleopt-benchmarks
applegate-cook-orbjob-shop10Mirror JSPLIBvan-hoorn-2018, scheduleopt-benchmarks
storer-wu-vaccarijob-shop20Mirror JSPLIBvan-hoorn-2018, scheduleopt-benchmarks
yamada-nakanojob-shop4Mirror JSPLIBvan-hoorn-2018, scheduleopt-benchmarks
taillard-jspjob-shop80Mirror JSPLIBvan-hoorn-2018, scheduleopt-benchmarks
demirkol-dmujob-shop80Mirror JSPLIBscheduleopt-benchmarks
brandimarte-mkjob-shop (fleksibel)15Mirror SchedulingLabscheduleopt-benchmarks
hurink-fjspjob-shop (fleksibel)198Mirror SchedulingLabscheduleopt-benchmarks
dauzere-peres-paullijob-shop (fleksibel)18Mirror SchedulingLabscheduleopt-benchmarks
taillard-pfspflow-shop120OR-Libraryzenodo-pfsp-bks-2021
vrf-pfspflow-shop480Situs grup SOAzenodo-pfsp-bks-2021
sdst-taillard-ruizsetup-flow-shop480Situs grup SOAsolusi terbaik disertakan bersama instans
cicirello-wt-sdsmachine-scheduling120Harvard Dataversecicirello-wtsds-benchmark
or-library-smtwtmachine-scheduling375OR-Librarycrauwels-potts-vanwassenhove-1998
vallada-ruiz-upmspmachine-scheduling1640 (dilaporkan)Situs grup SOA
psplibrcpsp2040Situs PSPLIBpsplib-1997
mmlibrcpsp4320 (dilaporkan)Laman OR&Ssolutionsupdate-ugent-rcpsp
rg300rcpsp480Laman OR&Ssolutionsupdate-ugent-rcpsp

Suite dengan parser yang dibundel (teks job-shop standar, matriks flow-shop Taillard, job-shop fleksibel .fjs, JSON WfFormat WfCommons) di-ingest dengan load_reference_suite(suite_id, instances_root=...) dari berkas yang diunduh operator dan ditempatkan di bawah pohon resources/ lokal. Ingesti berjalan sepenuhnya luring, memakai-ulang amplop validasi, karakterisasi, hashing, dan provenans yang sama dengan generator sintetik, dan mencap setiap masalah dengan suite_id dan upstream_instance_id-nya. Suite hanya-registri direkam dengan sitasi dan penunjuk pengambilannya tanpa parser yang dibundel.

Registri Best-Known-Solution

Nilai best-known per-instans tidak pernah disertakan bersama DispatchAtlas. Operator meng-ingest-nya sebagai berkas JSON di bawah direktori privat resources/benchmarks/bks/, satu berkas per suite, masing-masing membawa schema_version, suite_id, source_id pelacak, tanggal pengambilan, dan entri nilai (id instans, tujuan, nilai, jenis optimum-atau-batas-atas, batas bawah opsional). load_best_known_registry memvalidasi setiap berkas terhadap suite referensi dan matriks sitasi serta gagal tertutup pada suite tak-dikenal, pelacak tak-dikenal, entri duplikat, atau batas yang tak-konsisten. Tanpa registri yang ter-ingest, metrik deviasi-relatif sama sekali tidak tersedia — metrik itu tidak pernah dihitung sebagian, dan tidak ada nilai best-known yang muncul di permukaan publik mana pun.

Divergensi Kalibrasi

Famili generik sintetik dijangkarkan ke suite kanonik tanpa mengklaim mereproduksi skema pembangkitannya. Divergensi yang diketahui didokumentasikan alih-alih disembunyikan:

FamiliKonvensi terpublikasiKonvensi sintetik
flow-shop setupsetup SDST-Taillard pada 10/50/100/125% waktu pemrosesantiga famili setup, biaya = famili + 1
penjadwalan mesin (R||Cmax)kelas durasi U[1,100] dan varian mesin-terkorelasifaktor kecepatan per-pasangan 0,5–2,0

Perbandingan terhadap konvensi terpublikasi dirutekan melalui instans kanonik yang ter-ingest, bukan melalui famili sintetik.

Karakterisasi

Setiap masalah termaterialisasi menerima deskriptor ternormalisasi untuk:

  • kepadatan peluang
  • kelangkaan kompatibilitas
  • kontensi dan kelebihan-muatan
  • kedalaman dependensi
  • tekanan komunikasi
  • intensitas setup
  • kemiringan beban dan heterogenitas
  • konflik tujuan
  • ketidakpastian dan dinamisme
  • sensitivitas solver

Jembatan Distribution-Distance

Setiap profil tingkat-bukti kampanye-penuh mendeklarasikan jembatan distribution-distance: statusnya (synthetic, calibrated-synthetic, trace-backed, atau externally-sourced), bukti kalibrasi, skenario domain, cakupan transfer dan gangguan, dan risiko distribution-distance residual. Promosi ke tingkat-bukti kampanye-penuh gagal tertutup kecuali cakupan transfer dan gangguan dideklarasikan, dan profil calibrated-synthetic harus menamai referensi trace-backed yang menjadi acuan kalibrasinya. Famili calibrated-synthetic menamai referensi jejaknya secara eksplisit; suite kanonik yang ter-ingest membawa jembatan externally-sourced, dan adapter WfCommons adalah sumber instans trace-backed terurai-eksternal yang pertama, memberi distribution_distance_score sebuah kaki referensi trace-backed yang nyata.

Metrik kalibrasi bernama melaporkan jarak 1-Wasserstein (pemindah-tanah) per-fitur antara distribusi fitur karakterisasi profil calibrated-synthetic dan distribusi instans referensi trace-backed-nya. Jarak per-fitur diagregasi menjadi skor distribution-distance tunggal; skor di atas ambang divergensi-maksimum (default 0.25) berarti profil telah menyimpang terlalu jauh dari referensinya dan gagal kalibrasi. Metrik dapat direproduksi dari instans termaterialisasi dan jejak referensi bernama.

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

Stratifikasi dan Seleksi Subset

difficulty_score mengagregasi deskriptor kontensi, kelebihan-muatan, kedalaman-dependensi, dan sensitivitas-solver menjadi skor kesulitan ternormalisasi, dan stratify_instances membin instans termaterialisasi ke dalam strata kesulitan rendah, sedang, dan tinggi. select_benchmark_subset memilih subset deterministik yang difilter berdasarkan famili, kelas profil, dan strata kesulitan, diurutkan berdasarkan pengidentifikasi masalah sehingga seleksinya dapat direproduksi.

Katalog Smoke

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

Katalog smoke yang dibundel mencakup dua famili distributed-computing (cloud/edge tugas-independen dan workflow DAG) di samping empat belas famili penjadwalan generik (penjadwalan mesin, job-shop, job-shop fleksibel, flow-shop permutasi, flow-shop setup bergantung-urutan, RCPSP, open-shop, flow-shop hibrida, flow-shop permutasi terdistribusi, flow-shop tanpa-tunggu, flow-shop pemblokiran, flow-shop perakitan terdistribusi, flow-shop permutasi multi-objektif, dan RCPSP/max) sebagai rekan co-equal. Setiap instans deterministik dari benih akar dan menggunakan metadata generator yang didukung-sitasi sambil tetap dilabeli sebagai materi pengembangan smoke.

Katalog Penuh Kandidat

Katalog kampanye-penuh kandidat menggunakan jalur materialisasi yang sama dengan jumlah masalah terkonfigurasi yang lebih besar dan label bukti yang lebih ketat:

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

Katalog tingkat-bukti kampanye-penuh itu didukung-sitasi, dikarakterisasi, ditaut-hash, dan masih dilabeli sebagai bukti kalibrasi sampai gerbang kampanye, pengungkapan, dan publikasi mempromosikan klaim spesifik.