On the public citation graph

A realistic model and an efficient heuristic for scheduling with heterogeneous processors

0 signed · 71 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/3-540-44681-8_25openalex-snapshot
Exploiting Unused Time Slots in List Scheduling Considering Communication Contention
inferredcites →https://doi.org/10.1007/3-540-48228-8_38openalex-snapshot
Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention
inferredcites →https://doi.org/10.1007/978-1-4612-1362-8openalex-snapshot
Scheduling and Automatic Parallelization
inferredcites →https://doi.org/10.1007/bfb0024750openalex-snapshot
A static scheduling heuristic for heterogeneous processors
inferredcites →https://doi.org/10.1016/0167-8191(88)90070-1openalex-snapshot
Parallel Gaussian elimination on an MIMD computer
inferredcites →https://doi.org/10.1016/0743-7315(92)90012-copenalex-snapshot
A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
inferredcites →https://doi.org/10.1023/a:1009799631608openalex-snapshot
Scheduling Problems in a Practical Allocation Model
inferredcites →https://doi.org/10.1038/sj.jors.2600829openalex-snapshot
Scheduling Theory and its Applications
inferredcites →https://doi.org/10.1109/12.895858openalex-snapshot
Task allocation on a network of processors
inferredcites →https://doi.org/10.1109/12.956091openalex-snapshot
A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers)
inferredcites →https://doi.org/10.1109/2.476197openalex-snapshot
Task scheduling in multiprocessing systems
inferredcites →https://doi.org/10.1109/71.207593openalex-snapshot
A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
inferredcites →https://doi.org/10.1109/71.242154openalex-snapshot
On the granularity and clustering of directed acyclic task graphs
inferredcites →https://doi.org/10.1109/71.308533openalex-snapshot
DSC: scheduling parallel tasks on an unbounded number of processors
inferredcites →https://doi.org/10.1109/71.605771openalex-snapshot
Minimizing the application execution time through scheduling of subtasks and communication traffic in a heterogeneous computing system
inferredcites →https://doi.org/10.1109/hcw.1998.666545openalex-snapshot
A dynamic matching and scheduling algorithm for heterogeneous computing systems
inferredcites →https://doi.org/10.1109/hcw.1999.765092openalex-snapshot
Task scheduling algorithms for heterogeneous processors
inferredcites →https://doi.org/10.1109/icppw.2001.951971openalex-snapshot
A new task mapping technique for communication-aware scheduling strategies
inferredcites →https://doi.org/10.1109/icppw.2001.951975openalex-snapshot
Improving static scheduling using inter-task concurrency measures
inferredcites →https://doi.org/10.1109/icppw.2001.951976openalex-snapshot
Comparison of contention aware list scheduling heuristics for cluster computing
inferredcites →https://doi.org/10.1109/mcc.1999.766975openalex-snapshot
Parallel Computer Architecture: A Hardware/Software Approach
inferredcites →https://doi.org/10.1145/158439.158908openalex-snapshot
Models of machines and computation for mapping in multicomputers
inferredcites →https://doi.org/10.1145/165231.165236openalex-snapshot
Scalable parallel computing
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470121177.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11605300_5openalex-snapshot
AnthillSched: A Scheduling Strategy for Irregular and Iterative I/O-Intensive Parallel Jobs
inferred← citeshttps://doi.org/10.1007/978-0-387-47658-2_14openalex-snapshot
Scheduling Workflows with Budget Constraints
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_6openalex-snapshot
Scheduling with Communication Delays
inferred← citeshttps://doi.org/10.1007/978-3-031-36805-9_20openalex-snapshot
A Reliability-Based Task Scheduling Method for Wireless Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24596-4_28openalex-snapshot
Scheduling Directed A-Cyclic Task Graphs on Heterogeneous Processors Using Task Duplication
inferred← citeshttps://doi.org/10.1007/978-3-540-69277-5_5openalex-snapshot
Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_78openalex-snapshot
Mapping Pipeline Skeletons onto Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1007/978-3-642-02080-3_21openalex-snapshot
Communication Contention Reduction in Joint Scheduling for Optical Grid Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-03644-6_20openalex-snapshot
Iso-Level CAFT: How to Tackle the Combination of Communication Overhead Reduction and Fault Tolerance Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-04633-9_9openalex-snapshot
Contention-Aware Scheduling with Task Duplication
inferred← citeshttps://doi.org/10.1007/978-3-642-24669-2_9openalex-snapshot
Scheduling Tasks and Communications on a Hierarchical System with Message Contention
inferred← citeshttps://doi.org/10.1007/s10766-016-0445-2openalex-snapshot
Partition Scheduling on Heterogeneous Multicore Processors for Multi-dimensional Loops Applications
inferred← citeshttps://doi.org/10.1007/s11227-007-0152-2openalex-snapshot
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
inferred← citeshttps://doi.org/10.1016/b978-155860933-4/50040-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.future.2017.07.052openalex-snapshot
Theoretical and heuristic aspects of heterogeneous system scheduling with constraints on client’s multiple I/O ports
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.01.006openalex-snapshot
Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.02.003openalex-snapshot
A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.11.004openalex-snapshot
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.10.004openalex-snapshot
Contention-aware scheduling with task duplication
inferred← citeshttps://doi.org/10.1016/j.parco.2007.12.006openalex-snapshot
The impact of heterogeneity on master-slave scheduling
inferred← citeshttps://doi.org/10.1016/j.parco.2008.11.001openalex-snapshot
Contention awareness and fault-tolerant scheduling for precedence constrained tasks in heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.parco.2015.09.005openalex-snapshot
Assessing the cost of redistribution followed by a computational kernel: Complexity and performance results
inferred← citeshttps://doi.org/10.1016/j.simpat.2016.06.010openalex-snapshot
Efficient task scheduling based on theoretical scheduling pattern constrained on single I/O port collision avoidance
inferred← citeshttps://doi.org/10.1080/09747338.2004.11415842openalex-snapshot
An Algorithm for Task Scheduling in Heterogeneous Computing Environment
inferred← citeshttps://doi.org/10.1080/10798587.2011.10643185openalex-snapshot
An Effective Bi-Criteria and Contention Awareness Scheduling in Heterogeneous Distributed Systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2007.56openalex-snapshot
Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation
inferred← citeshttps://doi.org/10.1109/cdciem.2012.50openalex-snapshot
Cache-aware Scheduling for Energy Efficiency on Multi-Processors
inferred← citeshttps://doi.org/10.1109/empdp.2003.1183590openalex-snapshot
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and Grids
inferred← citeshttps://doi.org/10.1109/icppw.2003.1240359openalex-snapshot
Scheduling directed a-cyclic task graphs on heterogeneous network of workstations to minimize schedule length
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303065openalex-snapshot
A hybrid heuristic for DAG scheduling on heterogeneous systems
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639385openalex-snapshot
The impact of heterogeneity on master-slave on-line scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639387openalex-snapshot
Scheduling multiple DAGs onto heterogeneous systems
inferred← citeshttps://doi.org/10.1109/ispdc.2004.12openalex-snapshot
Assessing the Impact and Limits of Steady-State Scheduling for Mixed Task and Data Parallelism on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1109/ispdc.2004.48openalex-snapshot
Task Scheduling: Considering the Processor Involvement in Communication
inferred← citeshttps://doi.org/10.1109/ispdc.2014.16openalex-snapshot
Determining the Optimal Redistribution for a Given Data Partition
inferred← citeshttps://doi.org/10.1109/pdp.2006.49openalex-snapshot
Off-line and on-line scheduling on heterogeneous master-slave platforms
inferred← citeshttps://doi.org/10.1109/tpds.2005.64openalex-snapshot
Communication contention in task scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2006.40openalex-snapshot
Toward a realistic task scheduling model
inferred← citeshttps://doi.org/10.1142/s0129626403001252openalex-snapshot
SCHEDULING STRATEGIES FOR MIXED DATA AND TASK PARALLELISM ON HETEROGENEOUS CLUSTERS
inferred← citeshttps://doi.org/10.1145/1272366.1272388openalex-snapshot
An efficient MPI_allgather for grids
inferred← citeshttps://doi.org/10.1504/ijcat.2015.071423openalex-snapshot
Reliability-aware DAG scheduling with primary-backup in cloud computing
inferred← citeshttps://doi.org/10.4156/jdcta.vol5.issue6.30openalex-snapshot
Communication-aware Fault-tolerant Scheduling Strategy for Precedence Constrained Tasks in Heterogeneous Distributed Systems
inferred← citeshttps://doi.org/10.5120/ijca2016909415openalex-snapshot
Reliability Aware Task Scheduling In Wireless Hetrogeneous Systems
inferred← citeshttps://doi.org/10.5753/wscad.2005.18987openalex-snapshot
Mapeamento de Programas I3 para Aplicações Anthill Paralelas de Fluxos de Dados baseadas em Filtros
inferred← citeshttps://doi.org/10.70675/29c38ac9z6d86z424dz8dcez148daedf433bopenalex-snapshot
Memory-aware Algorithms and Scheduling Techniques for Matrix Computattions
inferred← citeshttps://doi.org/10.70675/9dc8f6bcz8478z4acbzafbaz47e21796202bopenalex-snapshot
Outils et algorithmes pour gérer l'incertitude lors de l'ordonnancement d'application sur plateformes distribuées
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.