On the public citation graph
Generalized multiprocessor scheduling and applications to matrix computations
0 signed · 40 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.1007/bf01942605openalex-snapshot
The Optimal Control Approach to Generalized Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/71.296318openalex-snapshot
Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory
inferredcites →https://doi.org/10.1109/icpp.1993.153openalex-snapshot
Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler
inferredcites →https://doi.org/10.1109/icpp.1994.21openalex-snapshot
A Convex Programming Approach for Exploiting Data and Functional Parallelism on Distributed Memory Multicomputers
inferredcites →https://doi.org/10.1109/ipps.1991.153827openalex-snapshot
A scheduling algorithm for parallelizable dependent tasks
inferredcites →https://doi.org/10.1109/ipps.1994.288264openalex-snapshot
A comparison of heuristics for scheduling DAGs on multiprocessors
inferredcites →https://doi.org/10.1109/real.1989.63557openalex-snapshot
Scheduling parallelizable jobs on multiprocessors
inferredcites →https://doi.org/10.1109/tc.1986.1676781openalex-snapshot
Scheduling Multiprocessor Tasks to Minimize Schedule Length
inferredcites →https://doi.org/10.1119/1.14981openalex-snapshot
Numerical Recipes, The Art of Scientific Computing
inferredcites →https://doi.org/10.1137/0402042openalex-snapshot
Complexity of Scheduling Parallel Task Systems
inferredcites →https://doi.org/10.1145/113379.113399openalex-snapshot
Generalised multiprocessor scheduling using optimal control
inferredcites →https://doi.org/10.1145/125826.126138openalex-snapshot
A fast static scheduling algorithm for DAGs on an unbounded number of processors
inferredcites →https://doi.org/10.1145/191995.192060openalex-snapshot
Software-extended coherent shared memory: performance and cost
inferredcites →https://doi.org/10.1287/opre.9.6.841openalex-snapshot
Parallel Sequencing and Assembly Line Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1494openalex-snapshot
Load Partitioning and Trade-Off Study for Large Matrix-Vector Computations in Multicast Bus Networks with Communication Delays
inferred← citeshttps://doi.org/10.1007/11539117_128openalex-snapshot
Optimizing the Distributed Network Monitoring Model with Bounded Bandwidth and Delay Constraints by Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-57675-2_11openalex-snapshot
Improving Mapping for Sparse Direct Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_16openalex-snapshot
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability
inferred← citeshttps://doi.org/10.1007/978-3-540-74466-5_80openalex-snapshot
Task Scheduling for Parallel Multifrontal Methods
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_37openalex-snapshot
Scheduling Trees of Malleable Tasks for Sparse Linear Algebra
inferred← citeshttps://doi.org/10.1007/s00224-016-9722-0openalex-snapshot
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability
inferred← citeshttps://doi.org/10.1007/s11063-013-9306-9openalex-snapshot
From Different Zhang Functions to Various ZNN Models Accelerated to Finite-Time Convergence for Time-Varying Linear Matrix Equation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.12.003openalex-snapshot
List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104792openalex-snapshot
Multi-resource scheduling of moldable workflows
inferred← citeshttps://doi.org/10.1016/j.suscom.2020.100447openalex-snapshot
Energy-aware scheduling of malleable HPC applications using a Particle Swarm optimised greedy algorithm
inferred← citeshttps://doi.org/10.1016/j.sysarc.2019.101706openalex-snapshot
Contention-aware optimal scheduling of real-time precedence-constrained task graphs on heterogeneous distributed systems
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00029openalex-snapshot
Scheduling Parallel Tasks under Multiple Resources: List Scheduling vs. Pack Scheduling
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00058openalex-snapshot
Teaching Complex Scheduling Algorithms
inferred← citeshttps://doi.org/10.1109/isorc.2019.00042openalex-snapshot
Optimal Scheduling of Precedence-constrained Task Graphs on Heterogeneous Distributed Systems with Shared Buses
inferred← citeshttps://doi.org/10.1109/sbac-pad53543.2021.00024openalex-snapshot
Shelf schedules for independent moldable tasks to minimize the energy consumption
inferred← citeshttps://doi.org/10.1109/tpds.2009.11openalex-snapshot
Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2018.2793886openalex-snapshot
Malleable Task-Graph Scheduling with a Practical Speed-Up Model
inferred← citeshttps://doi.org/10.1137/130938505openalex-snapshot
Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations
inferred← citeshttps://doi.org/10.23919/acc.2019.8815148openalex-snapshot
Optimal Scheduling of PTGs with Multiple Service Levels on Heterogeneous Distributed Systems
inferred← citeshttps://doi.org/10.4230/oasics.ng-res.2020.2openalex-snapshot
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice
inferred← citeshttps://doi.org/10.70675/2e3f99c4zb393z4965z9a79z9019627e6e66openalex-snapshot
Task Mapping and Load-balancing for Performance, Memory, Reliability and Energy
inferred← citeshttps://doi.org/10.70675/4288eb74za2d9z4542z953cz99f5a2b53f47openalex-snapshot
Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides
inferred← citeshttps://doi.org/10.70675/bfcf593fz024bz4fb7zafb4z91d9fde1788copenalex-snapshot
Scheduling task graphs on modern computing platforms
inferred← citeshttps://doi.org/10.70675/c56ebd34z7627z4f75zb277z9249c079eca5openalex-snapshot
Scaling the solution of large sparse linear systems using multifrontal methods on hybrid shared-distributed memory architectures
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.