On the public citation graph
Optimal load distribution for tree network processors
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.1109/21.120070openalex-snapshot
Bus-oriented load sharing for a network of sensor driven processors
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)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.21470openalex-snapshot
Simple linear flow decomposition algorithms on trees, circles, and augmented trees
inferred← citeshttps://doi.org/10.1002/net.21517openalex-snapshot
Fast algorithms for convex cost flow problems on circles, lines, and trees
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1494openalex-snapshot
Load Partitioning and Trade-Off Study for Large Matrix-Vector Computations in Multicast Bus Networks with Communication Delays
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1778openalex-snapshot
Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-36704-6_5openalex-snapshot
Divisible Loads and Parallel Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-53153-3_2openalex-snapshot
A Genetic Algorithm Based Efficient Static Load Distribution Strategy for Handling Large-Scale Workloads on Sustainable Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-03217-6_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
inferred← citeshttps://doi.org/10.1007/978-981-10-4154-9_9openalex-snapshot
Beyond Map-Reduce: LATNODE – A New Programming Paradigm for Big Data Systems
inferred← citeshttps://doi.org/10.1007/s11227-011-0677-2openalex-snapshot
Scheduling nonlinear divisible loads in a single level tree network
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00156-3openalex-snapshot
Scheduling divisible loads in bus networks with arbitrary processor release times
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.11.013openalex-snapshot
An equivalent network for divisible load scheduling in nonblocking mode of communication
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.10.215openalex-snapshot
Adaptive Real-Time Divisible Load Scheduling Algorithm for Unknown Network Parameters
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.1016/j.parco.2004.07.005openalex-snapshot
Load-balancing scatter operations for grid computing
inferred← citeshttps://doi.org/10.1016/s0895-7177(00)00179-5openalex-snapshot
Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90190-8openalex-snapshot
The effect of start-up delays in scheduling divisible loads on bus networks: An alternate approach
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90196-9openalex-snapshot
Divisible load scheduling in single-level tree networks: Optimal sequencing and arrangement in the nonblocking mode of communication
inferred← citeshttps://doi.org/10.1023/a:1020915000287openalex-snapshot
A Novel Optimal Load Distribution Algorithm for Divisible Loads
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.1023/a:1020971118034openalex-snapshot
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks
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/3468.661152openalex-snapshot
Distributed computation for a hypercube network of sensor-driven processors with communication delays including setup time
inferred← citeshttps://doi.org/10.1109/7.481247openalex-snapshot
Optimal divisible job load sharing for bus networks
inferred← citeshttps://doi.org/10.1109/7.625112openalex-snapshot
Performance limits for processor networks with divisible jobs
inferred← citeshttps://doi.org/10.1109/7.705897openalex-snapshot
Optimal time-varying load sharing for divisible loads
inferred← citeshttps://doi.org/10.1109/71.674315openalex-snapshot
Optimizing computing costs using divisible load analysis
inferred← citeshttps://doi.org/10.1109/71.895794openalex-snapshot
On the influence of start-up costs in scheduling divisible loads on bus networks
inferred← citeshttps://doi.org/10.1109/cis.2014.97openalex-snapshot
A New Genetic Algorithm for Release-Time Aware Divisible-Load Scheduling
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218544openalex-snapshot
Optimal communication structures for big data aggregation
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213207openalex-snapshot
Load-balancing scatter operations for Grid computing
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/scored.2002.1033158openalex-snapshot
Scheduling divisible loads in non-blocking mode of communication: optimal sequencing and arrangement in a single-level tree network
inferred← citeshttps://doi.org/10.1109/taes.2004.1310014openalex-snapshot
Equal allocation scheduling for data intensive applications
inferred← citeshttps://doi.org/10.1109/taes.2004.1337468openalex-snapshot
Divisible load cut through switching in sequential tree networks
inferred← citeshttps://doi.org/10.1109/taes.2008.4655372openalex-snapshot
Scheduling nonlinear computational loads
inferred← citeshttps://doi.org/10.1109/taes.2011.5751227openalex-snapshot
New Divisible Load Distribution Methods using Pipelined Communication Techniques on Tree and Pyramid Networks
inferred← citeshttps://doi.org/10.1109/taes.2012.6129670openalex-snapshot
Scheduling Second-Order Computational Load in Master-Slave Paradigm
inferred← citeshttps://doi.org/10.1109/taes.2012.6237592openalex-snapshot
Gateway Clustering Framework for the Integration of Heterogeneous Aviation Information Networks
inferred← citeshttps://doi.org/10.1109/tmc.2015.2480075openalex-snapshot
Distributed Workload Dissemination for Makespan Minimization in Disruption Tolerant Networks
inferred← citeshttps://doi.org/10.1109/tpds.2005.139openalex-snapshot
Multiround algorithms for scheduling divisible loads
inferred← citeshttps://doi.org/10.1142/s0218001413590052openalex-snapshot
NEW MODEL AND GENETIC ALGORITHM FOR DIVISIBLE LOAD SCHEDULING IN HETEROGENEOUS DISTRIBUTED SYSTEMS
inferred← citeshttps://doi.org/10.1145/3516430openalex-snapshot
ROME: All Overlays Lead to Aggregation, but Some Are Faster than Others
inferred← citeshttps://doi.org/10.4304/jsw.9.7.1757-1766openalex-snapshot
Optimization Algorithm for Divisible Load Scheduling on Heterogeneous Star Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01898openalex-snapshot
Optimal Divisible Load Scheduling for Resource-Sharing Network
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01994openalex-snapshot
Scheduling and Trade-off Analysis for Multi-Source Multi-Processor Systems with Divisible Loads
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.