On the public citation graph
Minimizing completion time for loop tiling with computation and communication overlapping
0 signed · 56 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.1006/jpdc.1997.1310openalex-snapshot
Communication-Minimal Tiling of Uniform Dependence Loops
inferredcites →https://doi.org/10.1006/jpdc.1999.1530openalex-snapshot
Optimal Scheduling for UET/UET-UCT Generalizedn-Dimensional Grid Task Graphs
inferredcites →https://doi.org/10.1007/3-540-45591-4_2openalex-snapshot
Memory Management in a combined VIA/SCI Hardware
inferredcites →https://doi.org/10.1016/0743-7315(92)90027-kopenalex-snapshot
Tiling multidimensional iteration spaces for multicomputers
inferredcites →https://doi.org/10.1109/12.123395openalex-snapshot
Independent partitioning of algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/12.90251openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/71.149964openalex-snapshot
Partitioning and labeling of loops by unimodular transformations
inferredcites →https://doi.org/10.1109/71.679213openalex-snapshot
On supernode transformation with minimized total running time
inferredcites →https://doi.org/10.1109/71.879777openalex-snapshot
Chain grouping: a method for partitioning loops onto mesh-connected processor arrays
inferredcites →https://doi.org/10.1109/icpp.2000.876163openalex-snapshot
Evaluation of loop grouping methods based on orthogonal projection spaces
inferredcites →https://doi.org/10.1109/ipdps.2001.925149openalex-snapshot
VIA over SCI - consequences of a zero copy implementation, and comparison with VIA over myrinet
inferredcites →https://doi.org/10.1142/s0129626497000401openalex-snapshot
On Tiling as a Loop Transformation
inferredcites →https://doi.org/10.1145/195473.195499openalex-snapshot
Software overhead in messaging layers
inferredcites →https://doi.org/10.1145/277830.277883openalex-snapshot
The design and implementation of zero copy MPI using commodity hardware with a high performance network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_29openalex-snapshot
Loop Parallelization in Multi-dimensional Cartesian Space
inferred← citeshttps://doi.org/10.1007/978-3-540-88140-7_19openalex-snapshot
Automatic Transformation for Overlapping Communication and Computation
inferred← citeshttps://doi.org/10.1007/s10586-017-0821-8openalex-snapshot
Predictive communication modeling for HPC applications
inferred← citeshttps://doi.org/10.1007/s10766-009-0094-9openalex-snapshot
A Speculative and Adaptive MPI Rendezvous Protocol Over RDMA-enabled Interconnects
inferred← citeshttps://doi.org/10.1007/s11227-005-0298-8openalex-snapshot
Hyperplane Grouping and Pipelined Schedules: How to Execute Tiled Loops Fast on Clusters of SMPs
inferred← citeshttps://doi.org/10.1007/s11227-006-6367-9openalex-snapshot
A New Genetic Algorithm for Loop Tiling
inferred← citeshttps://doi.org/10.1007/s11227-008-0262-5openalex-snapshot
Parallel loop generation and scheduling
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.116152openalex-snapshot
TEA-SEA: Tiling and scheduling of non-uniform two-level perfectly nested loops using an evolutionary approach
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.002openalex-snapshot
Topology and computational-power aware tile mapping of perfectly nested loops with dependencies on distributed systems
inferred← citeshttps://doi.org/10.1016/j.parco.2006.07.003openalex-snapshot
Message-passing code generation for non-rectangular tiling transformations
inferred← citeshttps://doi.org/10.1016/s0927-5452(04)80032-7openalex-snapshot
Delivering high performance to parallel applications using advanced scheduling
inferred← citeshttps://doi.org/10.1080/17445760.2017.1296147openalex-snapshot
Supernode transformation on GPGPUs
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017132openalex-snapshot
Efficient Utilization of Memory Mapped NICs onto Clusters using Pipelined Schedules
inferred← citeshttps://doi.org/10.1109/clustr.2002.1137768openalex-snapshot
Compiling tiled iteration spaces for clusters
inferred← citeshttps://doi.org/10.1109/clustr.2009.5289174openalex-snapshot
Overlapping computation and communication in SMT clusters with commodity interconnects
inferred← citeshttps://doi.org/10.1109/empdp.2004.1271475openalex-snapshot
Scheduling of tiled nested loops onto a cluster with a fixed number of SMP nodes
inferred← citeshttps://doi.org/10.1109/hpcs.2008.10openalex-snapshot
Improving Communication Progress and Overlap in MPI Rendezvous Protocol over RDMA-enabled Interconnects
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579010openalex-snapshot
Parallel loop scheduling using an evolutionary algorithm
inferred← citeshttps://doi.org/10.1109/icppw.2002.1039778openalex-snapshot
A pipelined execution of tiled nested loops on SMPs with computation and communication overlapping
inferred← citeshttps://doi.org/10.1109/iit.2007.4430369openalex-snapshot
Wave-Fronts Parallelization and Scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016567openalex-snapshot
Enhancing the performance of tiled loop execution onto clusters using memory mapped network interfaces and pipelined schedules
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303302openalex-snapshot
On the interference of communication on computation in Java
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639308openalex-snapshot
Dynamic multi phase scheduling for heterogeneous clusters
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639377openalex-snapshot
Selecting the tile shape to reduce the total communication volume
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470761openalex-snapshot
Solving the advection PDE on the cell broadband engine
inferred← citeshttps://doi.org/10.1109/ispa.2012.37openalex-snapshot
Incremental Parallelization with Migration
inferred← citeshttps://doi.org/10.1109/sc.2002.10008openalex-snapshot
Pipelined Scheduling of Tiled Nested Loops onto Clusters of SMPs Using Memory Mapped Network Interfaces
inferred← citeshttps://doi.org/10.1109/sc.2005.75openalex-snapshot
Transformations to Parallel Codes for Communication-Computation Overlap
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239870openalex-snapshot
An efficient code generation technique for tiled iteration spaces
inferred← citeshttps://doi.org/10.1109/tpds.2008.114openalex-snapshot
Communication-Aware Supernode Shape
inferred← citeshttps://doi.org/10.1109/umedia.2017.8074109openalex-snapshot
Supernode transformation on computer clusters
inferred← citeshttps://doi.org/10.1145/1122971.1122978openalex-snapshot
RDMA read based rendezvous protocol for MPI over InfiniBand
inferred← citeshttps://doi.org/10.1145/3087556.3087586openalex-snapshot
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms
inferred← citeshttps://doi.org/10.1145/508791.508961openalex-snapshot
Automatic code generation for executing tiled nested loops onto parallel architectures
inferred← citeshttps://doi.org/10.1177/1094342006061889openalex-snapshot
Interference-Aware Scheduling
inferred← citeshttps://doi.org/10.3390/a16070352openalex-snapshot
Generating Loop Patterns with a Genetic Algorithm and a Probabilistic Cellular Automata Rule
inferred← citeshttps://doi.org/10.5555/1898953.1899073openalex-snapshot
Selecting the tile shape to reduce the total communication volume
inferred← citeshttps://doi.org/10.5555/762761.762769openalex-snapshot
Pipelined Scheduling of Tiled Nested Loops onto Clusters of SMPs Using Memory Mapped Network Interfaces
inferred← citeshttps://doi.org/10.70675/142031fcz7033z4d9cz8278z6230c974cac7openalex-snapshot
Performance Centric Dynamic Function Level Binary Transformation
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.