On the public citation graph

Communication-Aware Processor Allocation for Supercomputers

0 signed · 45 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.1006/jpdc.1998.1459openalex-snapshot
Performance Improvement of Allocation Schemes for Mesh-Connected Computers
inferredcites →https://doi.org/10.1007/978-1-4613-1401-1_13openalex-snapshot
Performance Evaluation of a Massively Parallel I/O Subsystem
inferredcites →https://doi.org/10.1007/978-3-540-30117-2_87openalex-snapshot
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices
inferredcites →https://doi.org/10.1007/s00453-003-1074-xopenalex-snapshot
Maximum Dispersion and Geometric Maximum Weight Cliques
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.1016/s0166-218x(98)00100-0openalex-snapshot
Approximation algorithms for min-sum p-clustering
inferredcites →https://doi.org/10.1016/s0167-8191(99)00104-0openalex-snapshot
Massively parallel computing using commodity components
inferredcites →https://doi.org/10.1016/s0304-3975(96)00304-0openalex-snapshot
Compact location problems
inferredcites →https://doi.org/10.1088/0305-4470/37/1/010openalex-snapshot
What is the optimal shape of a city?
inferredcites →https://doi.org/10.1109/71.282559openalex-snapshot
Job scheduling is more important than processor allocation for hypercube computers
inferredcites →https://doi.org/10.1109/71.598346openalex-snapshot
Noncontiguous processor allocation algorithms for mesh-connected multicomputers
inferredcites →https://doi.org/10.1109/clustr.2002.1137735openalex-snapshot
Selective buddy allocation for scheduling parallel jobs on clusters
inferredcites →https://doi.org/10.1109/clustr.2002.1137758openalex-snapshot
Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies
inferredcites →https://doi.org/10.1109/fmpc.1995.380484openalex-snapshot
ProcSimity: an experimental tool for processor allocation and scheduling in highly parallel systems
inferredcites →https://doi.org/10.1109/icdcs.1991.148674openalex-snapshot
An efficient submesh allocation strategy for mesh computer systems
inferredcites →https://doi.org/10.1109/ipps.1994.288204openalex-snapshot
Lookahead processor allocation in mesh-connected massively parallel multicomputer
inferredcites →https://doi.org/10.1109/ipps.1996.508068openalex-snapshot
The effects of network contention on processor allocation strategies
inferredcites →https://doi.org/10.1109/sffcs.1999.814587openalex-snapshot
A sublinear time approximation scheme for clustering in metric spaces
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0204023openalex-snapshot
Near-Optimal Solutions to a 2-Dimensional Placement Problem
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/380752.380754openalex-snapshot
Approximating min-sum k -clustering in metric spaces
inferredcites →https://doi.org/10.2172/800975openalex-snapshot
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies
inferredcites →https://doi.org/10.2172/918398openalex-snapshot
Communication patterns and allocation strategies.

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.1526openalex-snapshot
Performance evaluation of the Red Storm dual‐core upgrade
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-642-21153-9_15openalex-snapshot
Dynamic Task Allocation in Networks-on-Chip
inferred← citeshttps://doi.org/10.1016/bs.adcom.2018.04.001openalex-snapshot
Revisiting Processor Allocation and Application Mapping in Future CMPs in Dark Silicon Era
inferred← citeshttps://doi.org/10.1088/0305-4470/37/1/010openalex-snapshot
What is the optimal shape of a city?
inferred← citeshttps://doi.org/10.1109/cluster.2014.6968670openalex-snapshot
Demonstrating improved application performance using dynamic monitoring and task mapping
inferred← citeshttps://doi.org/10.1109/date.2008.4484847openalex-snapshot
User-Aware Dynamic Task Allocation in Networks-on-Chip
inferred← citeshttps://doi.org/10.1109/fareastcon50210.2020.9271482openalex-snapshot
Analysis of All-to-all Collective Operations on Hierarchical Computer Clusters
inferred← citeshttps://doi.org/10.1109/icasid.2012.6325315openalex-snapshot
On-line real-time task management for three-dimensional network on chips
inferred← citeshttps://doi.org/10.1109/rsp.2009.23openalex-snapshot
Communication-Aware Hierarchical Online-Placement in Heterogeneous Reconfigurable Systems
inferred← citeshttps://doi.org/10.1109/tc.2007.1028openalex-snapshot
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
inferred← citeshttps://doi.org/10.1109/tcad.2008.2003301openalex-snapshot
Energy- and Performance-Aware Incremental Mapping for Networks on Chip With Multiple Voltage Levels
inferred← citeshttps://doi.org/10.1109/tcad.2009.2034348openalex-snapshot
Run-Time Task Allocation Considering User Behavior in Embedded Multiprocessor Networks-on-Chip
inferred← citeshttps://doi.org/10.1145/1289816.1289857openalex-snapshot
Incremental run-time application mapping for homogeneous NoCs with multiple voltage levels
inferred← citeshttps://doi.org/10.1145/1403375.1403675openalex-snapshot
User-aware dynamic task allocation in networks-on-chip
inferred← citeshttps://doi.org/10.1145/3055202openalex-snapshot
Efficient Mapping of Applications for Future Chip-Multiprocessors in Dark Silicon Era
inferred← citeshttps://doi.org/10.15587/2313-8416.2015.46987openalex-snapshot
Intensification of heat-mass exchange processes in the immersed burning apparatus by contacting phases oscillation
inferred← citeshttps://doi.org/10.2172/918344openalex-snapshot
Algorithmic support for commodity-based parallel computing systems.
inferred← citeshttps://doi.org/10.3390/a18070385openalex-snapshot
Algorithmic Techniques for GPU Scheduling: A Comprehensive Survey
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.