On the public citation graph

Are Static Schedules so Bad? A Case Study on Cholesky Factorization

0 signed · 66 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.1002/cpe.1631openalex-snapshot
StarPU: a unified platform for task scheduling on heterogeneous multicore architectures
inferredcites →https://doi.org/10.1002/cpe.3359openalex-snapshot
Scheduling independent tasks on multi‐cores with GPU accelerators
inferredcites →https://doi.org/10.1007/978-1-4615-1479-4openalex-snapshot
Constraint - based scheduling : applying constraint programming to scheduling problems
inferredcites →https://doi.org/10.1007/978-3-319-09873-9_5openalex-snapshot
Modeling and Simulation of a Dynamic Task-Based Runtime System for Heterogeneous Multi-core Architectures
inferredcites →https://doi.org/10.1007/s11227-010-0395-1openalex-snapshot
Scheduling task graphs optimally with A*
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/71.993206openalex-snapshot
Performance-effective and low-complexity task scheduling for heterogeneous computing
inferredcites →https://doi.org/10.1109/ipdpsw.2015.35openalex-snapshot
Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms
inferredcites →https://doi.org/10.1109/mcse.2009.207openalex-snapshot
The libflame Library for Dense Matrix Computations
inferredcites →https://doi.org/10.1109/mcse.2013.98openalex-snapshot
PaRSEC: Exploiting Heterogeneity to Enhance Scalability
inferredcites →https://doi.org/10.1109/uksim.2008.28openalex-snapshot
SimGrid: A Generic Framework for Large-Scale Distributed Experiments
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1137/130915662openalex-snapshot
Task-Based FMM for Multicore Architectures
inferredcites →https://doi.org/10.1145/1345206.1345227openalex-snapshot
SuperMatrix
inferredcites →https://doi.org/10.1145/2807591.2807599openalex-snapshot
Exploiting asynchrony from exact forward recovery for DUE in iterative solvers
inferredcites →https://doi.org/10.1145/324133.324234openalex-snapshot
Scheduling multithreaded computations by work stealing
inferredcites →https://doi.org/10.1177/1094342009106195openalex-snapshot
Hierarchical Task-Based Programming With StarSs
inferredcites →https://doi.org/10.48550/arxiv.1010.2000openalex-snapshot
A Critical Path Approach to Analyzing Parallelism of Algorithmic Variants. Application to Cholesky Inversion
inferredcites →https://doi.org/10.48550/arxiv.1303.3182openalex-snapshot
Tiled Algorithms for Matrix Computations on Multicore Architectures

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.4502openalex-snapshot
Fast approximation algorithms for task‐based runtime systems
inferred← citeshttps://doi.org/10.1002/cpe.6999openalex-snapshot
Fine‐grain task‐parallel algorithms for matrix factorizations and inversion on many‐threaded CPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-50371-0_1openalex-snapshot
An Efficient New Static Scheduling Heuristic for Accelerated Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-57675-2_9openalex-snapshot
A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule
inferred← citeshttps://doi.org/10.1007/978-3-030-58144-2_13openalex-snapshot
sOMP: Simulating OpenMP Task-Based Applications with NUMA Effects
inferred← citeshttps://doi.org/10.1007/978-3-031-40744-4_13openalex-snapshot
Improving Simulations of Task-Based Applications on Complex NUMA Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-58943-5_5openalex-snapshot
Resource Aggregation for Task-Based Cholesky Factorization on Top of Heterogeneous Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-64203-1_17openalex-snapshot
Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms
inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_14openalex-snapshot
Online Scheduling of Task Graphs on Hybrid Platforms
inferred← citeshttps://doi.org/10.1007/s10766-025-00796-1openalex-snapshot
Thread and Data Mapping in Software Transactional Memory: an Overview
inferred← citeshttps://doi.org/10.1007/s11227-024-06032-wopenalex-snapshot
Optimization of uncertain dependent task mapping on heterogeneous computing platforms
inferred← citeshttps://doi.org/10.1016/j.is.2019.01.006openalex-snapshot
Predictive performance modeling for distributed batch processing using black box monitoring and machine learning
inferred← citeshttps://doi.org/10.1016/j.parco.2018.10.007openalex-snapshot
Resource aggregation for task-based Cholesky Factorization on top of modern architectures
inferred← citeshttps://doi.org/10.1016/j.procs.2019.12.131openalex-snapshot
Dynamic Variant Rank HEFT Task Scheduling Algorithm Toward Exascle Computing
inferred← citeshttps://doi.org/10.1088/1742-6596/1994/1/012037openalex-snapshot
An optimized workflow scheduling algorithm on CPU-GPU heterogeneous systems
inferred← citeshttps://doi.org/10.1109/access.2018.2803794openalex-snapshot
A Heterogeneous Parallel Cholesky Block Factorization Algorithm
inferred← citeshttps://doi.org/10.1109/access.2019.2917714openalex-snapshot
Dynamic Scheduling Strategy for Block Parallel Cholesky Factorization Based on Activity on Edge Network
inferred← citeshttps://doi.org/10.1109/access.2019.2962355openalex-snapshot
Two-Stage Column Block Parallel LU Factorization Algorithm
inferred← citeshttps://doi.org/10.1109/access.2025.3602234openalex-snapshot
A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies
inferred← citeshttps://doi.org/10.1109/cluster48925.2021.00031openalex-snapshot
READYS: A Reinforcement Learning Based Strategy for Heterogeneous Dynamic Scheduling
inferred← citeshttps://doi.org/10.1109/hipc.2016.045openalex-snapshot
Scheduling of Linear Algebra Kernels on Multiple Heterogeneous Resources
inferred← citeshttps://doi.org/10.1109/hipc50609.2020.00032openalex-snapshot
2D Static Resource Allocation for Compressed Linear Algebra and Communication Constraints
inferred← citeshttps://doi.org/10.1109/ipdps.2017.71openalex-snapshot
Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00110openalex-snapshot
Analysis of a List Scheduling Algorithm for Task Graphs on Two Types of Resources
inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00013openalex-snapshot
Influence of Tasks Duration Variability on Task-Based Runtime Schedulers
inferred← citeshttps://doi.org/10.1109/ipdpsw55747.2022.00095openalex-snapshot
Decentralized in-order execution of a sequential task-based code for shared-memory architectures
inferred← citeshttps://doi.org/10.1109/ipdrm51949.2020.00005openalex-snapshot
Scheduling across Multiple Applications using Task-Based Programming Models
inferred← citeshttps://doi.org/10.1109/ross51935.2020.00011openalex-snapshot
Locality-Aware Scheduling for Scalable Heterogeneous Environments
inferred← citeshttps://doi.org/10.1109/rteict42901.2018.9012401openalex-snapshot
Cluster-Based Scheduling Algorithm
inferred← citeshttps://doi.org/10.1109/samos.2017.8344634openalex-snapshot
Task graph mapping and scheduling on heterogeneous architectures under communication constraints
inferred← citeshttps://doi.org/10.1109/sc.2018.00065openalex-snapshot
ParSy: Inspection and Transformation of Sparse Matrix Computations for Parallelism
inferred← citeshttps://doi.org/10.1109/ssci47803.2020.9308278openalex-snapshot
Geometric deep reinforcement learning for dynamic DAG scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2017.2777449openalex-snapshot
Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2019.2942909openalex-snapshot
Online Scheduling of Task Graphs on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2021.3135876openalex-snapshot
Performant, Multi-Objective Scheduling of Highly Interleaved Task Graphs on Heterogeneous System on Chip Devices
inferred← citeshttps://doi.org/10.1145/3229631.3229643openalex-snapshot
Communication-aware scheduling algorithms for synchronous dataflow graphs on multicore systems
inferred← citeshttps://doi.org/10.1145/3337821.3337921openalex-snapshot
Performance Models for Data Transfers
inferred← citeshttps://doi.org/10.1145/3440034openalex-snapshot
Code-size-aware Scheduling of Synchronous Dataflow Graphs on Multicore Systems
inferred← citeshttps://doi.org/10.1145/3797905.3800554openalex-snapshot
Non-Delayed Cholesky Factorization
inferred← citeshttps://doi.org/10.14569/ijacsa.2019.0100718openalex-snapshot
Communication and Computation Aware Task Scheduling Framework Toward Exascale Computing
inferred← citeshttps://doi.org/10.4197/comp.8-2.1openalex-snapshot
Communication and Computation Aware Task Scheduling Framework for Heterogeneous Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1904.06825openalex-snapshot
Performance Models for Data Transfers: A Case Study with Molecular Chemistry Kernels
inferred← citeshttps://doi.org/10.70675/42fab030zaf8ez47cbzaa74ze8aacaa9883eopenalex-snapshot
Programmation des architectures hétérogènes à l'aide de tâches divisibles ou modulables
inferred← citeshttps://doi.org/10.70675/4868eba5zf5f4z47b9zb491z84d4b64be486openalex-snapshot
Optimization of energy and performance of applications on heterogeneous micro-servers
inferred← citeshttps://doi.org/10.70675/596ed207zce1az43dez9b5fzb69d2c21eb2copenalex-snapshot
Apprentissage par renforcement pour l'optimisation combinatoire : exploiter l'incertitude, les structures et les connaissances a priori
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
inferred← citeshttps://doi.org/10.7717/peerj-cs.190openalex-snapshot
Impact study of data locality on task-based applications through the Heteroprio scheduler
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.