On the public citation graph

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies

0 signed · 30 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11534273_16openalex-snapshot
Communication-Aware Processor Allocation for Supercomputers
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_3openalex-snapshot
Vision of Scheduling in Parallel Systems
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_5openalex-snapshot
Parallel Tasks
inferred← citeshttps://doi.org/10.1007/978-3-030-95388-1_9openalex-snapshot
The Case for Disjoint Job Mapping on High-Radix Networked Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-3-319-61756-5_13openalex-snapshot
Analyzing the Performance of Allocation Strategies Based on Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-77220-0_46openalex-snapshot
Routing-Contained Virtualization Based on Up*/Down* Forwarding
inferred← citeshttps://doi.org/10.1007/978-3-642-24449-0_9openalex-snapshot
Scalable Node Allocation for Improved Performance in Regular and Anisotropic 3D Torus Supercomputers
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_6openalex-snapshot
A Competitive Strategy for Distance-Aware Online Shape Allocation
inferred← citeshttps://doi.org/10.1007/978-94-007-4786-9_24openalex-snapshot
Distribution of the Distance Between Receptors of Ordered Micropatterned Substrates
inferred← citeshttps://doi.org/10.1007/s00453-007-9037-2openalex-snapshot
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance
inferred← citeshttps://doi.org/10.1007/s44265-023-00004-3openalex-snapshot
The effectiveness and externality of China’s outward foreign direct investment policy
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.004openalex-snapshot
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.09.002openalex-snapshot
Approximate covering detection among content-based subscriptions using space filling curves
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.05.016openalex-snapshot
Communication and cooling aware job allocation in data centers for communication-intensive workloads
inferred← citeshttps://doi.org/10.1016/j.jss.2007.05.012openalex-snapshot
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers
inferred← citeshttps://doi.org/10.1016/j.parco.2014.04.006openalex-snapshot
Application-aware metrics for partition selection in cube-shaped topologies
inferred← citeshttps://doi.org/10.1016/j.parco.2015.10.012openalex-snapshot
Local search to improve coordinate-based task mapping
inferred← citeshttps://doi.org/10.1109/clustr.2004.1392633openalex-snapshot
Computation-at-risk: employing the grid for computational risk management
inferred← citeshttps://doi.org/10.1109/icpads.2016.0040openalex-snapshot
Study of Intra- and Interjob Interference on Torus Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00121openalex-snapshot
Level-Spread: A New Job Allocation Policy for Dragonfly Networks
inferred← citeshttps://doi.org/10.1109/sc.2018.00010openalex-snapshot
GPU Age-Aware Scheduling to Improve the Reliability of Leadership Jobs on Titan
inferred← citeshttps://doi.org/10.1134/s1063779624030961openalex-snapshot
On Algorithms of Task Placement in Computing Clusters Taking into Account Task and System Topologies
inferred← citeshttps://doi.org/10.1145/2593069.2593214openalex-snapshot
SHiFA
inferred← citeshttps://doi.org/10.1145/2751205.2751225openalex-snapshot
PaCMap
inferred← citeshttps://doi.org/10.1145/2832087.2832094openalex-snapshot
Characterizing node orderings for improved performance
inferred← citeshttps://doi.org/10.2172/1093699openalex-snapshot
Task mapping for non-contiguous allocations.
inferred← citeshttps://doi.org/10.24355/dbbs.084-201003241003-0openalex-snapshot
Algorithms for Packing Problems
inferred← citeshttps://doi.org/10.4018/jitr.2015100104openalex-snapshot
A New Compacting Non-Contiguous Processor Allocation Algorithm for 2D Mesh Multicomputers
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5971openalex-snapshot
A Competitive Strategy for Distance-Aware Online Shape Allocation
inferred← citeshttps://doi.org/10.5555/2263019.2263044openalex-snapshot
Improvements to the structural simulation toolkit
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.