On the public citation graph
Using runtime measured workload characteristics in parallel processor scheduling
0 signed · 66 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-60153-8_25openalex-snapshot
Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors
inferredcites →https://doi.org/10.1007/3-540-60153-8_26openalex-snapshot
Multiprocessor scheduling for high-variability service time distributions
inferredcites →https://doi.org/10.1007/3-540-60153-8_38openalex-snapshot
Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860
inferredcites →https://doi.org/10.1007/bf02577787openalex-snapshot
Coscheduling based on runtime identification of activity working sets
inferredcites →https://doi.org/10.1007/bfb0022294openalex-snapshot
Parallel application characterization for multiprocessor scheduling policy design
inferredcites →https://doi.org/10.1016/0166-5316(94)90036-1openalex-snapshot
Application scheduling and processor allocation in multiprogrammed parallel processing systems
inferredcites →https://doi.org/10.1016/0166-5316(94)90037-xopenalex-snapshot
Robust partitioning policies of multiprocessor systems
inferredcites →https://doi.org/10.1016/0166-5316(96)00030-2openalex-snapshot
Using parallel program characteristics in dynamic processor allocation policies
inferredcites →https://doi.org/10.1109/32.90447openalex-snapshot
The processor working set and its use in scheduling multiprocessor systems
inferredcites →https://doi.org/10.1109/71.273046openalex-snapshot
Using processor affinity in loop scheduling on shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/ipps.1996.508096openalex-snapshot
Maximizing speedup through self-tuning of processor allocation
inferredcites →https://doi.org/10.1109/tc.1987.5009495openalex-snapshot
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
inferredcites →https://doi.org/10.1145/1007771.55608openalex-snapshot
Scheduling in multiprogrammed parallel systems
inferredcites →https://doi.org/10.1145/151244.151246openalex-snapshot
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/151250.151251openalex-snapshot
Chores: enhanced run-time support for shared-memory parallel computing
inferredcites →https://doi.org/10.1145/183018.183023openalex-snapshot
Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies
inferredcites →https://doi.org/10.1145/55595.55608openalex-snapshot
Scheduling in multiprogrammed parallel systems
inferredcites →https://doi.org/10.1145/74850.74866openalex-snapshot
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/74851.74866openalex-snapshot
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/75108.75391openalex-snapshot
Characterizations of parallelism in applications and their use in scheduling
inferredcites →https://doi.org/10.1145/98457.98761openalex-snapshot
The performance of multiprogrammed multiprocessor scheduling algorithms
inferredcites →https://doi.org/10.1145/98460.98761openalex-snapshot
The performance of multiprogrammed multiprocessor scheduling algorithms
inferredcites →https://doi.org/10.1177/109434208900300302openalex-snapshot
The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.550openalex-snapshot
Experiences from integrating algorithmic and systemic load balancing strategies
inferred← citeshttps://doi.org/10.1002/cpe.887openalex-snapshot
Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1335openalex-snapshot
Parallel Application Scheduling on Networks of Workstations
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_7openalex-snapshot
A Tool to Schedule Parallel Applications on Multiprocessors: The NANOS CPU Manager
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_70openalex-snapshot
Parallel Models and Job Characterization for System Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_14openalex-snapshot
Theory and practice in parallel job scheduling
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_16openalex-snapshot
A historical application profiler for use by parallel schedulers
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_21openalex-snapshot
Implementing multiprocessor scheduling disciplines
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_18openalex-snapshot
Online Scheduling of Multiprocessor Jobs with Idle Regulation
inferred← citeshttps://doi.org/10.1007/978-3-642-00904-4_15openalex-snapshot
Power-Aware Bus Coscheduling for Periodic Realtime Applications Running on Multiprocessor SoC
inferred← citeshttps://doi.org/10.1007/bfb0022283openalex-snapshot
Job Scheduling Strategies for Parallel Processing
inferred← citeshttps://doi.org/10.1007/bfb0022284openalex-snapshot
Toward convergence in job schedulers for parallel supercomputers
inferred← citeshttps://doi.org/10.1007/bfb0022294openalex-snapshot
Parallel application characterization for multiprocessor scheduling policy design
inferred← citeshttps://doi.org/10.1007/bfb0022295openalex-snapshot
Dynamic vs. static quantum-based parallel processor allocation
inferred← citeshttps://doi.org/10.1007/s001630012073openalex-snapshot
Coordination Approaches and Systems - Part II: An Operational Perspective
inferred← citeshttps://doi.org/10.1007/s11227-007-0169-6openalex-snapshot
A probabilistic and adaptive scheduling algorithm using system-generated predictions for inter-grid resource sharing
inferred← citeshttps://doi.org/10.1016/0166-5316(96)00025-9openalex-snapshot
Benefits of speedup knowledge in memory-constrained multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/0166-5316(96)00030-2openalex-snapshot
Using parallel program characteristics in dynamic processor allocation policies
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.005openalex-snapshot
Idle regulation in non-clairvoyant scheduling of parallel jobs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.09.007openalex-snapshot
Combining performance and priority for scheduling resizable parallel applications
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.tcs.2018.02.021openalex-snapshot
Energy efficient scheduling of parallelizable jobs
inferred← citeshttps://doi.org/10.1080/09544820410001697145openalex-snapshot
Engineering management: operational design coordination
inferred← citeshttps://doi.org/10.1109/4434.766964openalex-snapshot
Hector: an agent based architecture for dynamic resource management
inferred← citeshttps://doi.org/10.1109/71.735957openalex-snapshot
The Hector distributed run-time environment
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017131openalex-snapshot
A Malleable-Job System for Timeshared Parallel Machines
inferred← citeshttps://doi.org/10.1109/hpdc.1998.709962openalex-snapshot
Hectiling: an integration of fine and coarse-grained load-balancing strategies
inferred← citeshttps://doi.org/10.1109/icdcs.2006.14openalex-snapshot
An empirical evaluation of work stealing with parallelism feedback
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924928openalex-snapshot
A dynamic periodicity detector: application to speedup computation
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925021openalex-snapshot
Improving processor allocation through run-time measured efficiency
inferred← citeshttps://doi.org/10.1109/tpds.2005.85openalex-snapshot
Performance-driven processor allocation
inferred← citeshttps://doi.org/10.1137/s0097539797315598openalex-snapshot
Preemptive Scheduling of Parallel Jobs on Multiprocessors
inferred← citeshttps://doi.org/10.1145/1229428.1229448openalex-snapshot
Adaptive work stealing with parallelism feedback
inferred← citeshttps://doi.org/10.1145/1394441.1394443openalex-snapshot
Adaptive work-stealing with parallelism feedback
inferred← citeshttps://doi.org/10.1145/377792.377852openalex-snapshot
Improving Gang Scheduling through job performance analysis and malleability
inferred← citeshttps://doi.org/10.11606/t.55.2018.tde-05012018-103739openalex-snapshot
Uma abordagem para a avaliação do escalonamento de processos em sistemas distribuídos baseada em monitoração
inferred← citeshttps://doi.org/10.32657/10356/43571openalex-snapshot
Provably-efficient adaptive scheduling of multiprocessors for performance and energy
inferred← citeshttps://doi.org/10.5555/1251229.1251234openalex-snapshot
Performance-driven processor allocation
inferred← citeshttps://doi.org/10.5555/313852.313912openalex-snapshot
Preemptive scheduling of parallel jobs on multiprocessors
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.