On the public citation graph

A gang scheduling design for multiprogrammed parallel computing environments

https://doi.org/10.1007/bfb0022290
0 signed · 52 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.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.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/0743-7315(92)90014-eopenalex-snapshot
Gang scheduling performance benefits for fine-grain synchronization
inferredcites →https://doi.org/10.1090/dimacs/030/01openalex-snapshot
Connected components on distributed memory machines
inferredcites →https://doi.org/10.1090/dimacs/030/09openalex-snapshot
Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms
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/icpp.1999openalex-snapshot
Proceedings of the 1999 International Conference on Parallel Processing
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/169627.169848openalex-snapshot
Performance analysis of job scheduling policies in parallel supercomputing environments
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/233008.233060openalex-snapshot
Analysis of the early workload on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1145/233013.233060openalex-snapshot
Analysis of the early workload on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1145/237502.237511openalex-snapshot
An analysis of gang scheduling for multiprogrammed parallel computing environments
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.98759openalex-snapshot
Dynamic partitioning in a transputer environment
inferredcites →https://doi.org/10.1145/98457.98760openalex-snapshot
Processor scheduling in shared memory multiprocessors
inferredcites →https://doi.org/10.1145/98457.98761openalex-snapshot
The performance of multiprogrammed multiprocessor scheduling algorithms
inferredcites →https://doi.org/10.1287/opre.9.3.383openalex-snapshot
A Proof for the Queuing Formula: L = λ W
inferredcites →https://doi.org/10.2307/2287748openalex-snapshot
Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1099-1425(200009/10)3:5<297::aid-jos50>3.0.co;2-dopenalex-snapshot
Fairness in parallel job scheduling
inferred← citeshttps://doi.org/10.1007/3-540-47954-6_5openalex-snapshot
The Effect of Correlating Quantum Allocation and Job Size for Gang 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_18openalex-snapshot
Modeling of workload in MPPs
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/3-540-63574-2_26openalex-snapshot
Performance evaluation of gang scheduling for parallel and distributed multiprogramming
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_118openalex-snapshot
A Job Scheduling Strategy for Heterogeneous Multiprogrammed Systems
inferred← citeshttps://doi.org/10.1007/bfb0022284openalex-snapshot
Toward convergence in job schedulers for parallel supercomputers
inferred← citeshttps://doi.org/10.1007/bfb0053987openalex-snapshot
Improving first-come-first-serve job scheduling by gang scheduling
inferred← citeshttps://doi.org/10.1016/0166-5316(96)00042-9openalex-snapshot
Stochastic analysis of gang scheduling in parallel and distributed systems
inferred← citeshttps://doi.org/10.1080/17445760.2012.656309openalex-snapshot
Optimisation schemes to improve hybrid co-scheduling for concurrent virtual machines
inferred← citeshttps://doi.org/10.1109/ccgrid.2005.1558664openalex-snapshot
User group-based workload analysis and modelling
inferred← citeshttps://doi.org/10.1109/empdp.1998.647176openalex-snapshot
Effective scheduling in a mixed parallel and sequential computing environment
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302941openalex-snapshot
Adaptive memory paging for efficient gang scheduling of parallel applications
inferred← citeshttps://doi.org/10.1109/ipdps.2013.59openalex-snapshot
Disk-Cache and Parallelism Aware I/O Scheduling to Improve Storage System Performance
inferred← citeshttps://doi.org/10.1109/nas.2011.30openalex-snapshot
Hybrid Co-scheduling Optimizations for Concurrent Applications in Virtualized Environments
inferred← citeshttps://doi.org/10.1109/sc.1998.10026openalex-snapshot
An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments
inferred← citeshttps://doi.org/10.1109/sc.1998.10028openalex-snapshot
Optimizing Software Cache-coherent Cluster Architectures
inferred← citeshttps://doi.org/10.1109/simsym.2001.922110openalex-snapshot
Simulation-based average case analysis for parallel job scheduling
inferred← citeshttps://doi.org/10.1142/s0129054101000485openalex-snapshot
EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
inferred← citeshttps://doi.org/10.1145/2063384.2063407openalex-snapshot
Server-side I/O coordination for parallel file systems
inferred← citeshttps://doi.org/10.1145/237502.237511openalex-snapshot
An analysis of gang scheduling for multiprogrammed parallel computing environments
inferred← citeshttps://doi.org/10.17877/de290r-5213openalex-snapshot
Design and evaluation of job scheduling strategies for grid computing
inferred← citeshttps://doi.org/10.17877/de290r-60openalex-snapshot
Workload modeling for parallel computers
inferred← citeshttps://doi.org/10.5555/314613.315031openalex-snapshot
Analysis of first-come-first-serve parallel job scheduling
inferred← citeshttps://doi.org/10.5555/509058.509083openalex-snapshot
Optimizing Software Cache-coherent Cluster Architectures
inferred← citeshttps://doi.org/10.5555/509058.509107openalex-snapshot
An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments
inferred← citeshttps://doi.org/10.5555/509058.509123openalex-snapshot
Internet based audiovisual communication tools used in a joint engineering design class at the University of Alabama in Huntsville and the Ecole Superieure et de Construction Automobile (ESTACA) in Paris, France
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.