On the public citation graph

A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm

https://doi.org/10.1007/bfb0022287
0 signed · 25 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.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.1109/2.191995openalex-snapshot
A survey of wormhole routing techniques in direct networks
inferredcites →https://doi.org/10.1109/71.598346openalex-snapshot
Noncontiguous processor allocation algorithms for mesh-connected multicomputers

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-45540-x_10openalex-snapshot
Characteristics of a Large Shared Memory Production Workload
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_21openalex-snapshot
Implementing multiprocessor scheduling disciplines
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_24openalex-snapshot
Improved utilization and responsiveness with gang scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-04633-9_6openalex-snapshot
Modeling Parallel System Workloads with Temporal Locality
inferred← citeshttps://doi.org/10.1007/978-3-642-35867-8_4openalex-snapshot
Multi-objective Processor-Set Selection for Computational Cluster-Systems
inferred← citeshttps://doi.org/10.1007/bfb0022284openalex-snapshot
Toward convergence in job schedulers for parallel supercomputers
inferred← citeshttps://doi.org/10.1007/bfb0022288openalex-snapshot
Architecture-independent request-scheduling with tight waiting-time estimations
inferred← citeshttps://doi.org/10.1007/bfb0022289openalex-snapshot
Packing schemes for gang scheduling
inferred← citeshttps://doi.org/10.1007/bfb0053979openalex-snapshot
A comparative study of real workload traces and synthetic workload models for parallel job scheduling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.04.020openalex-snapshot
The impact of spatial layout of jobs on I/O hotspots in mesh networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.06.013openalex-snapshot
Experience with using the Parallel Workloads Archive
inferred← citeshttps://doi.org/10.1016/j.parco.2008.03.009openalex-snapshot
Design and performance evaluation of combined first-fit task allocation and migration strategies in mesh multiprocessor systems
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00108-4openalex-snapshot
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
inferred← citeshttps://doi.org/10.1109/71.598346openalex-snapshot
Noncontiguous processor allocation algorithms for mesh-connected multicomputers
inferred← citeshttps://doi.org/10.1109/fmpc.1996.558107openalex-snapshot
A comparison of workload traces from two production parallel machines
inferred← citeshttps://doi.org/10.1109/hpdc.1996.546210openalex-snapshot
Modeling the effects of contention on the performance of heterogeneous applications
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846022openalex-snapshot
Job scheduling that minimizes network contention due to both communication and I/O
inferred← citeshttps://doi.org/10.1109/ipps.1997.580894openalex-snapshot
Predicting queue times on space-sharing parallel computers
inferred← citeshttps://doi.org/10.1109/pdp.2006.13openalex-snapshot
A new processor allocation strategy using ESS (expanding square strategy)
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
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.