On the public citation graph
Designing broadcasting algorithms in the postal model for message-passing systems
0 signed · 103 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/dac.4520010208openalex-snapshot
Paris: An approach to integrated high‐speed private networks
inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1016/b978-0-08-057090-7.50011-4openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1109/infcom.1992.263450openalex-snapshot
An overview of the AURORA gigabit testbed
inferredcites →https://doi.org/10.1109/ipps.1994.288290openalex-snapshot
Architecture and implementation of Vulcan
inferredcites →https://doi.org/10.1142/s0129626493000356openalex-snapshot
A LOWER BOUND FOR ORDER-PRESERVING BROADCAST IN THE POSTAL MODEL
inferredcites →https://doi.org/10.1145/140901.140903openalex-snapshot
Designing broadcasting algorithms in the postal model for message-passing systems
inferredcites →https://doi.org/10.1145/140901.141883openalex-snapshot
The network architecture of the Connection Machine CM-5 (extended abstract)
inferredcites →https://doi.org/10.1145/155332.155333openalex-snapshot
LogP: towards a realistic model of parallel computation
inferredcites →https://doi.org/10.1145/62546.62560openalex-snapshot
New models and algorithms for future 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/scj.10533openalex-snapshot
Scheduling for broadcast operation in heterogeneous parallel computing environments
inferred← citeshttps://doi.org/10.1006/jagm.1998.0972openalex-snapshot
Fault-Local Distributed Mending
inferred← citeshttps://doi.org/10.1006/jagm.2001.1204openalex-snapshot
Broadcast Scheduling Optimization for Heterogeneous Cluster Systems
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1759openalex-snapshot
On Multicast Algorithms for Heterogeneous Networks of Workstations
inferred← citeshttps://doi.org/10.1007/10720115_9openalex-snapshot
Broadcast/Multicast over Myrinet Using NIC-Assisted Multidestination Messages
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_9openalex-snapshot
Coping with Delays and Time-Outs in Binary Search Procedures
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_19openalex-snapshot
Approximation Algorithm for Directed Telephone Multicast Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-75178-8_51openalex-snapshot
Help Your Busy Neighbors: Dynamic Multicasts over Static Topologies
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_3openalex-snapshot
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_15openalex-snapshot
Approximation Schemes for Broadcasting in Heterogenous Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_40openalex-snapshot
Broadcasting in Heterogeneous Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_1openalex-snapshot
Prologue: What This Book Is About
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_2openalex-snapshot
Fault-Tolerant Search à la Ulam-Rényi
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_3openalex-snapshot
Adaptive vs. Non-adaptive Search
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_4openalex-snapshot
Weighted Errors over a General Channel
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_5openalex-snapshot
Variations on a Theme of Ulam and Rényi: More Types of Questions and Lies
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_22openalex-snapshot
Broadcasting in Heterogeneous Tree Networks with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-88-470-2107-5_10openalex-snapshot
Rota-Metropolis cubic logic and Ulam-Rényi games
inferred← citeshttps://doi.org/10.1007/s00453-001-0063-1openalex-snapshot
Lopsided Trees, I: Analyses
inferred← citeshttps://doi.org/10.1007/s00453-007-9113-7openalex-snapshot
An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments
inferred← citeshttps://doi.org/10.1007/s00453-008-9249-0openalex-snapshot
Broadcasting on Networks of Workstations
inferred← citeshttps://doi.org/10.1007/s10479-025-06609-5openalex-snapshot
Biased random-key genetic algorithms for the weighted minimum broadcast time problem
inferred← citeshttps://doi.org/10.1007/s10878-012-9493-8openalex-snapshot
The broadcast median problem in heterogeneous postal model
inferred← citeshttps://doi.org/10.1016/j.cpc.2018.03.028openalex-snapshot
hPIC: A scalable electrostatic Particle-in-Cell for Plasma–Material Interactions
inferred← citeshttps://doi.org/10.1016/j.cpc.2022.108410openalex-snapshot
Unified X-space parallelization algorithm for conserved discrete unified gas kinetic scheme
inferred← citeshttps://doi.org/10.1016/j.dam.2003.11.004openalex-snapshot
On searching strategies, parallel questions, and delayed answers
inferred← citeshttps://doi.org/10.1016/j.ins.2014.03.130openalex-snapshot
Constructing application-layer multicast trees for minimum-delay message distribution
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.07.010openalex-snapshot
A framework for adaptive collective communications for heterogeneous hierarchical computing systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.12.003openalex-snapshot
Efficient trigger-broadcasting in heterogeneous clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.12.001openalex-snapshot
Optimal broadcast for fully connected processor-node networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.031openalex-snapshot
Broadcasting in weighted trees under the postal model
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00426-xopenalex-snapshot
Binary search with delayed and missing answers
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00121-8openalex-snapshot
Minimizing broadcast costs under edge reductions in tree networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00107-9openalex-snapshot
Optimal point-to-point broadcast algorithms via lopsided trees
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00155-9openalex-snapshot
Optimal multiple message broadcasting in telephone-like communication systems
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00029-6openalex-snapshot
Scheduling outtrees of height one in the LogP model
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00103-5openalex-snapshot
A software architecture for user transparent parallel image processing
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00059-6openalex-snapshot
Efficient implementation of reduce-scatter in MPI
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00060-2openalex-snapshot
Incorporating memory layout in the modeling of message passing programs
inferred← citeshttps://doi.org/10.1109/71.406965openalex-snapshot
Computing global combine operations in the multiport postal model
inferred← citeshttps://doi.org/10.1109/71.491579openalex-snapshot
On the design and implementation of broadcast and global combine operations using the postal model
inferred← citeshttps://doi.org/10.1109/71.532111openalex-snapshot
Fast parallel sorting under LogP: experience with the CM-5
inferred← citeshttps://doi.org/10.1109/71.615442openalex-snapshot
Efficient algorithms for the reduce-scatter operation in LogGP
inferred← citeshttps://doi.org/10.1109/71.642949openalex-snapshot
Efficient algorithms for all-to-all communications in multiport message-passing systems
inferred← citeshttps://doi.org/10.1109/71.770196openalex-snapshot
Broadcasting multiple messages in the multiport model
inferred← citeshttps://doi.org/10.1109/dsn.2006.37openalex-snapshot
High Throughput Total Order Broadcast for Cluster Environments
inferred← citeshttps://doi.org/10.1109/empdp.2002.994294openalex-snapshot
Incorporating memory layout in the modeling of message passing programs
inferred← citeshttps://doi.org/10.1109/empdp.2002.994296openalex-snapshot
Efficient implementation of reduce-scatter in MPI
inferred← citeshttps://doi.org/10.1109/hpcsa.2002.1019155openalex-snapshot
Efficient gather operation in heterogeneous cluster systems
inferred← citeshttps://doi.org/10.1109/hpcsim.2009.5192825openalex-snapshot
Predicting the performance of multi-agent based simulation with Ethernet switched clusters
inferred← citeshttps://doi.org/10.1109/icdcs.2007.80openalex-snapshot
A High Throughput Atomic Storage Algorithm
inferred← citeshttps://doi.org/10.1109/icppw.2000.869145openalex-snapshot
Efficient multicast in heterogeneous networks of workstations
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924978openalex-snapshot
HiHCoHP-Toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors
inferred← citeshttps://doi.org/10.1109/ipps.1994.288208openalex-snapshot
CCL: a portable and tunable collective communication library for scalable parallel computers
inferred← citeshttps://doi.org/10.1109/ipps.1996.508148openalex-snapshot
Broadcasting multiple messages in the multiport model
inferred← citeshttps://doi.org/10.1109/ispa.2010.44openalex-snapshot
Construction of Application-Layer Multicast Trees for Message Distribution
inferred← citeshttps://doi.org/10.1109/istcs.1997.595158openalex-snapshot
Optimal point-to-point broadcast algorithms via lopsided trees
inferred← citeshttps://doi.org/10.1109/melcon.1998.699451openalex-snapshot
The generalized postal model-broadcasting in a system with non-homogeneous delays
inferred← citeshttps://doi.org/10.1109/rivf.2009.5174657openalex-snapshot
Reliable Multicast Protocol in Distributed Simulation for Multi-agent Systems
inferred← citeshttps://doi.org/10.1109/sc.2012.86openalex-snapshot
Optimization principles for collective neighborhood communications
inferred← citeshttps://doi.org/10.1109/spdp.1993.395514openalex-snapshot
Computing global combine operations in the multi-port postal model
inferred← citeshttps://doi.org/10.1109/spdp.1994.346118openalex-snapshot
On the design and implementation of broadcast and global combine operations using the postal model
inferred← citeshttps://doi.org/10.1109/spdp.1994.346164openalex-snapshot
Optimal multiple message broadcasting in telephone-like communication systems
inferred← citeshttps://doi.org/10.1109/tpds.2002.1019863openalex-snapshot
P-3PC: a point-to-point communication model for automatic and optimal decomposition of regular domain problems
inferred← citeshttps://doi.org/10.1109/tpds.2023.3269625openalex-snapshot
Redesigning OpenKMC for Multi-Component Trillion-Atom Simulations on the New Sunway Supercomputer
inferred← citeshttps://doi.org/10.1111/itor.13146openalex-snapshot
A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
inferred← citeshttps://doi.org/10.1137/s0097539704440740openalex-snapshot
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
inferred← citeshttps://doi.org/10.1137/s0097539798347906openalex-snapshot
Message Multicasting in Heterogeneous Networks
inferred← citeshttps://doi.org/10.1137/s0895480101386450openalex-snapshot
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
inferred← citeshttps://doi.org/10.1137/s0895480199365397openalex-snapshot
On the Optimality of General Lower Bounds for Broadcasting and Gossiping
inferred← citeshttps://doi.org/10.1142/s0129054105002942openalex-snapshot
AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE
inferred← citeshttps://doi.org/10.1142/s0129626499000049openalex-snapshot
COMPARISON OF HEURISTICS FOR ONE-TO-ALL AND ALL-TO-ALL COMMUNICATIONS IN PARTIAL MESHES
inferred← citeshttps://doi.org/10.1145/1073970.1074017openalex-snapshot
Broadcasting on networks of workstations
inferred← citeshttps://doi.org/10.1145/1463768.1463780openalex-snapshot
A unified model for multicore architectures
inferred← citeshttps://doi.org/10.1145/1693453.1693476openalex-snapshot
Scalable communication protocols for dynamic sparse data exchange
inferred← citeshttps://doi.org/10.1145/181014.181756openalex-snapshot
Efficient algorithms for all-to-all communications in multi-port message-passing systems
inferred← citeshttps://doi.org/10.1145/1813654.1813656openalex-snapshot
Throughput optimal total order broadcast for cluster environments
inferred← citeshttps://doi.org/10.1145/1837853.1693476openalex-snapshot
Scalable communication protocols for dynamic sparse data exchange
inferred← citeshttps://doi.org/10.1145/263580.263635openalex-snapshot
Performance considerations in software multicasts
inferred← citeshttps://doi.org/10.1145/276698.276857openalex-snapshot
Multicasting in heterogeneous networks
inferred← citeshttps://doi.org/10.1145/3330345.3330358openalex-snapshot
Using performance models to understand scalable Krylov solver performance at scale for structured grid problems
inferred← citeshttps://doi.org/10.1145/341800.341816openalex-snapshot
Broadcast scheduling optimization for heterogeneous cluster systems
inferred← citeshttps://doi.org/10.1145/3722102openalex-snapshot
Scaling and Load-Balancing Equi-Joins
inferred← citeshttps://doi.org/10.1155/2009/681708openalex-snapshot
Evaluating Multicore Algorithms on the Unified Memory Model
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3999openalex-snapshot
The complexity of reliable distributed storage
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.