On the public citation graph

Portfolio-Based Selection of Robust Dynamic Loop Scheduling Algorithms Using Machine Learning

0 signed · 43 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-319-10214-6_8openalex-snapshot
Toward Better Simulation of MPI Applications on Ethernet/TCP Networks
inferredcites →https://doi.org/10.1007/978-3-642-23786-7_35openalex-snapshot
Algorithm Selection and Scheduling
inferredcites →https://doi.org/10.1007/978-3-642-25566-3_40openalex-snapshot
Sequential Model-Based Optimization for General Algorithm Configuration
inferredcites →https://doi.org/10.1007/s11227-007-0148-yopenalex-snapshot
Dynamic load balancing with adaptive factoring methods in scientific applications
inferredcites →https://doi.org/10.1016/0743-7315(88)90015-9openalex-snapshot
An overview of the PTRAN analysis system for multiprocessing
inferredcites →https://doi.org/10.1016/j.future.2004.09.033openalex-snapshot
Adaptive grid job scheduling with genetic algorithms
inferredcites →https://doi.org/10.1016/j.jpdc.2013.08.011openalex-snapshot
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization
inferredcites →https://doi.org/10.1016/s0065-2458(08)60520-3openalex-snapshot
The Algorithm Selection Problem
inferredcites →https://doi.org/10.1109/icpp.2011.17openalex-snapshot
Virtual Machine Provisioning Based on Analytical Performance and QoS in Cloud Computing Environments
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/ipdpsw.2013.132openalex-snapshot
Evaluating the Flexibility of Dynamic Loop Scheduling on Heterogeneous Systems in the Presence of Fluctuating Load Using SimGrid
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/ispdc.2012.29openalex-snapshot
Analyzing the Robustness of Dynamic Loop Scheduling for Heterogeneous Computing Systems
inferredcites →https://doi.org/10.1109/ispdc.2013.10openalex-snapshot
Predicting the Flexibility of Dynamic Loop Scheduling Using an Artificial Neural Network
inferredcites →https://doi.org/10.1109/paap.2010.65openalex-snapshot
A Scheduling Strategy on Load Balancing of Virtual Machine Resources in Cloud Computing Environment
inferredcites →https://doi.org/10.1109/tpds.2004.24openalex-snapshot
Measuring the robustness of a resource allocation
inferredcites →https://doi.org/10.1109/uksim.2008.28openalex-snapshot
SimGrid: A Generic Framework for Large-Scale Distributed Experiments
inferredcites →https://doi.org/10.1126/science.275.5296.51openalex-snapshot
An Economics Approach to Hard Computational Problems
inferredcites →https://doi.org/10.1145/1538902.1538906openalex-snapshot
Empirical hardness models
inferredcites →https://doi.org/10.1145/1656274.1656278openalex-snapshot
The WEKA data mining software
inferredcites →https://doi.org/10.1145/2287036.2287044openalex-snapshot
Efficient provisioning of bursty scientific workloads on the cloud using adaptive elasticity control
inferredcites →https://doi.org/10.1145/2487575.2487629openalex-snapshot
Auto-WEKA
inferredcites →https://doi.org/10.1145/2503210.2503244openalex-snapshot
Exploring portfolio scheduling for long-term execution of scientific workloads in IaaS clouds
inferredcites →https://doi.org/10.1145/2503210.2503263openalex-snapshot
Predicting application performance using supervised learning on communication features
inferredcites →https://doi.org/10.1145/2517448openalex-snapshot
On the validity of flow-level tcp network models for grid and cloud simulations
inferredcites →https://doi.org/10.1145/2591635.2667156openalex-snapshot
An overview of the PTRAN analysis system for multiprocessing
inferredcites →https://doi.org/10.1214/lnms/1215456182openalex-snapshot
Global versus local search in constrained optimization of computer models
inferredcites →https://doi.org/10.1613/jair.2490openalex-snapshot
SATzilla: Portfolio-based Algorithm Selection for SAT
inferredcites →https://doi.org/10.21236/ada451466openalex-snapshot
Winner-Take-All Networks of O(N) Complexity

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.3933openalex-snapshot
Design methodology for workload‐aware loop scheduling strategies based on genetic algorithm and simulation
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-10549-5_36openalex-snapshot
SiL: An Approach for Adjusting Applications to Heterogeneous Systems Under Perturbations
inferred← citeshttps://doi.org/10.1007/978-3-031-22698-4_1openalex-snapshot
On the Feasibility of Simulation-Driven Portfolio Scheduling for Cyberinfrastructure Runtime Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66562-7_38openalex-snapshot
Off-line and On-line Scheduling of SAT Instances with Time Processing Constraints
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.1007/s10601-018-9287-4openalex-snapshot
Online over time processing of combinatorial problems
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.procs.2017.05.222openalex-snapshot
Assessing the Performance of the SRR Loop Scheduler with Irregular Workloads
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188153openalex-snapshot
rDLB: A Novel Approach for Robust Dynamic Load Balancing of Scientific Applications with Independent Tasks
inferred← citeshttps://doi.org/10.1109/ispdc.2015.29openalex-snapshot
Investigating the Resilience of Dynamic Loop Scheduling in Heterogeneous Computing Systems
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
inferred← citeshttps://doi.org/10.5753/wscad.2015.14280openalex-snapshot
Uma Metodologia Baseada em Simulação e Algoritmo Genético para Exploração de Estratégias de Escalonamento de Laços
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.