On the public citation graph

Dynamic Memory-Aware Task-Tree Scheduling

https://doi.org/10.1109/ipdps.2017.58
0 signed · 23 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-40047-6_53openalex-snapshot
Multifrontal QR Factorization for Multicore Architectures over Runtime Systems
inferredcites →https://doi.org/10.1016/j.cl.2010.09.003openalex-snapshot
Memory-optimal evaluation of expression trees involving large objects
inferredcites →https://doi.org/10.1016/j.parco.2005.07.004openalex-snapshot
Hybrid scheduling for the parallel solution of linear systems
inferredcites →https://doi.org/10.1109/ccgrid.2007.101openalex-snapshot
Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources
inferredcites →https://doi.org/10.1109/ipdps.2011.60openalex-snapshot
On Optimal Tree Traversals for Sparse Matrix Factorization
inferredcites →https://doi.org/10.1109/ipdps.2017.58openalex-snapshot
Dynamic Memory-Aware Task-Tree Scheduling
inferredcites →https://doi.org/10.1137/0608031openalex-snapshot
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
inferredcites →https://doi.org/10.1137/1.9780898718881openalex-snapshot
Direct Methods for Sparse Linear Systems
inferredcites →https://doi.org/10.1137/130938505openalex-snapshot
Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations
inferredcites →https://doi.org/10.1137/s0895479899358194openalex-snapshot
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
inferredcites →https://doi.org/10.1145/2779052openalex-snapshot
Parallel Scheduling of Task Trees with Limited Memory
inferredcites →https://doi.org/10.1145/321607.321620openalex-snapshot
The Generation of Optimal Code for Arithmetic Expressions
inferredcites →https://doi.org/10.1145/7921.11325openalex-snapshot
On the storage requirement in the out-of-core multifrontal method for sparse factorization

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-981-97-0801-7_21openalex-snapshot
A Heuristic Method for Data Allocation and Task Scheduling on Heterogeneous Multiprocessor Systems Under Memory Constraints
inferred← citeshttps://doi.org/10.1007/s11227-023-05186-3openalex-snapshot
Algorithms for tree-shaped task partition and allocation on heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1109/access.2019.2906011openalex-snapshot
Modeling and Timing Analysis for Microkernel-Based Real-Time Embedded System
inferred← citeshttps://doi.org/10.1109/cyberc55534.2022.00039openalex-snapshot
A CVD Critical Level-aware Scheduling Model Based on Reinforcement Learning for ECG Service Request
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00030openalex-snapshot
Parallel Scheduling of DAGs under Memory Constraints
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00084openalex-snapshot
Task Tree Partition and Subtree Allocation for Heterogeneous Multiprocessors
inferred← citeshttps://doi.org/10.11591/ijece.v10i3.pp2959-2968openalex-snapshot
Memory and I/O optimized rectilinear steiner minimum tree routing for VLSI
inferred← citeshttps://doi.org/10.18293/seke2018-095openalex-snapshot
Timing Analysis for Microkernel-based Real-Time Embedded System
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
showing the first 9 of 10 · page through all 10
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.