On the public citation graph
Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid
0 signed · 48 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/jos.121openalex-snapshot
Scheduling chains on uniform processors with communication delays
inferredcites →https://doi.org/10.1007/3-540-44444-0_14openalex-snapshot
An Advanced User Interface Approach for Complex Parameter Study Process Specification on the Information Power Grid
inferredcites →https://doi.org/10.1007/3-540-44444-0_20openalex-snapshot
Adaptive Scheduling for Master-Worker Applications on the Computational Grid
inferredcites →https://doi.org/10.1007/978-3-540-45209-6_26openalex-snapshot
Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids
inferredcites →https://doi.org/10.1007/bf01415940openalex-snapshot
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
inferredcites →https://doi.org/10.1007/pl00020913openalex-snapshot
Scheduling identical jobs with chain precedence constraints on two uniform machines
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(75)80008-0openalex-snapshot
NP-complete scheduling problems
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1016/s0167-5060(08)70743-xopenalex-snapshot
Complexity of Machine Scheduling Problems
inferredcites →https://doi.org/10.1109/hcw.1997.581411openalex-snapshot
A scheduling expert advisor for heterogeneous environments
inferredcites →https://doi.org/10.1109/hcw.1999.765123openalex-snapshot
A unified resource scheduling framework for heterogeneous computing environments
inferredcites →https://doi.org/10.1109/hcw.2000.843728openalex-snapshot
Master/slave computing on the Grid
inferredcites →https://doi.org/10.1109/hcw.2000.843757openalex-snapshot
Heuristics for scheduling parameter sweep applications in grid environments
inferredcites →https://doi.org/10.1109/hpdc.1997.622361openalex-snapshot
The software architecture of a virtual distributed computing environment
inferredcites →https://doi.org/10.1109/icpp.2003.1240603openalex-snapshot
Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid
inferredcites →https://doi.org/10.1109/ipdps.2000.846030openalex-snapshot
High performance parametric modeling with Nimrod/G: killer application for the global grid?
inferredcites →https://doi.org/10.1137/0217033openalex-snapshot
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
inferredcites →https://doi.org/10.1142/s0129626400000263openalex-snapshot
SCHEDULING COMPLETE TREES ON TWO UNIFORM PROCESSORS WITH INTEGER SPEED RATIOS AND COMMUNICATION DELAYS
inferredcites →https://doi.org/10.1145/321941.321951openalex-snapshot
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
inferredcites →https://doi.org/10.1145/322077.322090openalex-snapshot
`` Strong '' NP-Completeness Results
inferredcites →https://doi.org/10.1145/322326.322335openalex-snapshot
An Almost-Linear Algorithm for Two-Processor Scheduling
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11557654_56openalex-snapshot
CPOC: Effective Static Task Scheduling for Grid Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-69277-5_1openalex-snapshot
Meta-heuristics for Grid Scheduling Problems
inferred← citeshttps://doi.org/10.1007/s10723-009-9144-1openalex-snapshot
Towards the Scheduling of Multiple Workflows on Computational Grids
inferred← citeshttps://doi.org/10.1007/s10878-013-9650-8openalex-snapshot
Scheduling with task replication on desktop grids: theoretical and experimental analysis
inferred← citeshttps://doi.org/10.1007/s11227-016-1637-7openalex-snapshot
Cost-aware DAG scheduling algorithms for minimizing execution cost on cloud resources
inferred← citeshttps://doi.org/10.1007/s13174-011-0032-0openalex-snapshot
HCOC: a cost optimization algorithm for workflow scheduling in hybrid clouds
inferred← citeshttps://doi.org/10.1007/s13369-015-1705-yopenalex-snapshot
Energy-Aware Workflow Scheduling in Grid Under QoS Constraints
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.03.002openalex-snapshot
Self-adjustment of resource allocation for grid applications
inferred← citeshttps://doi.org/10.1016/j.future.2009.11.005openalex-snapshot
Computational models and heuristic methods for Grid scheduling problems
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.2.479openalex-snapshot
Influence of Inaccurate Performance Prediction on Task Scheduling in a Grid Environment
inferred← citeshttps://doi.org/10.1109/i-span.2008.35openalex-snapshot
On Non-Approximability of Coarse-Grained Workflow Grid Scheduling
inferred← citeshttps://doi.org/10.1109/icpp.2013.51openalex-snapshot
Handling Uncertainty: Pareto-Efficient BoT Scheduling on Hybrid Clouds
inferred← citeshttps://doi.org/10.1109/icppw.2006.38openalex-snapshot
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
inferred← citeshttps://doi.org/10.1109/saintw.2004.1268711openalex-snapshot
A comparison among grid scheduling algorithms for independent coarse-grained tasks
inferred← citeshttps://doi.org/10.1109/tc.2006.89openalex-snapshot
Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling
inferred← citeshttps://doi.org/10.1109/tc.2007.1042openalex-snapshot
Practical Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience
inferred← citeshttps://doi.org/10.1145/1167350.1167380openalex-snapshot
A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems
inferred← citeshttps://doi.org/10.1145/1186675.1186686openalex-snapshot
A dynamic approach for scheduling dependent tasks on the Xavantes grid middleware
inferred← citeshttps://doi.org/10.1504/ijguc.2011.042947openalex-snapshot
Weight-balanced security-aware scheduling for real-time computational grid
inferred← citeshttps://doi.org/10.47749/t/unicamp.2006.367434openalex-snapshot
Uma heuristica de agrupamento de caminhos para escalonamento de tarefas em grades computacionais
inferred← citeshttps://doi.org/10.47749/t/unicamp.2006.398427openalex-snapshot
Engenharia de trafego multi-camada para grades
inferred← citeshttps://doi.org/10.47749/t/unicamp.2010.771315openalex-snapshot
Algoritmos para escalonamento de tarefas dependentes representadas por grafos acíclicos direcionados em grades computacionais
inferred← citeshttps://doi.org/10.47749/t/unicamp.2017.991387openalex-snapshot
Providing robustness to non-robust workflow schedulers to uncertainties of available bandwidth
inferred← citeshttps://doi.org/10.48550/arxiv.1512.02769openalex-snapshot
Scheduling on Grid with communication Delay
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.