On the public citation graph

A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications

0 signed · 45 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/11549468_31openalex-snapshot
Batch-Scheduling Dags for Internet-Based Computing
inferredcites →https://doi.org/10.1007/11685654_13openalex-snapshot
A Pebble Game for Internet-Based Computing
inferredcites →https://doi.org/10.1007/978-0-387-09457-1_7openalex-snapshot
Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics
inferredcites →https://doi.org/10.1007/978-3-319-09873-9_52openalex-snapshot
On Constructing DAG-Schedules with Large AREAs
inferredcites →https://doi.org/10.1007/978-3-540-69384-0_31openalex-snapshot
Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids
inferredcites →https://doi.org/10.1007/978-3-642-15291-7_35openalex-snapshot
Area-Maximizing Schedules for Series-Parallel DAGs
inferredcites →https://doi.org/10.1007/978-3-642-23400-2_18openalex-snapshot
Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling
inferredcites →https://doi.org/10.1007/s10723-007-9065-9openalex-snapshot
A Tool for Prioritizing DAGMan Jobs and its Evaluation
inferredcites →https://doi.org/10.1016/j.future.2008.06.012openalex-snapshot
Workflows and e-Science: An overview of workflow system features and capabilities
inferredcites →https://doi.org/10.1016/j.jpdc.2009.11.001openalex-snapshot
Extending IC-scheduling via the Sweep Algorithm
inferredcites →https://doi.org/10.1016/j.jpdc.2012.06.007openalex-snapshot
On scheduling dag s for volatile computing platforms: Area-maximizing schedules
inferredcites →https://doi.org/10.1016/j.jpdc.2013.07.019openalex-snapshot
Stochastic DAG scheduling using a Monte Carlo approach
inferredcites →https://doi.org/10.1023/a:1015617019423openalex-snapshot
Condor-G: A Computation Management Agent for Multi-Institutional Grids
inferredcites →https://doi.org/10.1109/71.993206openalex-snapshot
Performance-effective and low-complexity task scheduling for heterogeneous computing
inferredcites →https://doi.org/10.1109/grid.2008.4662819openalex-snapshot
Investigation of the DAG eligible jobs maximization algorithm in a grid
inferredcites →https://doi.org/10.1109/icdcs.2006.58openalex-snapshot
On Scheduling Expansive and Reductive Dags for Internet-Based Computing
inferredcites →https://doi.org/10.1109/icpp.2008.14openalex-snapshot
On Clustering Tasks in IC-Optimal Dags
inferredcites →https://doi.org/10.1109/ipdps.2004.1303065openalex-snapshot
A hybrid heuristic for DAG scheduling on heterogeneous systems
inferredcites →https://doi.org/10.1109/ipdps.2007.370245openalex-snapshot
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
inferredcites →https://doi.org/10.1109/ipdps.2007.370673openalex-snapshot
Applying IC-Scheduling Theory to Familiar Classes of Computations
inferredcites →https://doi.org/10.1109/ipdps.2009.5160983openalex-snapshot
On scheduling dags to maximize area
inferredcites →https://doi.org/10.1109/ipdps.2011.97openalex-snapshot
Scheduling Parallel Iterative Applications on Volatile Resources
inferredcites →https://doi.org/10.1109/mc.2011.96openalex-snapshot
Using Mathematical Modeling in Provisioning a Heterogeneous Cloud Computing Environment
inferredcites →https://doi.org/10.1109/tc.2004.64openalex-snapshot
On scheduling mesh-structured computations for Internet-based computing
inferredcites →https://doi.org/10.1109/tc.2005.65openalex-snapshot
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
inferredcites →https://doi.org/10.1109/tc.2006.91openalex-snapshot
Toward a theory for scheduling dags in Internet-based computing
inferredcites →https://doi.org/10.1109/tpds.2007.1067openalex-snapshot
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality
inferredcites →https://doi.org/10.1109/tpds.2009.84openalex-snapshot
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments
inferredcites →https://doi.org/10.1142/s0129054114500245openalex-snapshot
ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA
inferredcites →https://doi.org/10.1142/s0129626495000564openalex-snapshot
ONLINE SCHEDULING OF DYNAMIC TREES
inferredcites →https://doi.org/10.2478/s13537-011-0002-4openalex-snapshot
On clustering DAGs for task-hungry computing platforms

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-0859-8_17openalex-snapshot
Privacy-Aware Scheduling Heuristic Based on Priority in Edge Environment
inferred← citeshttps://doi.org/10.1007/s11227-021-04119-2openalex-snapshot
Task scheduling characterisation in enterprise application integration
inferred← citeshttps://doi.org/10.1007/s11227-023-05788-xopenalex-snapshot
A critical path task scheduling algorithm based on sequential failure factor
inferred← citeshttps://doi.org/10.1016/j.future.2019.04.030openalex-snapshot
An enhanced priority-based scheduling heuristic for DAG applications with temporal unpredictability in task execution and data transmission
inferred← citeshttps://doi.org/10.1109/cbd.2016.029openalex-snapshot
Evaluation of the DAG Ready Tasks Maximization Algorithms in Multi-core Computing Platforms
inferred← citeshttps://doi.org/10.1109/cscwd54268.2022.9776105openalex-snapshot
A Priority-Based Level Heuristic Approach for Scheduling DAG Applications with Uncertainties
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00033openalex-snapshot
Evaluating DAG Scheduling Algorithms for Maximum Parallelism
inferred← citeshttps://doi.org/10.1109/ispa/iucc.2017.00020openalex-snapshot
An Adaptive Priority-Based Heuristic Approach for Scheduling DAG Applications with Uncertainties
inferred← citeshttps://doi.org/10.1109/ispa63168.2024.00214openalex-snapshot
A Workflow Scheduling Algorithm Based on Linear Evaluation for Dynamic Distributed Computing Environments
inferred← citeshttps://doi.org/10.1109/isqed48828.2020.9137005openalex-snapshot
An NBTI-aware Task Parallelism Scheme for Improving Lifespan of Multi-core Systems
inferred← citeshttps://doi.org/10.1145/2897783openalex-snapshot
Exploiting Hierarchical Locality in Deep Parallel Architectures
inferred← citeshttps://doi.org/10.1145/3409501.3409512openalex-snapshot
A Strategy of Cloud Resource Load Balancing Enhancement Based on Ant Colony Optimization
inferred← citeshttps://doi.org/10.1186/s13673-017-0109-2openalex-snapshot
A slave ants based ant colony optimization algorithm for task scheduling in cloud computing environments
inferred← citeshttps://doi.org/10.5626/jcse.2016.10.1.9openalex-snapshot
A Task Scheduling Method after Clustering for Data Intensive Jobs in Heterogeneous Distributed Systems
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.