On the public citation graph

Exchange of messages of different sizes

https://doi.org/10.1007/bfb0018539
0 signed · 26 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.1007/bf01762116openalex-snapshot
Data transfers in networks
inferredcites →https://doi.org/10.1007/bfb0024753openalex-snapshot
Minimum length scheduling of precedence constrained messages in distributed systems
inferredcites →https://doi.org/10.1007/bfb0030112openalex-snapshot
Multi-Message Multicasting
inferredcites →https://doi.org/10.1109/99.388949openalex-snapshot
Parallelizing molecular dynamics programs for distributed-memory machines
inferredcites →https://doi.org/10.1109/fmpc.1995.380468openalex-snapshot
Many-to-many personalized communication with bounded traffic
inferredcites →https://doi.org/10.1109/infcom.1996.493067openalex-snapshot
On the design of optimal TDM schedules for broadcast WDM networks with arbitrary transceiver tuning latencies
inferredcites →https://doi.org/10.1109/ipps.1994.288248openalex-snapshot
All-to-all communication on meshes with wormhole routing
inferredcites →https://doi.org/10.1109/shpcc.1994.296665openalex-snapshot
Interprocessor collective communication library (InterCom)
inferredcites →https://doi.org/10.1109/tcom.1981.1095028openalex-snapshot
An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders
inferredcites →https://doi.org/10.1137/0214054openalex-snapshot
Scheduling File Transfers
inferredcites →https://doi.org/10.1137/0404003openalex-snapshot
A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes
inferredcites →https://doi.org/10.1142/s0129626498000183openalex-snapshot
Global Communication on Circuit-Switched Toroidal Meshes
inferredcites →https://doi.org/10.1145/321978.321985openalex-snapshot
Open Shop Scheduling to Minimize Finish Time
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.1206openalex-snapshot
Collective communication: theory, practice, and experience
inferred← citeshttps://doi.org/10.1007/978-3-540-74466-5_91openalex-snapshot
Fast and Efficient Total Exchange on Two Clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.003openalex-snapshot
Exchanging messages of different sizes
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00160-6openalex-snapshot
Portable and architecture independent parallel performance tuning using BSP
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00218-1openalex-snapshot
The Paderborn University BSP (PUB) library
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00039-7openalex-snapshot
1-optimality of static BSP computations: scheduling independent chains as a case study
inferred← citeshttps://doi.org/10.1109/aina.2006.232openalex-snapshot
Modeling, predicting and optimizing redistribution between clusters on low latency networks
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017146openalex-snapshot
Scalable Algorithms for Complete Exchange on Multi-Cluster Networks
inferred← citeshttps://doi.org/10.1109/clustr.2006.311889openalex-snapshot
Modeling Network Contention Effects on All-to-All Operations
inferred← citeshttps://doi.org/10.1109/hipc.1998.738003openalex-snapshot
Near optimal algorithms for scheduling independent chains in BSP
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302902openalex-snapshot
Two fast and efficient message scheduling algorithms for data redistribution through a backbone
inferred← citeshttps://doi.org/10.11606/d.45.2006.tde-01082007-002437openalex-snapshot
O problema da troca de mensagens de diferentes tamanhos em redes multi-aglomerados
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.