On the public citation graph

Distributed computation for a tree network with communication delays

0 signed · 119 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.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.1994.1141openalex-snapshot
Distributed Computation with Communication Delays: Asymptotic Performance Analysis
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.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_14openalex-snapshot
Processing Time and Memory Requirements for Multi-instalment Divisible Job Processing
inferred← citeshttps://doi.org/10.1007/978-0-387-68235-8_2openalex-snapshot
Fundamental Stochastic Models
inferred← citeshttps://doi.org/10.1007/978-1-4615-5611-4_20openalex-snapshot
Managing Divisible Load on Partitionable Networks
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_7openalex-snapshot
Divisible Loads
inferred← citeshttps://doi.org/10.1007/978-3-030-36704-6_2openalex-snapshot
Fundamental Stochastic Models
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-540-32220-7_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
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-3-662-04363-9_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/bf02960769openalex-snapshot
Distributing and scheduling divisible task on parallel communicating processors
inferred← citeshttps://doi.org/10.1007/s00224-007-9001-1openalex-snapshot
On “Exploiting” Node-Heterogeneous Clusters Optimally
inferred← citeshttps://doi.org/10.1007/s10723-009-9129-0openalex-snapshot
Algorithms for Divisible Load Scheduling of Data-intensive Applications
inferred← citeshttps://doi.org/10.1007/s11241-011-9145-6openalex-snapshot
Scheduling real-time divisible loads with advance reservations
inferred← citeshttps://doi.org/10.1016/0140-3664(94)90027-2openalex-snapshot
Effect of fault tolerance and communication delay on response time in a multiprocessor system with a bus topology
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00046-1openalex-snapshot
Scheduling divisible jobs on hypercubes†
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.amc.2014.03.024openalex-snapshot
Communication scheduling in data gathering networks with limited memory
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.07.021openalex-snapshot
Hybrid real-coded genetic algorithm for data partitioning in multi-round load distribution and scheduling in heterogeneous systems
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.camwa.2006.05.016openalex-snapshot
Divisible Load Scheduling and Markov Chain Models
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.046openalex-snapshot
Grid scheduling divisible loads from two sources
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.10.051openalex-snapshot
Complexity of master–slave tasking on heterogeneous trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.12.004openalex-snapshot
Scheduling divisible MapReduce computations
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.01.002openalex-snapshot
Scalability limits of Bag-of-Tasks applications running on hierarchical platforms
inferred← citeshttps://doi.org/10.1016/j.matcom.2008.06.003openalex-snapshot
A new load distribution strategy for linear network with communication delays
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.06.002openalex-snapshot
Quantized load distribution for tree and bus-connected processors
inferred← citeshttps://doi.org/10.1016/j.procs.2017.12.119openalex-snapshot
Time Cheating in Divisible Load Scheduling: Sensitivity Analysis, Results and Open Problems
inferred← citeshttps://doi.org/10.1016/j.vehcom.2022.100529openalex-snapshot
Data Partitioning and Scheduling Schemes for Federated Platoon-Based Vehicular Cloud
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00115-1openalex-snapshot
Distributed processing of divisible jobs with communication startup costs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00014-1openalex-snapshot
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00104-5openalex-snapshot
Divisible task scheduling – Concept and verification
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00004-6openalex-snapshot
Scheduling divisible loads in a three-dimensional mesh of processors
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:1008283014820openalex-snapshot
Load Management in Loosely Coupled Multiprocessor Systems
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:1020919101196openalex-snapshot
An Equivalent Tree Network Methodology for Efficient Utilization of Front-Ends in Linear Network
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:1020962916217openalex-snapshot
A Multistage Load Distribution Strategy for Three-Dimensional Meshes
inferred← citeshttps://doi.org/10.1023/a:1020967017125openalex-snapshot
Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks
inferred← citeshttps://doi.org/10.1023/b:clus.0000018567.06753.deopenalex-snapshot
Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs
inferred← citeshttps://doi.org/10.1051/ro/2014050openalex-snapshot
Scheduling Multilayer Divisible Computations
inferred← citeshttps://doi.org/10.1080/17445760600567842openalex-snapshot
Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
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/12.324544openalex-snapshot
Closed form solutions for bus and tree networks of processors load sharing a divisible job
inferred← citeshttps://doi.org/10.1109/21.120070openalex-snapshot
Bus-oriented load sharing for a network of sensor driven processors
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.259524openalex-snapshot
Processor equivalence for daisy chain load sharing processors
inferred← citeshttps://doi.org/10.1109/7.272269openalex-snapshot
Distributed computation in linear networks: closed-form solutions
inferred← citeshttps://doi.org/10.1109/7.381944openalex-snapshot
Multi-installment load distribution in tree networks with delays
inferred← citeshttps://doi.org/10.1109/7.481247openalex-snapshot
Optimal divisible job load sharing for bus networks
inferred← citeshttps://doi.org/10.1109/7.489505openalex-snapshot
Optimal load distribution for tree network processors
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.308534openalex-snapshot
Optimal sequencing and arrangement in distributed single-level tree networks with communication delays
inferred← citeshttps://doi.org/10.1109/71.674315openalex-snapshot
Optimizing computing costs using divisible load analysis
inferred← citeshttps://doi.org/10.1109/71.679214openalex-snapshot
Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees
inferred← citeshttps://doi.org/10.1109/access.2021.3127521openalex-snapshot
UniDRM: Unified Data and Resource Management for Federated Vehicular Cloud Computing
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617312openalex-snapshot
Optimal data allocation for processor-tree architectures
inferred← citeshttps://doi.org/10.1109/iccn.2015.28openalex-snapshot
Effective selection of node for cloud environment using makespan
inferred← citeshttps://doi.org/10.1109/icpp.1993.54openalex-snapshot
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job
inferred← citeshttps://doi.org/10.1109/iembs.2006.260586openalex-snapshot
Integrated Scheduling Algorithm for Personalized Disease Management Applications
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218544openalex-snapshot
Optimal communication structures for big data aggregation
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155272openalex-snapshot
Delay-Optimal Distributed Edge Computing in Wireless Edge Networks
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228964openalex-snapshot
Latency-Optimal Pyramid-based Joint Communication and Computation Scheduling for Distributed Edge Computing
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016659openalex-snapshot
Scheduling divisible tasks on heterogeneous linear arrays with applications to layered networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213103openalex-snapshot
Master-slave tasking on heterogeneous processors
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213185openalex-snapshot
Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213308openalex-snapshot
To BSP or not to BSP in heterogeneous NOWs
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303169openalex-snapshot
Modeling large-scale platforms for the analysis and the simulation of scheduling strategies
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303173openalex-snapshot
Models for scheduling on large scale platforms: which policy for which application?
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303270openalex-snapshot
Accelerating divisible load distribution on tree and pyramid networks using pipelined communications
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/ipdps.2009.5161044openalex-snapshot
Static strategies forworksharing with unrecoverable interruptions
inferred← citeshttps://doi.org/10.1109/rta.1994.316135openalex-snapshot
Optimal dynamic redistribution of divisible load in distributed real-time 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/simsym.2003.1192796openalex-snapshot
Asymptotically optimal worksharing in HNOWs: how long is "sufficiently long?"
inferred← citeshttps://doi.org/10.1109/spdp.1995.530704openalex-snapshot
Optimal load sharing in dynamically heterogeneous systems
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.2006.1603426openalex-snapshot
Wireless sensor networks: scheduling for measurement and data reporting
inferred← citeshttps://doi.org/10.1109/taes.2008.4560202openalex-snapshot
Signature search time evaluation in flat file databases
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.6324675openalex-snapshot
Greedy Signature Processing with Arbitrary Location Distributions: A Divisible Load Framework
inferred← citeshttps://doi.org/10.1109/taes.2014.130201openalex-snapshot
Scheduling in compute cloud with multiple data banks using divisible load paradigm
inferred← citeshttps://doi.org/10.1109/taes.2019.2940341openalex-snapshot
Effects of Saturation for High-Throughput Satellite Buses
inferred← citeshttps://doi.org/10.1109/tmc.2023.3335051openalex-snapshot
Towards Real-Time Inference Offloading With Distributed Edge Computing: The Framework and Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2024.3394789openalex-snapshot
Delay-Optimal Distributed Computation Offloading in Wireless Edge Networks
inferred← citeshttps://doi.org/10.1109/tpds.2003.1255637openalex-snapshot
Improved methods for divisible load distribution on k-dimensional meshes using pipelined communications
inferred← citeshttps://doi.org/10.1109/tpds.2005.117openalex-snapshot
Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources
inferred← citeshttps://doi.org/10.1109/tpds.2005.35openalex-snapshot
Scheduling divisible loads on star and tree networks: results and open problems
inferred← citeshttps://doi.org/10.1109/wpdrts.1994.365650openalex-snapshot
Real-time optimization of distributed load balancing
inferred← citeshttps://doi.org/10.1142/s0129054105002929openalex-snapshot
NETWORK MODELING ISSUES FOR GRID APPLICATION SCHEDULING
inferred← citeshttps://doi.org/10.1142/s0129054105002954openalex-snapshot
SCHEDULING ON LARGE SCALE DISTRIBUTED PLATFORMS: FROM MODELS TO IMPLEMENTATIONS
inferred← citeshttps://doi.org/10.1142/s0129626411000035openalex-snapshot
A PRODUCT FORM SOLUTION FOR TREE NETWORKS WITH DIVISIBLE LOADS
inferred← citeshttps://doi.org/10.1142/s012962641100031xopenalex-snapshot
SIMPLE PERFORMANCE BOUNDS FOR MULTICORE AND PARALLEL CHANNEL SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0129626412500041openalex-snapshot
BOUNDS ON THE SCALABILITY OF BAG-OF-TASKS APPLICATIONS RUNNING ON MASTER-SLAVE PLATFORMS
inferred← citeshttps://doi.org/10.1145/1146847.1146855openalex-snapshot
Scheduling divisible loads in the dynamic heterogeneous grid environment
inferred← citeshttps://doi.org/10.1145/2755573.2755576openalex-snapshot
Scheduling in Bandwidth Constrained Tree Networks
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.1145/777412.777414openalex-snapshot
Optimal sharing of bags of tasks in heterogeneous clusters
inferred← citeshttps://doi.org/10.1155/2014/460354openalex-snapshot
Comprehensive Review on Divisible Load Theory: Concepts, Strategies, and Approaches
inferred← citeshttps://doi.org/10.1360/jos172352openalex-snapshot
Independent Tasks Scheduling on Tree-Based Grid Computing Platforms
inferred← citeshttps://doi.org/10.14257/ijgdc.2014.7.3.08openalex-snapshot
Three Levels Load Balancing on Cloudsim
inferred← citeshttps://doi.org/10.1504/ijcse.2014.058701openalex-snapshot
Multi-source task scheduling in grid computing environment using linear programming
inferred← citeshttps://doi.org/10.32657/10356/68812openalex-snapshot
Divisible load scheduling algorithm in a virtual distributed computing system
inferred← citeshttps://doi.org/10.5555/786111.786246openalex-snapshot
Asymptotically optimal worksharing in HNOWs: how long is "sufficiently long?"
inferred← citeshttps://doi.org/10.5772/5359openalex-snapshot
Design of Multi-Behavior Agents for Supply Chain Planning: An Application to the Lumber Industry
inferred← citeshttps://doi.org/10.5772/9448openalex-snapshot
Scheduling of Divisible Loads on Heterogeneous Distributed Systems
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.