On the public citation graph

Communication patterns and allocation strategies

0 signed · 37 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/3-540-48518-x_15openalex-snapshot
A Self Organizing Bin Packing Heuristic
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/bf01199431openalex-snapshot
Ueber die stetige Abbildung einer Line auf ein Fl�chenst�ck
inferredcites →https://doi.org/10.1007/bfb0036198openalex-snapshot
Towards optimal locality in mesh-indexings
inferredcites →https://doi.org/10.1007/s002240010003openalex-snapshot
On Multidimensional Curves with Hilbert Property
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/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.1109/69.908985openalex-snapshot
Analysis of the clustering properties of the Hilbert space-filling curve
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/83.499920openalex-snapshot
On the metric properties of discrete space-filling curves
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/fmpc.1996.558107openalex-snapshot
A comparison of workload traces from two production parallel machines
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.1145/335305.335331openalex-snapshot
On the sum-of-squares algorithm for bin packing

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.3457openalex-snapshot
Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications
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-3-540-77220-0_46openalex-snapshot
Routing-Contained Virtualization Based on Up*/Down* Forwarding
inferred← citeshttps://doi.org/10.1007/s10951-015-0427-zopenalex-snapshot
On contiguous and non-contiguous parallel task scheduling
inferred← citeshttps://doi.org/10.1007/s11227-009-0333-2openalex-snapshot
An adaptive job scheduling scheme for mesh-connected multicomputers
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.jss.2011.06.003openalex-snapshot
Performance evaluation of noncontiguous allocation algorithms for 2D mesh interconnection networks
inferred← citeshttps://doi.org/10.1109/embeddedcom-scalcom.2009.121openalex-snapshot
A Comparative Study of Real Workload Traces and Synthetic Workload Models for Non-contiguous Allocation in 2D Meshes
inferred← citeshttps://doi.org/10.1109/hipc.2009.5433217openalex-snapshot
A framework for routing and resource allocation in network virtualization
inferred← citeshttps://doi.org/10.1109/iccsii.2012.6454398openalex-snapshot
Non-contiguous processor allocation in the mesh-connected multicomputers using compaction
inferred← citeshttps://doi.org/10.1109/icppw.2010.48openalex-snapshot
Parallel Job Scheduling Policies to Improve Fairness: A Case Study
inferred← citeshttps://doi.org/10.1109/icppw.2010.50openalex-snapshot
A Tie-Breaking Strategy for Processor Allocation in Meshes
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161182openalex-snapshot
The effect of heavy-tailed distribution on the performance of non-contiguous allocation strategies in 2D mesh connected multicomputers
inferred← citeshttps://doi.org/10.1109/ispan.2005.50openalex-snapshot
Fragmentation-Efficient Node Allocation Algorithm in 2D Mesh-Connected Systems
inferred← citeshttps://doi.org/10.1109/mc.2008.391openalex-snapshot
Interconnection Networks: Architectural Challenges for Utility Computing Data Centers
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.