On the public citation graph

Overhead analysis of preemptive gang scheduling

https://doi.org/10.1007/bfb0053989
0 signed · 46 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-63574-2_19openalex-snapshot
PScheD Political scheduling on the CRAY T3E
inferredcites →https://doi.org/10.1007/3-540-63574-2_25openalex-snapshot
Global state detection using network preemption
inferredcites →https://doi.org/10.1007/bfb0020497openalex-snapshot
Time space sharing scheduling: A simulation analysis
inferredcites →https://doi.org/10.1007/bfb0022291openalex-snapshot
Implementation of gang-scheduling on workstation cluster
inferredcites →https://doi.org/10.1007/bfb0031642openalex-snapshot
PM: An operating system coordinated high performance communication library
inferredcites →https://doi.org/10.1016/0303-1268(80)90136-4openalex-snapshot
1979 International conference on parallel processing
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/40.342015openalex-snapshot
Myrinet: a gigabit-per-second local area network
inferredcites →https://doi.org/10.1109/40.653035openalex-snapshot
Virtual network transport protocols for Myrinet
inferredcites →https://doi.org/10.1109/fmpc.1996.558056openalex-snapshot
Gang scheduling for highly efficient, distributed multiprocessor systems
inferredcites →https://doi.org/10.1109/hicss.1995.375465openalex-snapshot
A scalable time-sharing scheduling for partitionable distributed memory parallel machines
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/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/223586.223618openalex-snapshot
The interaction of parallel and sequential workloads on a network of workstations
inferredcites →https://doi.org/10.1145/224056.224061openalex-snapshot
U-Net
inferredcites →https://doi.org/10.1145/224057.224061openalex-snapshot
U-Net
inferredcites →https://doi.org/10.1145/224170.224360openalex-snapshot
High performance messaging on workstations
inferredcites →https://doi.org/10.1145/358818.358823openalex-snapshot
Medusa
inferredcites →https://doi.org/10.1145/602770.602790openalex-snapshot
Efficient parallel global garbage collection on massively parallel computers
inferredcites →https://doi.org/10.1145/800221.806729openalex-snapshot
Detecting termination of distributed computations using markers
inferredcites →https://doi.org/10.1177/109434209100500306openalex-snapshot
The NAS Parallel Benchmarks
inferredcites →https://doi.org/10.5555/602770.602790openalex-snapshot
Efficient parallel global garbage collection on massively parallel computers

What points at this work

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

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-47954-6_5openalex-snapshot
The Effect of Correlating Quantum Allocation and Job Size for Gang Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-47954-6_6openalex-snapshot
Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_90openalex-snapshot
Designing Parallel Operating Systems via Parallel Programming
inferred← citeshttps://doi.org/10.1007/s11227-010-0481-4openalex-snapshot
Evaluation of gang scheduling performance and cost in a cloud computing system
inferred← citeshttps://doi.org/10.1093/comjnl/bxl020openalex-snapshot
An Abstract Interface for System Software on Large-Scale Clusters
inferred← citeshttps://doi.org/10.1109/grid.2004.39openalex-snapshot
Hybrid Preemptive Scheduling of MPI Applications on the Grids
inferred← citeshttps://doi.org/10.1109/hcw.1999.765113openalex-snapshot
Parallel C++ programming system on cluster of heterogeneous computers
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840933openalex-snapshot
Scheduling with global information in distributed systems
inferred← citeshttps://doi.org/10.1109/icpp.2004.1327962openalex-snapshot
Architectural support for system software on large-scale clusters
inferred← citeshttps://doi.org/10.1109/icpp.2004.21openalex-snapshot
Architectural support for system software on large-scale clusters
inferred← citeshttps://doi.org/10.1109/icppw.2001.951970openalex-snapshot
Gang scheduling with lightweight user-level communication
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925001openalex-snapshot
User-level communication in a system with gang scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470356openalex-snapshot
Dynamic fractional resource scheduling for HPC workloads
inferred← citeshttps://doi.org/10.1109/sc.1998.10007openalex-snapshot
Highly Efficient Gang Scheduling Implementation
inferred← citeshttps://doi.org/10.1109/simsym.2001.922110openalex-snapshot
Simulation-based average case analysis for parallel job scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2006.10openalex-snapshot
Effectively utilizing global cluster memory for large data-intensive parallel programs
inferred← citeshttps://doi.org/10.1109/tpds.2011.183openalex-snapshot
Dynamic Fractional Resource Scheduling versus Batch Scheduling
inferred← citeshttps://doi.org/10.1142/s0129054101000485openalex-snapshot
EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
inferred← citeshttps://doi.org/10.1177/1094342006062526openalex-snapshot
Hybrid Preemptive Scheduling of Message Passing Interface Applications on Grids
inferred← citeshttps://doi.org/10.5555/509058.509100openalex-snapshot
Highly Efficient Gang Scheduling Implementation
inferred← citeshttps://doi.org/10.9790/0661-0244952openalex-snapshot
Performance Optimization in Gang Scheduling In Cloud Computing
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.