On the public citation graph

A Communication-Time Tradeoff

https://doi.org/10.1137/0216044
0 signed · 83 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.1137/0219021openalex-snapshot
Towards an Architecture-Independent Analysis of Parallel Algorithms

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.6007openalex-snapshot
A CPU‐FPGA heterogeneous approach for biological sequence comparison using high‐level synthesis
inferred← citeshttps://doi.org/10.1002/scj.4690171001openalex-snapshot
Time and communication complexity in parallel computations
inferred← citeshttps://doi.org/10.1006/jagm.1997.0856openalex-snapshot
Edge Weight Reduction Problems in Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1006/jcss.1995.1001openalex-snapshot
On the Power of the Linear Array Architecture for Performing Tree-Structured Computations
inferred← citeshttps://doi.org/10.1006/jcss.1995.1067openalex-snapshot
The Expected Advantage of Asynchrony
inferred← citeshttps://doi.org/10.1006/jcss.1996.0053openalex-snapshot
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_103openalex-snapshot
Communication complexity of PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_95openalex-snapshot
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_232openalex-snapshot
A convex hull algorithm on coarse-grained multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_13openalex-snapshot
On the scope of applicability of the ETF algorithm
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_53openalex-snapshot
Optimal schedules for d-D grid graphs with communication delays
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_1openalex-snapshot
A Critique of the PRAM Model of Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_12openalex-snapshot
Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_67openalex-snapshot
A Lower Bound Technique for Communication on BSP with Application to the FFT
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_7openalex-snapshot
The Architecture of Parallel Computers
inferred← citeshttps://doi.org/10.1007/bf01961545openalex-snapshot
Scheduling Tree dags on Parallel Architectures
inferred← citeshttps://doi.org/10.1007/bfb0030883openalex-snapshot
Scheduling task-tree with additive scales on parallel/distributed machines
inferred← citeshttps://doi.org/10.1007/pl00009254openalex-snapshot
Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays
inferred← citeshttps://doi.org/10.1007/s42514-019-00011-xopenalex-snapshot
Trade-offs between computation, communication, and synchronization in stencil-collective alternate update
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90028-hopenalex-snapshot
Trade-offs between communication and space
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90071-iopenalex-snapshot
Towards a single model of efficient computation in real parallel machines
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90056-fopenalex-snapshot
Multiprocessor scheduling with communication delays
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot
Communication complexity of PRAMs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00267-mopenalex-snapshot
Optimal parallel execution of complete binary trees and grids into most popular interconnection networks
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00297-9openalex-snapshot
Minimizing the schedule length for a parallel 3D-grid precedence graph
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90048-8openalex-snapshot
Parallel bottom-up processing of datalog queries
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90116-7openalex-snapshot
Scheduling with sufficient loosely coupled processors
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90034-kopenalex-snapshot
A practical hierarchical model of parallel computation I. The model
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00034-0openalex-snapshot
Some models for scheduling parallel programs with communication delays
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00047-7openalex-snapshot
Optimal schedules for d-D grid graphs with communication delays
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00280-0openalex-snapshot
Scheduling task-trees with additive scales on parallel/distributed machines
inferred← citeshttps://doi.org/10.1080/02533839.1995.9677752openalex-snapshot
A duplication heuristic for static scheduling of tasks on distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1109/71.113078openalex-snapshot
A processor-time-minimal systolic array for cubical mesh algorithms
inferred← citeshttps://doi.org/10.1109/71.139200openalex-snapshot
A processor-time-minimal systolic array for transitive closure
inferred← citeshttps://doi.org/10.1109/71.277790openalex-snapshot
A period-processor-time-minimal schedule for cubical mesh algorithms
inferred← citeshttps://doi.org/10.1109/71.282560openalex-snapshot
Scheduling DAG's for asynchronous multiprocessor execution
inferred← citeshttps://doi.org/10.1109/71.80124openalex-snapshot
On mapping systolic algorithms onto the hypercube
inferred← citeshttps://doi.org/10.1109/78.575702openalex-snapshot
Communication-sensitive loop scheduling for DSP applications
inferred← citeshttps://doi.org/10.1109/apads.1993.588930openalex-snapshot
Optimal within a constant schedules for forest dags on parallel architectures
inferred← citeshttps://doi.org/10.1109/asap.1990.145439openalex-snapshot
A processor-time minimal systolic array for transitive closure
inferred← citeshttps://doi.org/10.1109/asap.1993.397150openalex-snapshot
A period-processor-time-minimal schedule for cubical mesh algorithms
inferred← citeshttps://doi.org/10.1109/asap.1994.331805openalex-snapshot
A processor-time-minimal schedule for the standard tensor product algorithm
inferred← citeshttps://doi.org/10.1109/asap.1996.542819openalex-snapshot
Static communication scheduling for minimizing collisions in application specific parallel systems
inferred← citeshttps://doi.org/10.1109/icde.1996.492115openalex-snapshot
Parallel pointer-based join algorithms in memory mapped environments
inferred← citeshttps://doi.org/10.1109/icpp.1994.19openalex-snapshot
A Comparison of Multiprocessor Scheduling Heuristics
inferred← citeshttps://doi.org/10.1109/ipps.1993.262865openalex-snapshot
Scheduling a computational dag on a parallel system with communication delays and replication of node execution
inferred← citeshttps://doi.org/10.1109/ipps.1994.288264openalex-snapshot
A comparison of heuristics for scheduling DAGs on multiprocessors
inferred← citeshttps://doi.org/10.1109/sbac-padw.2015.19openalex-snapshot
On the Evaluation of Contention-Aware List Schedulers on Multicore Cluster
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185364openalex-snapshot
Communication complexity for parallel divide-and-conquer
inferred← citeshttps://doi.org/10.1109/spdp.1991.218201openalex-snapshot
A period-processor-time-minimal systolic array for cubical mesh algorithms
inferred← citeshttps://doi.org/10.1109/spdp.1991.218284openalex-snapshot
What is an effective schedule?
inferred← citeshttps://doi.org/10.1109/spdp.1992.242755openalex-snapshot
Optimal and near optimal tree scheduling for parallel systems
inferred← citeshttps://doi.org/10.1109/spdp.1994.346125openalex-snapshot
Good algorithm design style for multiprocessors
inferred← citeshttps://doi.org/10.1109/superc.1992.236653openalex-snapshot
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1109/tc.1987.1676942openalex-snapshot
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
inferred← citeshttps://doi.org/10.1109/tc.2011.40openalex-snapshot
Modeling Energy-Time Trade-Offs in VLSI Computation
inferred← citeshttps://doi.org/10.1137/0219021openalex-snapshot
Towards an Architecture-Independent Analysis of Parallel Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539797326502openalex-snapshot
Automatic Methods for Hiding Latency in Parallel and Distributed Computation
inferred← citeshttps://doi.org/10.1145/140901.140916openalex-snapshot
Optimal dynamic scheduling of task tree on constant-dimensional architectures
inferred← citeshttps://doi.org/10.1145/158439.158908openalex-snapshot
Models of machines and computation for mapping in multicomputers
inferred← citeshttps://doi.org/10.1145/212433.212471openalex-snapshot
Scheduling problems in parallel query optimization
inferred← citeshttps://doi.org/10.1145/215399.215403openalex-snapshot
Provably efficient scheduling for languages with fine-grained parallelism
inferred← citeshttps://doi.org/10.1145/2612669.2612671openalex-snapshot
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations
inferred← citeshttps://doi.org/10.1145/2897188openalex-snapshot
Trade-Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations
inferred← citeshttps://doi.org/10.1145/301970.301974openalex-snapshot
Provably efficient scheduling for languages with fine-grained parallelism
inferred← citeshttps://doi.org/10.1145/3181776openalex-snapshot
A Lower Bound Technique for Communication in BSP
inferred← citeshttps://doi.org/10.1145/3210377.3210415openalex-snapshot
A 3D Parallel Algorithm for QR Decomposition
inferred← citeshttps://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors
inferred← citeshttps://doi.org/10.1145/62212.62262openalex-snapshot
Towards an architecture-independent analysis of parallel algorithms
inferred← citeshttps://doi.org/10.1145/72935.72937openalex-snapshot
On communication latency in PRAM computations
inferred← citeshttps://doi.org/10.1145/72935.72954openalex-snapshot
The APRAM: incorporating asynchrony into the PRAM model
inferred← citeshttps://doi.org/10.1145/72935.72962openalex-snapshot
Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays
inferred← citeshttps://doi.org/10.1145/73007.73028openalex-snapshot
Tradeoffs between communication and space
inferred← citeshttps://doi.org/10.1145/93597.98724openalex-snapshot
A framework for the parallel processing of Datalog queries
inferred← citeshttps://doi.org/10.1145/93605.98724openalex-snapshot
A framework for the parallel processing of Datalog queries
inferred← citeshttps://doi.org/10.1145/97444.97460openalex-snapshot
Low overhead parallel schedules for task graphs
inferred← citeshttps://doi.org/10.14711/thesis-b556245openalex-snapshot
High-performance algorithms for compile-time scheduling of parallel processors
inferred← citeshttps://doi.org/10.21236/ada604834openalex-snapshot
Tradeoffs Between Synchronization, Communication, and Work in Parallel Linear Algebra Computations
inferred← citeshttps://doi.org/10.48456/tr-537openalex-snapshot
Parallel systems in symbolic and algebraic computation
inferred← citeshttps://doi.org/10.48550/arxiv.0804.0940openalex-snapshot
Optimum Binary Search Trees on the Hierarchical Memory Model
inferred← citeshttps://doi.org/10.48550/arxiv.1307.1805openalex-snapshot
Communication Lower Bounds for Distributed-Memory Computations
inferred← citeshttps://doi.org/10.5555/147877.148081openalex-snapshot
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors
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.