On the public citation graph
Dynamic partitioning in different distributed-memory environments
0 signed · 50 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/asm.3150100403openalex-snapshot
Examples of fitting structured phase–type distributions
inferredcites →https://doi.org/10.1006/jpdc.1997.1377openalex-snapshot
Processor Allocation in Multiprogrammed Distributed-Memory Parallel Computer Systems
inferredcites →https://doi.org/10.1007/3-540-60153-8_31openalex-snapshot
On the benefits and limitations of dynamic partitioning in parallel computer systems
inferredcites →https://doi.org/10.1007/3-540-60153-8_38openalex-snapshot
Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860
inferredcites →https://doi.org/10.1007/bfb0022285openalex-snapshot
Workload evolution on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1007/bfb0022296openalex-snapshot
Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison
inferredcites →https://doi.org/10.1016/0166-5316(94)90036-1openalex-snapshot
Application scheduling and processor allocation in multiprogrammed parallel processing systems
inferredcites →https://doi.org/10.1016/0166-5316(94)90037-xopenalex-snapshot
Robust partitioning policies of multiprocessor systems
inferredcites →https://doi.org/10.1109/32.90447openalex-snapshot
The processor working set and its use in scheduling multiprocessor systems
inferredcites →https://doi.org/10.1109/icdcs.1997.603418openalex-snapshot
Extensible resource management for cluster computing
inferredcites →https://doi.org/10.1145/103162.103164openalex-snapshot
Paradigms for process interaction in distributed programs
inferredcites →https://doi.org/10.1145/107971.107985openalex-snapshot
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
inferredcites →https://doi.org/10.1145/1468075.1468078openalex-snapshot
Computer scheduling methods and their countermeasures
inferredcites →https://doi.org/10.1145/151244.151246openalex-snapshot
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/151250.151251openalex-snapshot
Chores: enhanced run-time support for shared-memory parallel computing
inferredcites →https://doi.org/10.1145/169627.169848openalex-snapshot
Performance analysis of job scheduling policies in parallel supercomputing environments
inferredcites →https://doi.org/10.1145/183018.183022openalex-snapshot
Processor allocation policies for message-passing parallel computers
inferredcites →https://doi.org/10.1145/183018.183023openalex-snapshot
Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies
inferredcites →https://doi.org/10.1145/233008.233060openalex-snapshot
Analysis of the early workload on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1145/233013.233060openalex-snapshot
Analysis of the early workload on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1145/74850.74866openalex-snapshot
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/74851.74866openalex-snapshot
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/75108.75391openalex-snapshot
Characterizations of parallelism in applications and their use in scheduling
inferredcites →https://doi.org/10.1145/800055.802019openalex-snapshot
Queue-based multi-processing LISP
inferredcites →https://doi.org/10.1145/98457.98759openalex-snapshot
Dynamic partitioning in a transputer environment
inferredcites →https://doi.org/10.1145/98457.98760openalex-snapshot
Processor scheduling in shared memory multiprocessors
inferredcites →https://doi.org/10.1145/98457.98761openalex-snapshot
The performance of multiprogrammed multiprocessor scheduling algorithms
inferredcites →https://doi.org/10.1287/opre.43.1.117openalex-snapshot
Smoothing Point Processes as a Means to Increase Throughput
inferredcites →https://doi.org/10.2307/2287748openalex-snapshot
Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach.
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.1997.1377openalex-snapshot
Processor Allocation in Multiprogrammed Distributed-Memory Parallel Computer Systems
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/bfb0022284openalex-snapshot
Toward convergence in job schedulers for parallel supercomputers
inferred← citeshttps://doi.org/10.1007/bfb0022295openalex-snapshot
Dynamic vs. static quantum-based parallel processor allocation
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/s10479-008-0312-7openalex-snapshot
Generalized parallel-server fork-join queues with dynamic task scheduling
inferred← citeshttps://doi.org/10.1016/0166-5316(96)00042-9openalex-snapshot
Stochastic analysis of gang scheduling in parallel and distributed systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017131openalex-snapshot
A Malleable-Job System for Timeshared Parallel Machines
inferred← citeshttps://doi.org/10.1109/cdc.1998.758539openalex-snapshot
Hybrid equipartitioning job scheduling policies for parallel computer 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/hpec.2019.8916495openalex-snapshot
Evaluation of the Imbalance Evolution in Parallel Reservoir Simulation
inferred← citeshttps://doi.org/10.1109/icdcs.1997.603418openalex-snapshot
Extensible resource management for cluster computing
inferred← citeshttps://doi.org/10.1142/9781860948923_0013openalex-snapshot
Stochastic Analysis of Resource Allocation in Parallel Processing Systems
inferred← citeshttps://doi.org/10.1145/236156.236172openalex-snapshot
An essential design pattern for fault-tolerant distributed state sharing
inferred← citeshttps://doi.org/10.1145/237502.237511openalex-snapshot
An analysis of gang scheduling for multiprogrammed parallel computing environments
inferred← citeshttps://doi.org/10.1145/511334.511341openalex-snapshot
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
inferred← citeshttps://doi.org/10.1145/511399.511341openalex-snapshot
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
inferred← citeshttps://doi.org/10.18535/ijecs/v6i11.22openalex-snapshot
Designing Ideal Task Partitioning Scheduling Model In Distributed Computing Scenario
inferred← citeshttps://doi.org/10.5121/csit.2012.2425openalex-snapshot
Dynamic Task Partitioning Model in Parallel Computing
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.