On the public citation graph

Hybrid Static/dynamic Scheduling for Already Optimized Dense Matrix Factorization

https://doi.org/10.1109/ipdps.2012.53
0 signed · 37 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/978-3-642-15646-5_24openalex-snapshot
Load Balancing for Regular Meshes on SMPs with MPI
inferredcites →https://doi.org/10.1016/j.parco.2008.10.002openalex-snapshot
A class of parallel tiled linear algebra algorithms for multicore architectures
inferredcites →https://doi.org/10.1109/ipdps.2010.5470348openalex-snapshot
Adapting communication-avoiding LU and QR factorizations to multicore architectures
inferredcites →https://doi.org/10.1109/sc.2008.5214287openalex-snapshot
Communication Avoiding Gaussian elimination
inferredcites →https://doi.org/10.1109/sc.2010.12openalex-snapshot
Characterizing the Influence of System Noise on Large-Scale Applications by Simulation
inferredcites →https://doi.org/10.1109/sffcs.1999.814600openalex-snapshot
Cache-oblivious algorithms
inferredcites →https://doi.org/10.1109/tc.1987.5009495openalex-snapshot
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
inferredcites →https://doi.org/10.1109/tpds.2003.1214317openalex-snapshot
Tiling, block data layout, and memory hierarchy performance
inferredcites →https://doi.org/10.1109/vlsid.2007.97openalex-snapshot
Locality-Aware Distributed Loop Scheduling for Chip Multiprocessors
inferredcites →https://doi.org/10.1137/s0895479896297744openalex-snapshot
Locality of Reference in LU Decomposition with Partial Pivoting
inferredcites →https://doi.org/10.1145/113379.113401openalex-snapshot
A simple load balancing scheme for task allocation in parallel machines
inferredcites →https://doi.org/10.1145/209936.209958openalex-snapshot
Cilk
inferredcites →https://doi.org/10.1145/209937.209958openalex-snapshot
Cilk
inferredcites →https://doi.org/10.1145/324133.324234openalex-snapshot
Scheduling multithreaded computations by work stealing
inferredcites →https://doi.org/10.1147/rd.416.0737openalex-snapshot
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
inferredcites →https://doi.org/10.5555/1413370.1413400openalex-snapshot
Communication avoiding Gaussian elimination

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.5170openalex-snapshot
A comprehensive performance evaluation of the BinLPT workload‐aware loop scheduler
inferred← citeshttps://doi.org/10.1002/nme.4729openalex-snapshot
A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
inferred← citeshttps://doi.org/10.1007/978-3-030-28596-8_13openalex-snapshot
Toward a Standard Interface for User-Defined Scheduling in OpenMP
inferred← citeshttps://doi.org/10.1007/978-3-030-58144-2_19openalex-snapshot
Toward Supporting Multi-GPU Targets via Taskloop and User-Defined Schedules
inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_14openalex-snapshot
Optimizing the LU Factorization for Energy Efficiency on a Many-Core Architecture
inferred← citeshttps://doi.org/10.1007/978-3-319-24595-9_2openalex-snapshot
Composing Low-Overhead Scheduling Strategies for Improving Performance of Scientific Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-49631-3_4openalex-snapshot
Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-40820-5_4openalex-snapshot
A Fine-Grained Pipelined Implementation of LU Decomposition on SIMD Processors
inferred← citeshttps://doi.org/10.1109/access.2020.3015045openalex-snapshot
Auto-Tuning of Dynamic Scheduling Applied to 3D Reverse Time Migration on Multicore Systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2018.00018openalex-snapshot
Multi-Level Load Balancing with an Integrated Runtime Approach
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.109openalex-snapshot
Dynamically Balanced Synchronization-Avoiding LU Factorization with Multicore and GPUs
inferred← citeshttps://doi.org/10.1109/mcsoc51149.2021.00042openalex-snapshot
Task Scheduling Strategies for Batched Basic Linear Algebra Subprograms on Many-core CPUs
inferred← citeshttps://doi.org/10.1145/2642769.2642788openalex-snapshot
Locality-Optimized Mixed Static/Dynamic Scheduling for Improving Load Balancing on SMPs
inferred← citeshttps://doi.org/10.1145/3152041.3152085openalex-snapshot
Integrating OpenMP into the Charm++ Programming Model
inferred← citeshttps://doi.org/10.1145/3404397.3404441openalex-snapshot
Enabling performance portability of data-parallel OpenMP applications on asymmetric multicore processors
inferred← citeshttps://doi.org/10.2172/1172915openalex-snapshot
Programming Abstractions for Data Locality
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5376openalex-snapshot
Optimizing the Performance of Multi-threaded Linear Algebra Libraries Based on Task Granularity
inferred← citeshttps://doi.org/10.7287/peerj-cs.969v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.969v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.969v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.969v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Automated prioritizing heuristics for parallel task graph scheduling in heterogeneous computing (v0.2)"
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.