On the public citation graph

Towards Optimality in Parallel Scheduling

0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.1997.1335openalex-snapshot
Parallel Application Scheduling on Networks of Workstations
inferredcites →https://doi.org/10.1006/jpdc.2002.1869openalex-snapshot
Using Moldability to Improve the Performance of Supercomputer Jobs
inferredcites →https://doi.org/10.1007/3-540-63574-2_14openalex-snapshot
Theory and practice in parallel job scheduling
inferredcites →https://doi.org/10.1007/978-3-642-35473-1_56openalex-snapshot
Effective Processor Allocation for Moldable Jobs with Application Speedup Model
inferredcites →https://doi.org/10.1007/bf02024665openalex-snapshot
Upper and lower bounds for the waiting time in the symmetric shortest queue system
inferredcites →https://doi.org/10.1016/0166-5316(93)90004-eopenalex-snapshot
An approximation for the mean response time for shortest queue routing with general interarrival and service times
inferredcites →https://doi.org/10.1016/0898-1221(77)90118-3openalex-snapshot
Queueing systems, volume II: computer applications
inferredcites →https://doi.org/10.1016/b978-0-12-415993-8.00003-7openalex-snapshot
Patterns
inferredcites →https://doi.org/10.1016/j.peva.2007.06.012openalex-snapshot
Analysis of join-the-shortest-queue routing for web server farms
inferredcites →https://doi.org/10.1016/j.peva.2011.07.015openalex-snapshot
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services
inferredcites →https://doi.org/10.1016/s0166-5316(02)00110-4openalex-snapshot
Insensitivity in processor-sharing networks
inferredcites →https://doi.org/10.1016/s0304-3975(99)00186-3openalex-snapshot
Scheduling in the dark
inferredcites →https://doi.org/10.1017/s000186780001315xopenalex-snapshot
Response times in M/M/s fork-join networks
inferredcites →https://doi.org/10.1109/clustr.2000openalex-snapshot
Proceedings IEEE International Conference on Cluster Computing. CLUSTER 2000
inferredcites →https://doi.org/10.1109/mc.2008.209openalex-snapshot
Amdahl's Law in the Multicore Era
inferredcites →https://doi.org/10.1145/1375457.1375490openalex-snapshot
QDSL
inferredcites →https://doi.org/10.1145/1384529.1375490openalex-snapshot
QDSL
inferredcites →https://doi.org/10.1145/1454115.1454128openalex-snapshot
The PARSEC benchmark suite
inferredcites →https://doi.org/10.1145/1555349.1555368openalex-snapshot
Optimal power allocation in server farms
inferredcites →https://doi.org/10.1145/1555349.1555383openalex-snapshot
Surprising results on task assignment in server farms with high-variability workloads
inferredcites →https://doi.org/10.1145/1993744.1993759openalex-snapshot
On the power of (even a little) centralization in distributed processing
inferredcites →https://doi.org/10.1145/2007116.2007131openalex-snapshot
On the power of (even a little) centralization in distributed processing
inferredcites →https://doi.org/10.1145/2492101.1555368openalex-snapshot
Optimal power allocation in server farms
inferredcites →https://doi.org/10.1145/2492101.1555383openalex-snapshot
Surprising results on task assignment in server farms with high-variability workloads
inferredcites →https://doi.org/10.1145/2785956.2787481openalex-snapshot
Hopper
inferredcites →https://doi.org/10.1145/2829988.2787481openalex-snapshot
Hopper
inferredcites →https://doi.org/10.1145/2935764.2935782openalex-snapshot
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time
inferredcites →https://doi.org/10.1145/3053277.3053279openalex-snapshot
PARSEC3.0
inferredcites →https://doi.org/10.1145/3152042.3152055openalex-snapshot
Optimally Scheduling Jobs with Multiple Tasks
inferredcites →https://doi.org/10.1145/321879.321887openalex-snapshot
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
inferredcites →https://doi.org/10.1287/mnsc.19.7.717openalex-snapshot
Semi-Markov Decision Processes with Unbounded Rewards
inferredcites →https://doi.org/10.1287/moor.1110.0533openalex-snapshot
Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems
inferredcites →https://doi.org/10.1287/opre.2014.1330openalex-snapshot
The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains
inferredcites →https://doi.org/10.1561/0900000002openalex-snapshot
Monotonicity in Markov Reward and Decision Chains: Theory and Applications
inferredcites →https://doi.org/10.1561/9781601980298openalex-snapshot
Monotonicity in Markov Reward and Decision Chains: Theory and Applications
inferredcites →https://doi.org/10.2307/2291177openalex-snapshot
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
inferredcites →https://doi.org/10.5555/1496770.1496845openalex-snapshot
Scalably scheduling processes with arbitrary speedup curves
inferredcites →https://doi.org/10.5555/2616448.2616475openalex-snapshot
GRASS: trimming stragglers in approximation analytics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-43185-2_21openalex-snapshot
A Quantitative Approach to Coordinated Scaling of Resources in Complex Cloud Computing Workflows
inferred← citeshttps://doi.org/10.1007/978-3-032-14163-7_18openalex-snapshot
A Comparative Study of Heuristic and Metaheuristic Approaches to Multiprocessor Task Scheduling
inferred← citeshttps://doi.org/10.1007/s11134-020-09684-6openalex-snapshot
Open problems in queueing theory inspired by datacenter computing
inferred← citeshttps://doi.org/10.1007/s11134-022-09848-6openalex-snapshot
WCFS: a new framework for analyzing multiserver systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.017openalex-snapshot
Energy Consumption by Servers under Unknown Service Demand
inferred← citeshttps://doi.org/10.1016/j.mlwa.2023.100485openalex-snapshot
A reinforcement learning algorithm for scheduling parallel processors with identical speedup functions
inferred← citeshttps://doi.org/10.1016/j.peva.2020.102147openalex-snapshot
heSRPT: Parallel scheduling to minimize mean slowdown
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102246openalex-snapshot
The case for phase-aware scheduling of parallelizable jobs
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102189openalex-snapshot
EXPPO: EXecution Performance Profiling and Optimization for CPS Co-simulation-as-a-Service
inferred← citeshttps://doi.org/10.1109/isorc49007.2020.00040openalex-snapshot
EXPPO: EXecution Performance Profiling and Optimization for CPS Co-simulation-as-a-Service
inferred← citeshttps://doi.org/10.1109/mascots.2018.00037openalex-snapshot
A Model-Based Approach to Streamlining Distributed Training for Asynchronous SGD
inferred← citeshttps://doi.org/10.1109/tpds.2019.2938172openalex-snapshot
Performance Modeling of Parallel Loops on Multi-Socket Platforms Using Queueing Systems
inferred← citeshttps://doi.org/10.1109/tpds.2025.3585821openalex-snapshot
Compositional Coordinated Resource Provisioning in Workflows With Stochastic Durations
inferred← citeshttps://doi.org/10.1145/3219617.3219666openalex-snapshot
Towards Optimality in Parallel Job Scheduling
inferred← citeshttps://doi.org/10.1145/3292040.3219666openalex-snapshot
Towards Optimality in Parallel Job Scheduling
inferred← citeshttps://doi.org/10.1145/3350755.3400265openalex-snapshot
Optimal Resource Allocation for Elastic and Inelastic Jobs
inferred← citeshttps://doi.org/10.1145/3529113.3529128openalex-snapshot
Speed Scaling with Multiple Servers under a Sum-Power Constraint
inferred← citeshttps://doi.org/10.1145/3777911.3800627openalex-snapshot
Compositional Coordinated Resource Provisioning for Workflows with Stochastic Durations in Kubernetes
inferred← citeshttps://doi.org/10.4018/978-1-7998-7156-9.ch003openalex-snapshot
Optimal Scheduling of Parallel Jobs With Unknown Service Requirements
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.