On the public citation graph

Design and Analysis of a Dynamic Scheduling Strategy with Resource Estimation for Large-Scale Grid Systems

0 signed · 25 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.1023/a:1020915000287openalex-snapshot
A Novel Optimal Load Distribution Algorithm for Divisible Loads
inferredcites →https://doi.org/10.1023/a:1020958815308openalex-snapshot
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems
inferredcites →https://doi.org/10.1023/a:1020971118034openalex-snapshot
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks
inferredcites →https://doi.org/10.1109/7.705897openalex-snapshot
Optimal time-varying load sharing for divisible loads
inferredcites →https://doi.org/10.1109/7.892677openalex-snapshot
Divisible load scheduling on single-level tree networks with buffer constraints
inferredcites →https://doi.org/10.1109/clustr.2001.959961openalex-snapshot
Sharing partitionable workloads in heterogeneous NOWs: greedier is not better
inferredcites →https://doi.org/10.1109/mc.2003.1198238openalex-snapshot
Research feature - Ten reasons to use divisible load theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11596981_68openalex-snapshot
A Scheduling Algorithm Based on a Trust Mechanism in Grid
inferred← citeshttps://doi.org/10.1007/978-3-540-76778-7_7openalex-snapshot
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-00405-6_15openalex-snapshot
Priority-Based Job Scheduling in Distributed Systems
inferred← citeshttps://doi.org/10.1007/s10586-009-0103-1openalex-snapshot
PPDD: scheduling multi-site divisible loads in single-level tree networks
inferred← citeshttps://doi.org/10.1109/cccm.2008.285openalex-snapshot
A New Resource Management and Scheduling Model in Grid Computing Based on a Hybrid Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/cesys.2018.8723950openalex-snapshot
A Survey on Edge Computing Using IOT Systems
inferred← citeshttps://doi.org/10.1109/csse.2008.1548openalex-snapshot
Scheduling Strategy in Parallel Applications Based on Ant Colony Optimization
inferred← citeshttps://doi.org/10.1109/iacsit-sc.2009.54openalex-snapshot
Categorizing Researches about DLT in Ten Groups
inferred← citeshttps://doi.org/10.1109/icoci.2006.5276564openalex-snapshot
A novel load balancing method in an agent-based grid
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/imsaa.2009.5439445openalex-snapshot
Novel adaptive scheduling algorithm for computational grid
inferred← citeshttps://doi.org/10.1109/pdcat.2005.212openalex-snapshot
Security-Driven Scheduling Algorithms Based on EigenTrust in Grid
inferred← citeshttps://doi.org/10.1109/tcc.2016.2586048openalex-snapshot
Stochastic Workload Scheduling for Uncoordinated Datacenter Clouds with Multiple QoS Constraints
inferred← citeshttps://doi.org/10.1109/tpds.2012.88openalex-snapshot
Supporting HPC Analytics Applications with Access Patterns Using Data Restructuring and Data-Centric Scheduling Techniques in MapReduce
inferred← citeshttps://doi.org/10.1109/wicom.2008.1363openalex-snapshot
Research on Scheduling Strategy in Parallel Applications Based on a Hybrid Genetic Algorithm
inferred← citeshttps://doi.org/10.1145/1146847.1146855openalex-snapshot
Scheduling divisible loads in the dynamic heterogeneous grid environment
inferred← citeshttps://doi.org/10.1145/1529974.1529986openalex-snapshot
Efficient on-demand operations in dynamic distributed infrastructures
inferred← citeshttps://doi.org/10.5555/1516124.1516134openalex-snapshot
New worker-centric scheduling strategies for data-intensive grid applications
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.