On the public citation graph

Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs

0 signed · 34 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.1002/cpe.3723openalex-snapshot
Task‐based FMM for heterogeneous architectures
inferredcites →https://doi.org/10.1007/978-3-319-09873-9_47openalex-snapshot
Scheduling Data Flow Program in XKaapi: A New Affinity Based Algorithm for Heterogeneous Architectures
inferredcites →https://doi.org/10.1007/978-3-642-15291-7_23openalex-snapshot
Multi-GPU and Multi-CPU Parallelization for Interactive Physics Simulations
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/s00607-003-0011-9openalex-snapshot
Scheduling Problems on Two Sets of Identical Machines
inferredcites →https://doi.org/10.1016/j.orl.2004.05.004openalex-snapshot
An optimal rounding gives a better approximation for scheduling unrelated machines
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/ipdps.2016.90openalex-snapshot
Are Static Schedules so Bad? A Case Study on Cholesky Factorization
inferredcites →https://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
inferredcites →https://doi.org/10.1109/mcse.2013.98openalex-snapshot
PaRSEC: Exploiting Heterogeneity to Enhance Scalability
inferredcites →https://doi.org/10.1145/1345206.1345227openalex-snapshot
SuperMatrix
inferredcites →https://doi.org/10.1177/1094342009106195openalex-snapshot
Hierarchical Task-Based Programming With StarSs
inferredcites →https://doi.org/10.48550/arxiv.1205.0974openalex-snapshot
Scheduling Unrelated Machines of Few Different Types

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.4647openalex-snapshot
Generic algorithms for scheduling applications on heterogeneous platforms
inferred← citeshttps://doi.org/10.1002/cpe.5573openalex-snapshot
Efficient algorithm for scheduling parallel applications on hybrid multicore machines with communications delays and energy constraint
inferred← citeshttps://doi.org/10.1007/978-3-032-27676-6_6openalex-snapshot
Hierarchical Scheduling for Composable Affinity-Aware Policies in Task-Based Runtimes
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/s11831-024-10069-8openalex-snapshot
An Analytical Review and Performance Measures of State-of-Art Scheduling Algorithms in Heterogenous Computing Enviornment
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.2018.00016openalex-snapshot
Approximation Algorithm for Scheduling Applications on Hybrid Multi-core Machines with Communications Delays
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/ipdrm51949.2020.00005openalex-snapshot
Scheduling across Multiple Applications using Task-Based Programming Models
inferred← citeshttps://doi.org/10.1109/tcc.2021.3132175openalex-snapshot
A Multi-Objective Clustering Evolutionary Algorithm for Multi-Workflow Computation Offloading in Mobile Edge Computing
inferred← citeshttps://doi.org/10.1109/tpds.2019.2942909openalex-snapshot
Online Scheduling of Task Graphs on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1145/3225058.3225107openalex-snapshot
UHCL-Darknet
inferred← citeshttps://doi.org/10.1145/3387110openalex-snapshot
Scheduling on Two Types of Resources
inferred← citeshttps://doi.org/10.70675/3c5259c1zf822z4d19z9537zfa3f571048c3openalex-snapshot
Efficient Management of Resources in Heterogeneous Platforms
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
showing the first 18 of 19 · page through all 19
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.