On the public citation graph

Job scheduling scheme for pure space sharing among rigid jobs

https://doi.org/10.1007/bfb0053983
0 signed · 55 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.1002/scj.4690261403openalex-snapshot
Architecture of a parallel machine: Cenju‐3
inferredcites →https://doi.org/10.1007/3-540-60153-8_20openalex-snapshot
Parallel job scheduling: Issues and approaches
inferredcites →https://doi.org/10.1007/3-540-60153-8_35openalex-snapshot
The ANL/IBM SP scheduling system
inferredcites →https://doi.org/10.1007/3-540-63574-2_16openalex-snapshot
A historical application profiler for use by parallel schedulers
inferredcites →https://doi.org/10.1007/3-540-63574-2_21openalex-snapshot
Implementing multiprocessor scheduling disciplines
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.1007/bf02579171openalex-snapshot
The average-case analysis of some on-line algorithms for bin packing
inferredcites →https://doi.org/10.1007/bfb0022284openalex-snapshot
Toward convergence in job schedulers for parallel supercomputers
inferredcites →https://doi.org/10.1007/bfb0022285openalex-snapshot
Workload evolution on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1007/bfb0022286openalex-snapshot
The EASY — LoadLeveler API project
inferredcites →https://doi.org/10.1016/0743-7315(91)90032-5openalex-snapshot
A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system
inferredcites →https://doi.org/10.1016/0743-7315(92)90016-gopenalex-snapshot
Efficient processor allocation strategies for mesh-connected parallel computers
inferredcites →https://doi.org/10.1109/71.205653openalex-snapshot
On job scheduling on a hypercube
inferredcites →https://doi.org/10.1109/71.598346openalex-snapshot
Noncontiguous processor allocation algorithms for mesh-connected multicomputers
inferredcites →https://doi.org/10.1109/71.97898openalex-snapshot
Job scheduling in a partitionable mesh using a two-dimensional buddy system partitioning scheme
inferredcites →https://doi.org/10.1109/icdcs.1991.148674openalex-snapshot
An efficient submesh allocation strategy for mesh computer systems
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/151244.151246openalex-snapshot
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/174223.158909openalex-snapshot
High performance Fortran language specification
inferredcites →https://doi.org/10.1145/369028.369144openalex-snapshot
Impact of job mix on optimizations for space sharing schedulers
inferredcites →https://doi.org/10.1145/98457.98761openalex-snapshot
The performance of multiprogrammed multiprocessor scheduling algorithms
inferredcites →https://doi.org/10.1177/109434209100500306openalex-snapshot
The NAS Parallel Benchmarks

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.1384openalex-snapshot
A metric of fairness for parallel job schedulers
inferred← citeshttps://doi.org/10.1006/jpdc.2002.1869openalex-snapshot
Using Moldability to Improve the Performance of Supercomputer Jobs
inferred← citeshttps://doi.org/10.1007/11605300_13openalex-snapshot
Pitfalls in Parallel Job Scheduling Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-36180-4_10openalex-snapshot
Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems
inferred← citeshttps://doi.org/10.1007/3-540-36180-4_6openalex-snapshot
Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_1openalex-snapshot
Effect of Job Size Characteristics on Job Scheduling Performance
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_10openalex-snapshot
The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_12openalex-snapshot
Adaptive Selection of Partition Size for Supercomputer Requests
inferred← citeshttps://doi.org/10.1007/3-540-45540-x_5openalex-snapshot
The Influence of Communication on the Performance of Co-allocation
inferred← citeshttps://doi.org/10.1007/978-3-319-10353-2_19openalex-snapshot
Network Resource Control System for HPC Based on SDN
inferred← citeshttps://doi.org/10.1007/978-3-540-85451-7_27openalex-snapshot
Co-allocation with Communication Considerations in Multi-cluster Systems
inferred← citeshttps://doi.org/10.1007/s10586-025-05521-8openalex-snapshot
Machine learning approaches for optimizing high-performance computing scheduling: a comprehensive survey and analysis
inferred← citeshttps://doi.org/10.1016/j.cor.2012.08.002openalex-snapshot
Two-server parallel system with pure space sharing and Markovian arrivals
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.07.001openalex-snapshot
A two-class parallel system with general service times of the parallel class
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.06.007openalex-snapshot
An M/M/2 parallel system model with pure space sharing among rigid jobs
inferred← citeshttps://doi.org/10.1080/1206212x.2010.11441974openalex-snapshot
Characteristics of Fairness Metrics and their Effect on Perceived Scheduler Effectiveness
inferred← citeshttps://doi.org/10.1109/cahpc.2002.1180776openalex-snapshot
An evaluation of processor co-allocation for different system configurations and job structures
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017109openalex-snapshot
User-Centric Performance Analysis of Market-Based Cluster Batch Schedulers
inferred← citeshttps://doi.org/10.1109/ccgrid.2003.1199381openalex-snapshot
The performance of processor co-allocation in multicluster systems
inferred← citeshttps://doi.org/10.1109/eiconrus.2018.8316857openalex-snapshot
Approaches for adaptive optimization of routes in a distributed software-defined infrastructure of a virtual data center
inferred← citeshttps://doi.org/10.1109/hpdc.2002.1029944openalex-snapshot
The performance of processor co-allocation in multicluster systems
inferred← citeshttps://doi.org/10.1109/sbac-pad55451.2022.00035openalex-snapshot
Metrics for Packing Efficiency and Fairness of HPC Cluster Batch Job Scheduling
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/simsym.2003.1192794openalex-snapshot
Priorities among multiple queues for processor co-allocation in multicluster systems
inferred← citeshttps://doi.org/10.1109/tpds.2003.1178881openalex-snapshot
When the herd is smart: aggregate behavior in the selection of job request
inferred← citeshttps://doi.org/10.1145/1190095.1190097openalex-snapshot
A two-class parallel queue with pure space sharing among rigid jobs and general service times
inferred← citeshttps://doi.org/10.1145/2807591.2807660openalex-snapshot
An elegant sufficiency
inferred← citeshttps://doi.org/10.1145/3629104.3666038openalex-snapshot
Job Scheduling for HPC Clusters: Constraint Programming vs. Backfilling Approaches
inferred← citeshttps://doi.org/10.14529/cmse170206openalex-snapshot
Dynamic Routing Algorithms and Methods for Controlling Traffic Flows of Cloud Applications and Services
inferred← citeshttps://doi.org/10.2316/journal.202.2010.2.202-2655openalex-snapshot
CHARACTERISTICS OF FAIRNESS METRICS AND THEIR EFFECT ON PERCEIVED SCHEDULER EFFECTIVENESS
inferred← citeshttps://doi.org/10.5120/3158-4370openalex-snapshot
Statistical Modeling and Evaluation of Parallel Spacesharing Job Scheduling Algorithms for PCcluster using Design of Experiments 'DOE'
inferred← citeshttps://doi.org/10.5555/370049.370063openalex-snapshot
Randomization, Speculation, and Adaptation in Batch Schedulers
inferred← citeshttps://doi.org/10.5555/786111.786239openalex-snapshot
Priorities among multiple queues for processor co-allocation in multicluster systems
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.