On the public citation graph
On supernode transformation with minimized total running time
0 signed · 53 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.1016/0743-7315(92)90027-kopenalex-snapshot
Tiling multidimensional iteration spaces for multicomputers
inferredcites →https://doi.org/10.1080/10637199408915404openalex-snapshot
FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATION∗
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/asap.1996.544416openalex-snapshot
On supernode transformation with minimized total running time
inferredcites →https://doi.org/10.1109/bicta.2008.4656716openalex-snapshot
Implementation of a classification-based prediction model for plant mRNA Poly(A) sites
inferredcites →https://doi.org/10.1109/icpp.1996.538556openalex-snapshot
On optimal size and shape of supernode transformations
inferredcites →https://doi.org/10.1109/ipps.1996.508151openalex-snapshot
Performance prediction of PVM programs
inferredcites →https://doi.org/10.1109/tpds.2003.1233716openalex-snapshot
Optimal semi-oblique tiling
inferredcites →https://doi.org/10.1142/s0129626491000021openalex-snapshot
LINEAR SCHEDULING IS NEARLY OPTIMAL
inferredcites →https://doi.org/10.1142/s0129626497000401openalex-snapshot
On Tiling as a Loop Transformation
inferredcites →https://doi.org/10.1145/106972.106981openalex-snapshot
The cache performance and optimizations of blocked algorithms
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/224538.224571openalex-snapshot
Optimal tile size adjustment in compiling general DOACROSS loop nests
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-85451-7_41openalex-snapshot
Global Tiling for Communication Minimal Parallelization on Distributed Memory Systems
inferred← citeshttps://doi.org/10.1007/bfb0100469openalex-snapshot
Large neural net simulation under Beowulf-like systems
inferred← citeshttps://doi.org/10.1007/s10559-010-9193-2openalex-snapshot
Tiling optimization in numerically solving a multidimensional heat equation on a ring of processors
inferred← citeshttps://doi.org/10.1007/s10766-013-0248-7openalex-snapshot
A Case Study of Implementing Supernode Transformations
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.1016/j.parco.2006.07.003openalex-snapshot
Message-passing code generation for non-rectangular tiling transformations
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00098-4openalex-snapshot
Time-minimal tiling when rise is larger than zero
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00102-3openalex-snapshot
A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
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/71.879777openalex-snapshot
Chain grouping: a method for partitioning loops onto mesh-connected processor arrays
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/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/icppw.2002.1039778openalex-snapshot
A pipelined execution of tiled nested loops on SMPs with computation and communication overlapping
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924976openalex-snapshot
Minimizing completion time for loop tiling with computation and communication overlapping
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.2006.1639377openalex-snapshot
Selecting the tile shape to reduce the total communication volume
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370571openalex-snapshot
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
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.2008.5213293openalex-snapshot
Positivity, posynomials and tile size selection
inferred← citeshttps://doi.org/10.1109/tpds.2002.1158261openalex-snapshot
On time optimal supernode shape
inferred← citeshttps://doi.org/10.1109/tpds.2003.1233716openalex-snapshot
Optimal semi-oblique tiling
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.2004.1264795openalex-snapshot
Improving scheduling of tasks in a heterogeneous environment
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.1134/s0965542511040026openalex-snapshot
Tiling optimization for the solution of two-dimensional time-dependent heat equation
inferred← citeshttps://doi.org/10.1145/509705.509706openalex-snapshot
Automatic data and computation decomposition on distributed memory parallel computers
inferred← citeshttps://doi.org/10.1145/967900.968184openalex-snapshot
Automatic parallel code generation for tiled nested loops
inferred← citeshttps://doi.org/10.1504/ijcse.2009.027003openalex-snapshot
Efficient hybrid parallelisation of tiled algorithms on SMP clusters
inferred← citeshttps://doi.org/10.2495/hpc000191openalex-snapshot
Partitioning And Mapping Nested Loops On Multicomputer
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
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.