On the public citation graph
Dynamic partitioning of multiprocessor systems
0 signed · 33 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.4330010104openalex-snapshot
Multiprogramming a distributed‐memory multiprocessor
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1109/12.21127openalex-snapshot
Speedup versus efficiency in parallel systems
inferredcites →https://doi.org/10.1109/12.2258openalex-snapshot
Dynamic remapping of parallel computations with varying resource demands
inferredcites →https://doi.org/10.1109/12.75137openalex-snapshot
Partitioning problems in parallel, pipeline, and distributed computing
inferredcites →https://doi.org/10.1109/32.21740openalex-snapshot
Optimal partitioning of random programs across two processors
inferredcites →https://doi.org/10.1109/tse.1982.235574openalex-snapshot
Load Balancing in Distributed Systems
inferredcites →https://doi.org/10.1145/1465482.1465560openalex-snapshot
Validity of the single processor approach to achieving large scale computing capabilities
inferredcites →https://doi.org/10.1145/3149.3156openalex-snapshot
Optimal static load balancing in distributed computer systems
inferredcites →https://doi.org/10.1145/98457.98759openalex-snapshot
Dynamic partitioning in a transputer environment
inferredcites →https://doi.org/10.1287/mnsc.13.3.210openalex-snapshot
Discrete Optimization Via Marginal Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1085openalex-snapshot
Static and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel Architectures
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1335openalex-snapshot
Parallel Application Scheduling on Networks of Workstations
inferred← citeshttps://doi.org/10.1007/3-540-55437-8_82openalex-snapshot
Processor scheduling in multiprocessor systems
inferred← citeshttps://doi.org/10.1007/3-540-60153-8_28openalex-snapshot
Analysis of non-work-conserving processor partitioning policies
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_16openalex-snapshot
A historical application profiler for use by parallel schedulers
inferred← citeshttps://doi.org/10.1007/978-3-642-76462-2_39openalex-snapshot
Die Verteilung paralleler Programme auf Transputer
inferred← citeshttps://doi.org/10.1007/bfb0022296openalex-snapshot
Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison
inferred← citeshttps://doi.org/10.1007/bfb0024757openalex-snapshot
Application-assisted dynamic scheduling on large-scale multi-computer systems
inferred← citeshttps://doi.org/10.1016/0166-5316(94)90036-1openalex-snapshot
Application scheduling and processor allocation in multiprogrammed parallel processing systems
inferred← citeshttps://doi.org/10.1016/0166-5316(94)90037-xopenalex-snapshot
Robust partitioning policies of multiprocessor systems
inferred← citeshttps://doi.org/10.1109/12.663764openalex-snapshot
Processor saving scheduling policies for multiprocessor systems
inferred← citeshttps://doi.org/10.1109/32.90447openalex-snapshot
The processor working set and its use in scheduling multiprocessor systems
inferred← citeshttps://doi.org/10.1109/clustr.2001.959985openalex-snapshot
Dynamic allocation of nodes on a large space-shared cluster
inferred← citeshttps://doi.org/10.1109/pnpm.1995.524317openalex-snapshot
Petri net model of a dynamically partitioned multiprocessor system
inferred← citeshttps://doi.org/10.1109/real.1997.641293openalex-snapshot
On adaptive resource allocation for complex real-time applications
inferred← citeshttps://doi.org/10.1109/superc.1992.236642openalex-snapshot
Scheduling a mixed interactive and batch workload on a parallel, shared memory supercomputer
inferred← citeshttps://doi.org/10.1142/9781860948923_0013openalex-snapshot
Stochastic Analysis of Resource Allocation in Parallel Processing Systems
inferred← citeshttps://doi.org/10.1145/98457.98759openalex-snapshot
Dynamic partitioning in a transputer environment
inferred← citeshttps://doi.org/10.1145/98460.98759openalex-snapshot
Dynamic partitioning in a transputer environment
inferred← citeshttps://doi.org/10.1147/rd.413.0303openalex-snapshot
Dynamic resource management on distributed systems using reconfigurable applications
inferred← citeshttps://doi.org/10.1177/109434209300700101openalex-snapshot
The Center for Computational Sciences At Oak Ridge National Laboratory
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.