On the public citation graph
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
0 signed · 56 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.1002/cpe.938openalex-snapshot
Distributed computing in practice: the Condor experience
inferredcites →https://doi.org/10.1007/11549468_31openalex-snapshot
Batch-Scheduling Dags for Internet-Based Computing
inferredcites →https://doi.org/10.1007/978-0-387-71107-2openalex-snapshot
Practical Optimization: Algorithms and Engineering Applications
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.1109/5992.895191openalex-snapshot
SETI@home-massively distributed computing for SETI
inferredcites →https://doi.org/10.1109/ccgrid.2001.923162openalex-snapshot
The anatomy of the grid: enabling scalable virtual organizations
inferredcites →https://doi.org/10.1109/ipdps.2001.925033openalex-snapshot
A case for economy grid architecture for service oriented grid computing
inferredcites →https://doi.org/10.1109/ipdps.2002.1015590openalex-snapshot
Models and scheduling mechanisms for global computing applications
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/ipps.1999.760453openalex-snapshot
The computational Co-op: Gathering clusters into a metacomputer
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.1145/321864.321866openalex-snapshot
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
inferredcites →https://doi.org/10.1177/109434200101500302openalex-snapshot
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
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.1694openalex-snapshot
A distributed evolutionary approach for multisite mapping on grids
inferred← citeshttps://doi.org/10.1002/cpe.2989openalex-snapshot
Trust‐based workflow refactoring for concurrent scheduling in service‐oriented environment
inferred← citeshttps://doi.org/10.1002/cpe.3560openalex-snapshot
On constructing DAG‐schedules with large areas
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_52openalex-snapshot
On Constructing DAG-Schedules with Large AREAs
inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_2openalex-snapshot
Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016
inferred← citeshttps://doi.org/10.1007/978-3-642-14493-6_67openalex-snapshot
A New Approach for Workflow Tasks Scheduling in Distributed Heterogeneous Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_35openalex-snapshot
Area-Maximizing Schedules for Series-Parallel DAGs
inferred← citeshttps://doi.org/10.1007/978-3-642-23178-0_30openalex-snapshot
An Efficient Evolutionary Scheduling Algorithm for Parallel Job Model in Grid Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-23400-2_18openalex-snapshot
Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-31500-8_5openalex-snapshot
A Grid Scheduling Based on Generalized Extremal Optimization for Parallel Job Model
inferred← citeshttps://doi.org/10.1007/s10723-007-9065-9openalex-snapshot
A Tool for Prioritizing DAGMan Jobs and its Evaluation
inferred← citeshttps://doi.org/10.1007/s10951-014-0382-0openalex-snapshot
Scheduling parallel batch jobs in grids with evolutionary metaheuristics
inferred← citeshttps://doi.org/10.1007/s11227-009-0284-7openalex-snapshot
DAGMap: efficient and dependable scheduling of DAG workflow job in Grid
inferred← citeshttps://doi.org/10.1007/s11227-011-0668-3openalex-snapshot
Petri net based Grid workflow verification and optimization
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.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.2009.11.001openalex-snapshot
Extending IC-scheduling via the Sweep Algorithm
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.06.007openalex-snapshot
On scheduling dag s for volatile computing platforms: Area-maximizing schedules
inferred← citeshttps://doi.org/10.1109/ccgrid.2009.14openalex-snapshot
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.97openalex-snapshot
A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications
inferred← citeshttps://doi.org/10.1109/cluster.2011.45openalex-snapshot
Evolutionary Scheduling of Parallel Tasks Graphs onto Homogeneous Clusters
inferred← citeshttps://doi.org/10.1109/grid.2008.4662778openalex-snapshot
DAGMap: Efficient scheduling for DAG grid workflow job
inferred← citeshttps://doi.org/10.1109/hpdc.2006.1652146openalex-snapshot
A Tool for Prioritizing DAGMan Jobs and Its Evaluation
inferred← citeshttps://doi.org/10.1109/icpp.2008.14openalex-snapshot
On Clustering Tasks in IC-Optimal Dags
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370673openalex-snapshot
Applying IC-Scheduling Theory to Familiar Classes of Computations
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160983openalex-snapshot
On scheduling dags to maximize area
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/pdp.2008.16openalex-snapshot
Extending IC-Scheduling via the Sweep Algorithm
inferred← citeshttps://doi.org/10.1109/sbac-pad.2016.35openalex-snapshot
Scheduling Matters: Area-Oriented Heuristic for Resource Management
inferred← citeshttps://doi.org/10.1109/services.2014.71openalex-snapshot
Reliability of SOA Systems Using SPN and GA
inferred← citeshttps://doi.org/10.1109/tc.2011.203openalex-snapshot
Robust Scheduling of Task Graphs under Execution Time Uncertainty
inferred← citeshttps://doi.org/10.1109/tpds.2007.1067openalex-snapshot
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality
inferred← citeshttps://doi.org/10.1109/tpds.2014.2346189openalex-snapshot
An AREA-Oriented Heuristic for Scheduling DAGs on Volatile Computing Platforms
inferred← citeshttps://doi.org/10.1142/s0129054114500245openalex-snapshot
ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA
inferred← citeshttps://doi.org/10.1145/1645164.1645171openalex-snapshot
A data-driven workflow language for grids based on array programming principles
inferred← citeshttps://doi.org/10.1177/1094342015594518openalex-snapshot
Scheduling DAG-based workflows on single cloud instances: High-performance and cost effectiveness with a static scheduler
inferred← citeshttps://doi.org/10.2478/s13537-011-0002-4openalex-snapshot
On clustering DAGs for task-hungry computing platforms
inferred← citeshttps://doi.org/10.5281/zenodo.209688openalex-snapshot
FIGURE 2 in Ancyronyx jaechi sp. n. from Sri Lanka, the first record of the genus Ancyronyx Erichson, 1847 (Insecta: Coleoptera: Elmidae) from the Indian Subcontinent, and a world checklist of species
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.