On the public citation graph

Applying IC-Scheduling Theory to Familiar Classes of Computations

0 signed · 42 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/j.1538-7305.1964.tb04103.xopenalex-snapshot
Optimal Rearrangeable Multistage Connecting Networks
inferredcites →https://doi.org/10.1007/11549468_31openalex-snapshot
Batch-Scheduling Dags for Internet-Based Computing
inferredcites →https://doi.org/10.1007/978-1-4842-7077-6_3openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/s00224-006-1296-9openalex-snapshot
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
inferredcites →https://doi.org/10.1007/s002240000098openalex-snapshot
A Tight Layout of the Butterfly Network
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/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1109/12.42122openalex-snapshot
Scans as primitive parallel operations
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.370245openalex-snapshot
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
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/tau.1970.1162132openalex-snapshot
A linear filtering approach to the computation of discrete Fourier transform
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.1177/109434200101500302openalex-snapshot
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
inferredcites →https://doi.org/10.7551/mitpress/5222.003.0018openalex-snapshot
A Linear Filtering Approach to the Computation of the Discrete Fourier Transform

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-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-15291-7_35openalex-snapshot
Area-Maximizing Schedules for Series-Parallel DAGs
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/s10723-007-9065-9openalex-snapshot
A Tool for Prioritizing DAGMan Jobs and its Evaluation
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.2015.97openalex-snapshot
A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications
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/icpads.2015.54openalex-snapshot
A Genetic Programming Approach to Design Resource Allocation Policies for Heterogeneous Workflows in the Cloud
inferred← citeshttps://doi.org/10.1109/icpp.2015.94openalex-snapshot
A Testing Engine for High-Performance and Cost-Effective Workflow Execution in the Cloud
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370245openalex-snapshot
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
inferred← citeshttps://doi.org/10.1109/ipdps.2011.126openalex-snapshot
Scheduling on Unspecified Heterogeneous Distributed Resources
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/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/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.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.