On the public citation graph

Coscheduling based on runtime identification of activity working sets

0 signed · 65 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.1996.0033openalex-snapshot
The Network Architecture of the Connection Machine CM-5
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_7openalex-snapshot
Script: A Communication Abstraction Mechanism and its Verification
inferredcites →https://doi.org/10.1007/978-3-7091-4338-4_3openalex-snapshot
Approximation Algorithms for Bin-Packing — An Updated Survey
inferredcites →https://doi.org/10.1016/0167-6423(86)90018-3openalex-snapshot
Script: A communication abstraction mechanism and its verification
inferredcites →https://doi.org/10.1016/0167-739x(92)90032-7openalex-snapshot
Extending multiprogramming to a DMPP
inferredcites →https://doi.org/10.1016/0743-7315(92)90014-eopenalex-snapshot
Gang scheduling performance benefits for fine-grain synchronization
inferredcites →https://doi.org/10.1109/2.53353openalex-snapshot
Scheduling support for concurrency and parallelism in the Mach operating system
inferredcites →https://doi.org/10.1109/2.53356openalex-snapshot
Distributed hierarchical control for parallel processing
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.89064openalex-snapshot
The effect of scheduling discipline on spin overhead in shared memory parallel systems
inferredcites →https://doi.org/10.1109/jcit.1990.128278openalex-snapshot
Wasted resources in gang scheduling
inferredcites →https://doi.org/10.1109/spdp.1992.242724openalex-snapshot
Time sharing in hypercube multiprocessors
inferredcites →https://doi.org/10.1109/tc.1984.1676500openalex-snapshot
Wave Scheduling—Decentralized Scheduling of Task Forces in Multicomputers
inferredcites →https://doi.org/10.1109/tc.1986.1676781openalex-snapshot
Scheduling Multiprocessor Tasks to Minimize Schedule Length
inferredcites →https://doi.org/10.1109/tse.1985.232189openalex-snapshot
Task Scheduling on the PASM Parallel Processing System
inferredcites →https://doi.org/10.1145/107971.107985openalex-snapshot
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
inferredcites →https://doi.org/10.1145/107972.107985openalex-snapshot
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
inferredcites →https://doi.org/10.1145/121132.286599openalex-snapshot
Empirical studies of competitve spinning for a shared-memory multiprocessor
inferredcites →https://doi.org/10.1145/121133.286599openalex-snapshot
Empirical studies of competitve spinning for a shared-memory multiprocessor
inferredcites →https://doi.org/10.1145/140901.141883openalex-snapshot
The network architecture of the Connection Machine CM-5 (extended abstract)
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/183018.183022openalex-snapshot
Processor allocation policies for message-passing parallel computers
inferredcites →https://doi.org/10.1145/183019.183022openalex-snapshot
Processor allocation policies for message-passing parallel computers
inferredcites →https://doi.org/10.1145/327070.327143openalex-snapshot
Issues related to MIMD shared-memory computers
inferredcites →https://doi.org/10.1145/633615.810660openalex-snapshot
A Large Scale, Homogenous, Fully Distributed Parallel Machine, II
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/800221.806723openalex-snapshot
Script
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.1147/rd.355.0743openalex-snapshot
Low-overhead scheduling of nested parallelism

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.887openalex-snapshot
Loosely coordinated coscheduling in the context of other approaches for dynamic job scheduling: a survey
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1513openalex-snapshot
Modeling Communication Locality in Multiprocessors
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1576openalex-snapshot
Alternatives to Coscheduling a Network of Workstations
inferred← citeshttps://doi.org/10.1007/11605300_13openalex-snapshot
Pitfalls in Parallel Job Scheduling Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_2openalex-snapshot
Improving Parallel Job Scheduling Using Runtime Measurements
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_105openalex-snapshot
Predictive Coscheduling Implementation in a Non-dedicated Linux Cluster
inferred← citeshttps://doi.org/10.1007/3-540-45417-9_19openalex-snapshot
Adding Dynamic Coscheduling Support to PVM
inferred← citeshttps://doi.org/10.1007/3-540-60153-8_20openalex-snapshot
Parallel job scheduling: Issues and approaches
inferred← citeshttps://doi.org/10.1007/3-540-60153-8_25openalex-snapshot
Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors
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_23openalex-snapshot
Implications of I/O for gang scheduled workloads
inferred← citeshttps://doi.org/10.1007/bfb0022293openalex-snapshot
Using runtime measured workload characteristics in parallel processor scheduling
inferred← citeshttps://doi.org/10.1007/bfb0053990openalex-snapshot
Dynamic coscheduling on workstation clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.02.009openalex-snapshot
Coscheduled distributed-Web servers on system area network
inferred← citeshttps://doi.org/10.1109/71.888636openalex-snapshot
Dynamic task scheduling using online optimization
inferred← citeshttps://doi.org/10.1109/71.954632openalex-snapshot
Impact of workload and system parameters on next generation cluster scheduling mechanisms
inferred← citeshttps://doi.org/10.1109/clustr.2003.1253303openalex-snapshot
Co-ordinated coscheduling in time-sharing clusters through a generic framework
inferred← citeshttps://doi.org/10.1109/iciccs53718.2022.9788282openalex-snapshot
Improving task scheduling in microservice environments by considering intra-job dependencies
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924988openalex-snapshot
CMC: a coscheduling model for non-dedicated cluster computing
inferred← citeshttps://doi.org/10.1109/pcee.2000.873613openalex-snapshot
Time/space sharing distributed job scheduling policy in a workstation cluster environment
inferred← citeshttps://doi.org/10.1109/simsym.2002.1000136openalex-snapshot
Scheduling a job mix in a partitionable parallel system
inferred← citeshttps://doi.org/10.1109/wsc.2000.899757openalex-snapshot
A simulation model of backfilling and I/O scheduling in a partitionable parallel system
inferred← citeshttps://doi.org/10.1145/233008.233020openalex-snapshot
Effective distributed scheduling of parallel workloads
inferred← citeshttps://doi.org/10.1145/2462902.2462911openalex-snapshot
A preemption-based runtime to efficiently schedule multi-process applications on heterogeneous clusters with GPUs
inferred← citeshttps://doi.org/10.1145/2556863.2556866openalex-snapshot
Exploiting Performance Counters for Energy Efficient Co-Scheduling of Mixed Workloads on Multi-Core Platforms
inferred← citeshttps://doi.org/10.1145/277651.277678openalex-snapshot
Thread scheduling for multiprogrammed multiprocessors
inferred← citeshttps://doi.org/10.1145/277851.277927openalex-snapshot
Scheduling with implicit information in distributed systems
inferred← citeshttps://doi.org/10.1145/277858.277927openalex-snapshot
Scheduling with implicit information in distributed systems
inferred← citeshttps://doi.org/10.1145/305619.305630openalex-snapshot
A closer look at coscheduling approaches for a network of workstations
inferred← citeshttps://doi.org/10.1145/380749.380764openalex-snapshot
Implicit coscheduling
inferred← citeshttps://doi.org/10.11606/t.55.2005.tde-10012018-103454openalex-snapshot
Escalonamento de processos: uma abordagem dinâmica e incremental para a exploração de características de aplicações paralelas
inferred← citeshttps://doi.org/10.1177/0037549704044080openalex-snapshot
ClusterSchedSim: A Unifying Simulation Framework for Cluster Scheduling Strategies
inferred← citeshttps://doi.org/10.1177/1094342006074868openalex-snapshot
Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic Framework
inferred← citeshttps://doi.org/10.5555/510378.510454openalex-snapshot
A simulation model of backfilling and I/O scheduling in a partitionable parallel system
inferred← citeshttps://doi.org/10.7916/d8n58v8mopenalex-snapshot
SWAP: A Scheduler With Automatic Process Dependency Detection
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.