On the public citation graph

Optimal sequencing and arrangement in distributed single-level tree networks with communication delays

0 signed · 88 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.1006/jpdc.1994.1141openalex-snapshot
Distributed Computation with Communication Delays: Asymptotic Performance Analysis
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)
inferredcites →https://doi.org/10.1109/7.272269openalex-snapshot
Distributed computation in linear networks: closed-form solutions
inferredcites →https://doi.org/10.1109/taes.1981.309178openalex-snapshot
Detection with Distributed Sensors
inferredcites →https://doi.org/10.1109/taes.1986.310699openalex-snapshot
Optimal Data Fusion in Multiple Sensor Detection Systems
inferredcites →https://doi.org/10.1109/taes.1987.313355openalex-snapshot
Optimal Detection and Performance of Distributed Sensor Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1520-6424(200106)84:6<11::aid-ecja2>3.0.co;2-7openalex-snapshot
A dynamic load balancing method based on network delay for large distributed systems
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.1006/jpdc.2001.1778openalex-snapshot
Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks
inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
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_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-540-32220-7_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
inferred← citeshttps://doi.org/10.1007/978-3-642-14403-5_1openalex-snapshot
Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads
inferred← citeshttps://doi.org/10.1007/978-3-642-23400-2_16openalex-snapshot
Greedy “Exploitation” Is Close to Optimal on Node-Heterogeneous Clusters
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-04303-5_6openalex-snapshot
Management of Resources in Parallel Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-04363-9_6openalex-snapshot
Communication Delays and Multiprocessor Tasks
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/s10951-019-00626-6openalex-snapshot
Scheduling divisible loads with time and cost constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(96)00123-3openalex-snapshot
Scheduling multiprocessor tasks — An overview
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/0898-1221(96)00156-3openalex-snapshot
Scheduling divisible loads in bus networks with arbitrary processor release times
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.01.008openalex-snapshot
Cooperative image analysis in visual sensor networks
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.jpdc.2004.09.008openalex-snapshot
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.016openalex-snapshot
Design and performance evaluation of load distribution strategies for multiple divisible loads on heterogeneous linear daisy chain networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.03.013openalex-snapshot
Requirement-aware strategies for scheduling real-time divisible loads on clusters
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/s0167-8191(97)00068-9openalex-snapshot
Transputer-based implementation of distributed associative memories
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00104-5openalex-snapshot
Divisible task scheduling – Concept and verification
inferred← citeshttps://doi.org/10.1016/s0378-4754(01)00329-9openalex-snapshot
Large matrix–vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation
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: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:1020971118034openalex-snapshot
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks
inferred← citeshttps://doi.org/10.1080/1206212x.2003.11441695openalex-snapshot
Distributed Image Processing On A Network Of Workstations
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/3468.895891openalex-snapshot
Suboptimal solutions using integer approximation techniques for scheduling divisible loads on distributed bus networks
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.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/7.892677openalex-snapshot
Divisible load scheduling on single-level tree networks with buffer constraints
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/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/clustr.2008.4663779openalex-snapshot
Divisible load scheduling with improved asymptotic optimality
inferred← citeshttps://doi.org/10.1109/dcoss.2014.30openalex-snapshot
Real-Time Distributed Visual Feature Extraction from Video in Sensor Networks
inferred← citeshttps://doi.org/10.1109/empdp.2005.25openalex-snapshot
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617312openalex-snapshot
Optimal data allocation for processor-tree architectures
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617358openalex-snapshot
High performance in tree-based parallel architectures
inferred← citeshttps://doi.org/10.1109/ifipnetworking.2015.7145333openalex-snapshot
Algorithms for distributed feature extraction in multi-camera visual sensor networks
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.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/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/taes.2004.1310014openalex-snapshot
Equal allocation scheduling for data intensive applications
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/tcsvt.2017.2745102openalex-snapshot
Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks
inferred← citeshttps://doi.org/10.1109/tmc.2015.2465390openalex-snapshot
Predictive Distributed Visual Analysis for Video in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2005.139openalex-snapshot
Multiround algorithms for scheduling divisible loads
inferred← citeshttps://doi.org/10.1109/tpds.2007.1032openalex-snapshot
A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments
inferred← citeshttps://doi.org/10.1109/vtcspring.2015.7145619openalex-snapshot
A Mathematical Programming Approach to Task Offloading in Visual Sensor Networks
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.1142/s0218001498000208openalex-snapshot
An Image-Recognition System Implemented On Hierarchical Parallel Architectures
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.4304/jsw.9.7.1757-1766openalex-snapshot
Optimization Algorithm for Divisible Load Scheduling on Heterogeneous Star Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1705.08252openalex-snapshot
Distributed Algorithms for Feature Extraction Off-loading in Multi-Camera Visual Sensor 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.01899openalex-snapshot
Reinforcement Learning for Optimal Load Distribution Sequencing in Resource-Sharing System
inferred← citeshttps://doi.org/10.5555/786111.786246openalex-snapshot
Asymptotically optimal worksharing in HNOWs: how long is "sufficiently long?"
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.