On the public citation graph

An Autonomic Approach for the Selection of Robust Dynamic Loop Scheduling Techniques

0 signed · 35 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.710openalex-snapshot
GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing
inferredcites →https://doi.org/10.1007/s10586-005-4098-yopenalex-snapshot
A Load Balancing Tool for Distributed Parallel Loops
inferredcites →https://doi.org/10.1016/j.jpdc.2014.06.008openalex-snapshot
Versatile, scalable, and accurate simulation of distributed applications and platforms
inferredcites →https://doi.org/10.1023/a:1023588520138openalex-snapshot
On the Scalability of Dynamic Scheduling Scientific Applications with Adaptive Weighted Factoring
inferredcites →https://doi.org/10.1109/adprl.2007.368200openalex-snapshot
Two Novel On-policy Reinforcement Learning Algorithms based on TD(λ)-methods
inferredcites →https://doi.org/10.1109/adprl.2009.4927542openalex-snapshot
A theoretical and empirical analysis of Expected Sarsa
inferredcites →https://doi.org/10.1109/clade.2005.1520907openalex-snapshot
Automatic selection of loop scheduling algorithms using reinforcement learning
inferredcites →https://doi.org/10.1109/ipdps.2001.925034openalex-snapshot
Performance of scheduling scientific applications with adaptive weighted factoring
inferredcites →https://doi.org/10.1109/ipdps.2002.1015661openalex-snapshot
Load balancing highly irregular computations with the adaptive factoring
inferredcites →https://doi.org/10.1109/ipdpsw.2010.5470763openalex-snapshot
Investigating the robustness of adaptive Dynamic Loop Scheduling on heterogeneous computing systems
inferredcites →https://doi.org/10.1109/ipdpsw.2012.171openalex-snapshot
Towards the Scalability of Dynamic Loop Scheduling Techniques via Discrete Event Simulation
inferredcites →https://doi.org/10.1109/ispdc.2009.39openalex-snapshot
Towards the Robustness of Dynamic Loop Scheduling on Large-Scale Heterogeneous Distributed Systems
inferredcites →https://doi.org/10.1109/sc.2000.10028openalex-snapshot
The MicroGrid: a Scientific Tool for Modeling Computational Grids
inferredcites →https://doi.org/10.1109/tc.1987.5009495openalex-snapshot
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
inferredcites →https://doi.org/10.1109/tnn.1998.712192openalex-snapshot
Reinforcement Learning: An Introduction
inferredcites →https://doi.org/10.1109/tnn.2004.842673openalex-snapshot
Reinforcement Learning: An Introduction
inferredcites →https://doi.org/10.1109/tpds.2004.24openalex-snapshot
Measuring the robustness of a resource allocation
inferredcites →https://doi.org/10.1109/tse.1985.231547openalex-snapshot
Allocating Independent Subtasks on Parallel Processors
inferredcites →https://doi.org/10.1109/tsmc.2014.2358639openalex-snapshot
Multiobjective Reinforcement Learning: A Comprehensive Overview
inferredcites →https://doi.org/10.1145/135226.135232openalex-snapshot
Factoring: a method for scheduling parallel loops
inferredcites →https://doi.org/10.1145/237502.237576openalex-snapshot
Load-sharing in heterogeneous systems via weighted factoring
inferredcites →https://doi.org/10.17863/cam.132164openalex-snapshot
Learning from Delayed Rewards

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.5648openalex-snapshot
SimAS: A simulation‐assisted approach for the scheduling algorithm selection under perturbations
inferred← citeshttps://doi.org/10.1007/978-3-030-03424-5_17openalex-snapshot
Coordination Model with Reinforcement Learning for Ensuring Reliable On-Demand Services in Collective Adaptive Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-10549-5_36openalex-snapshot
SiL: An Approach for Adjusting Applications to Heterogeneous Systems Under Perturbations
inferred← citeshttps://doi.org/10.1007/s10586-021-03436-8openalex-snapshot
Cost-aware job scheduling for cloud instances using deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.future.2024.07.005openalex-snapshot
An exploration of online-simulation-driven portfolio scheduling in Workflow Management Systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.07.002openalex-snapshot
Optimal load balancing and assessment of existing load balancing criteria
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/cluster.2019.8890998openalex-snapshot
On the Benefits of Anticipating Load Imbalance for Performance Optimization of Parallel Applications
inferred← citeshttps://doi.org/10.1109/inista59065.2023.10310316openalex-snapshot
Deep Reinforcement Learning-based Load Balancer using Kubernetes
inferred← citeshttps://doi.org/10.1109/ispdc59212.2023.00025openalex-snapshot
Automated Scheduling Algorithm Selection in OpenMP
inferred← citeshttps://doi.org/10.1109/pdp50117.2020.00021openalex-snapshot
Adaptive Load Balancing based on Machine Learning for Iterative Parallel Applications
inferred← citeshttps://doi.org/10.1109/tpds.2022.3189270openalex-snapshot
Automated Scheduling Algorithm Selection and Chunk Parameter Calculation in OpenMP
inferred← citeshttps://doi.org/10.48550/arxiv.1905.08073openalex-snapshot
rDLB: A Novel Approach for Robust Dynamic Load Balancing of Scientific Applications with Parallel Independent Tasks
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.