On the public citation graph
Performance limits for processor networks with divisible jobs
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.
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.1006/jpdc.1993.1039openalex-snapshot
Heuristic Methods for Dynamic Load Balancing in a Message-Passing Multicomputer
inferredcites →https://doi.org/10.1006/jpdc.1993.1086openalex-snapshot
A New Performance Measure for Scheduling Independent Real-Time Tasks
inferredcites →https://doi.org/10.1006/jpdc.1994.1030openalex-snapshot
Hierarchical Scheduling of Dynamic Parallel Computations on Hypercube Multicomputers
inferredcites →https://doi.org/10.1006/jpdc.1994.1141openalex-snapshot
Distributed Computation with Communication Delays: Asymptotic Performance Analysis
inferredcites →https://doi.org/10.1007/978-1-4613-2003-6openalex-snapshot
Assignment Problems in Parallel and Distributed Computing
inferredcites →https://doi.org/10.1016/0167-8191(95)00046-1openalex-snapshot
Scheduling divisible jobs on hypercubes†
inferredcites →https://doi.org/10.1016/0898-1221(95)00039-2openalex-snapshot
An efficient load distribution strategy for a distributed linear network of processors with communication delays
inferredcites →https://doi.org/10.1109/12.256461openalex-snapshot
Optimal task assignment in linear array networks
inferredcites →https://doi.org/10.1109/12.30865openalex-snapshot
GAMMON: a load balancing strategy for local computer systems with multiaccess networks
inferredcites →https://doi.org/10.1109/12.30866openalex-snapshot
Distributed scheduling of tasks with deadlines and resource requirements
inferredcites →https://doi.org/10.1109/12.30867openalex-snapshot
Load sharing in distributed real-time systems with state-change broadcasts
inferredcites →https://doi.org/10.1109/12.324544openalex-snapshot
Closed form solutions for bus and tree networks of processors load sharing a divisible job
inferredcites →https://doi.org/10.1109/12.42124openalex-snapshot
Analysis of the effects of delays on load sharing
inferredcites →https://doi.org/10.1109/12.8704openalex-snapshot
Heuristic algorithms for task assignment in distributed systems
inferredcites →https://doi.org/10.1109/21.120070openalex-snapshot
Bus-oriented load sharing for a network of sensor driven processors
inferredcites →https://doi.org/10.1109/31.14459openalex-snapshot
Infinite electrical networks: a reprise
inferredcites →https://doi.org/10.1109/7.106129openalex-snapshot
Distributed computation for a tree network with communication delays
inferredcites →https://doi.org/10.1109/7.18637openalex-snapshot
Distributed computation with communication delay (distributed intelligent sensor networks)
inferredcites →https://doi.org/10.1109/7.259524openalex-snapshot
Processor equivalence for daisy chain load sharing processors
inferredcites →https://doi.org/10.1109/7.272269openalex-snapshot
Distributed computation in linear networks: closed-form solutions
inferredcites →https://doi.org/10.1109/7.381944openalex-snapshot
Multi-installment load distribution in tree networks with delays
inferredcites →https://doi.org/10.1109/7.481247openalex-snapshot
Optimal divisible job load sharing for bus networks
inferredcites →https://doi.org/10.1109/7.489505openalex-snapshot
Optimal load distribution for tree network processors
inferredcites →https://doi.org/10.1109/71.308534openalex-snapshot
Optimal sequencing and arrangement in distributed single-level tree networks with communication delays
inferredcites →https://doi.org/10.1109/71.80146openalex-snapshot
Efficient scheduling algorithms for real-time multiprocessor systems
inferredcites →https://doi.org/10.1109/icpp.1993.54openalex-snapshot
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job
inferredcites →https://doi.org/10.1109/tc.1986.1676781openalex-snapshot
Scheduling Multiprocessor Tasks to Minimize Schedule Length
inferredcites →https://doi.org/10.1109/tc.1987.5009518openalex-snapshot
Preemptive Scheduling Under Time and Resource Constraints
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1109/tse.1985.232489openalex-snapshot
Optimal Load Balancing in a Multiple Processor System with Many Job Classes
inferredcites →https://doi.org/10.1137/0402042openalex-snapshot
Complexity of Scheduling Parallel Task Systems
inferredcites →https://doi.org/10.2307/2005538openalex-snapshot
Handbook of Mathematical Tables and Formulas
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-36704-6_5openalex-snapshot
Divisible Loads and Parallel Processing
inferred← citeshttps://doi.org/10.1016/j.camwa.2006.05.016openalex-snapshot
Divisible Load Scheduling and Markov Chain Models
inferred← citeshttps://doi.org/10.1016/j.mcm.2004.01.004openalex-snapshot
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
inferred← citeshttps://doi.org/10.1023/a:1020958815308openalex-snapshot
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems
inferred← citeshttps://doi.org/10.1093/ietcom/e91-b.7.2234openalex-snapshot
Analysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1093/ietcom/e91-b.8.2571openalex-snapshot
SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/71.674315openalex-snapshot
Optimizing computing costs using divisible load analysis
inferred← citeshttps://doi.org/10.1109/ipdps.2005.19openalex-snapshot
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536162openalex-snapshot
Divisible Load Scheduling with Result Collection on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/robot.1999.769968openalex-snapshot
A distributed control scheme for motor networks with communication-constrained channels
inferred← citeshttps://doi.org/10.1109/taes.2004.1310014openalex-snapshot
Equal allocation scheduling for data intensive applications
inferred← citeshttps://doi.org/10.1109/taes.2011.5751227openalex-snapshot
New Divisible Load Distribution Methods using Pipelined Communication Techniques on Tree and Pyramid Networks
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.