On the public citation graph
A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms
0 signed · 67 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/0470867167.ch33openalex-snapshot
Parameter Sweeps on the Grid with APST
inferredcites →https://doi.org/10.1006/jagm.1999.1047openalex-snapshot
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
inferredcites →https://doi.org/10.1006/jpdc.1997.1413openalex-snapshot
Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs
inferredcites →https://doi.org/10.1006/jpdc.1999.1596openalex-snapshot
Optimal Use of Mixed Task and Data Parallelism for Pipelined Computations
inferredcites →https://doi.org/10.1006/jpdc.2000.1714openalex-snapshot
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
inferredcites →https://doi.org/10.1006/jpdc.2001.1778openalex-snapshot
Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks
inferredcites →https://doi.org/10.1007/978-3-642-58412-1openalex-snapshot
Complexity and Approximation
inferredcites →https://doi.org/10.1016/s0167-739x(01)00070-xopenalex-snapshot
Optimizing execution of component-based applications using group instances
inferredcites →https://doi.org/10.1016/s0167-8191(03)00095-4openalex-snapshot
Scheduling divisible workloads on heterogeneous platforms
inferredcites →https://doi.org/10.1023/a:1020902731238openalex-snapshot
Foreword (Special Issue of Cluster Computing on Divisible Load Scheduling)
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.1109/12.324544openalex-snapshot
Closed form solutions for bus and tree networks of processors load sharing a divisible job
inferredcites →https://doi.org/10.1109/4434.708258openalex-snapshot
Approaches for integrating task and data parallelism
inferredcites →https://doi.org/10.1109/7.259524openalex-snapshot
Processor equivalence for daisy chain load sharing processors
inferredcites →https://doi.org/10.1109/71.642945openalex-snapshot
A framework for exploiting task and data parallelism on distributed memory multicomputers
inferredcites →https://doi.org/10.1109/71.679214openalex-snapshot
Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees
inferredcites →https://doi.org/10.1109/ccgrid.2003.1199362openalex-snapshot
Scheduling distributed applications: the SimGrid simulation framework
inferredcites →https://doi.org/10.1109/ipdps.2004.1303169openalex-snapshot
Modeling large-scale platforms for the analysis and the simulation of scheduling strategies
inferredcites →https://doi.org/10.1109/ipdps.2005.63openalex-snapshot
A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms
inferredcites →https://doi.org/10.1109/mc.2003.1198238openalex-snapshot
Research feature - Ten reasons to use divisible load theory
inferredcites →https://doi.org/10.1109/sc.2002.10015openalex-snapshot
Executing Multiple Pipelined Data Analysis Operations in the Grid
inferredcites →https://doi.org/10.1109/tpds.2004.1271181openalex-snapshot
Scheduling strategies for master-slave tasking on heterogeneous processor platforms
inferredcites →https://doi.org/10.1109/tpds.2005.35openalex-snapshot
Scheduling divisible loads on star and tree networks: results and open problems
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
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.1007/978-3-540-68111-3_111openalex-snapshot
Scheduling in Multi-organization Grids: Measuring the Inefficiency of Decentralization
inferred← citeshttps://doi.org/10.1007/978-3-642-35398-7_12openalex-snapshot
Study on Data High Availability in Data Grid Based on Optimization
inferred← citeshttps://doi.org/10.1007/978-3-7643-8864-5_11openalex-snapshot
A Framework for QoS-based Resource Brokering in Grid Computing
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.1007/s11227-006-0036-xopenalex-snapshot
Dimensioning and on-line scheduling in Lambda Grids using divisible load concepts
inferred← citeshttps://doi.org/10.1007/s11235-008-9101-5openalex-snapshot
Grid job scheduling using Route with Genetic Algorithm support
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.08.032openalex-snapshot
Scheduling big data applications within advance reservation framework in optical grids
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.046openalex-snapshot
Grid scheduling divisible loads from two sources
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.06.067openalex-snapshot
Promoting cooperation in selfish computational grids
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.022openalex-snapshot
TSP Race: Minimizing completion time in time-sensitive applications
inferred← citeshttps://doi.org/10.1016/j.future.2007.08.003openalex-snapshot
Scalable dimensioning of resilient Lambda Grids
inferred← citeshttps://doi.org/10.1109/aina.2007.125openalex-snapshot
RouteGA: A Grid Load Balancing Algorithm with Genetic Support
inferred← citeshttps://doi.org/10.1109/ccgrid.2007.52openalex-snapshot
Fair Game-Theoretic Resource Management in Dedicated Grids
inferred← citeshttps://doi.org/10.1109/cesys.2018.8723950openalex-snapshot
A Survey on Edge Computing Using IOT Systems
inferred← citeshttps://doi.org/10.1109/chinacom.2006.344924openalex-snapshot
A Resource Scheduling Algorithm Based on Division Load Theory for Parallel and Distributed Applications in Optical Grid
inferred← citeshttps://doi.org/10.1109/ciss.2006.286459openalex-snapshot
Multi-Source Grid Scheduling for Divisible Loads
inferred← citeshttps://doi.org/10.1109/clustr.2008.4663779openalex-snapshot
Divisible load scheduling with improved asymptotic optimality
inferred← citeshttps://doi.org/10.1109/e-science.2007.9openalex-snapshot
A Time and Cost-Based Matching Strategy for Data Parallelizable Tasks of Grid Workflows
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683835openalex-snapshot
Co-Scheduling Computational and Networking Resources in E-Science Optical Grids
inferred← citeshttps://doi.org/10.1109/hpcc.2011.62openalex-snapshot
Towards Network-Aware Divisible Load Theory for Optical Grids
inferred← citeshttps://doi.org/10.1109/iacsit-sc.2009.54openalex-snapshot
Categorizing Researches about DLT in Ten Groups
inferred← citeshttps://doi.org/10.1109/icacte.2008.123openalex-snapshot
Optimal Algorithm for Task Scheduling of Distributed Test & Control System
inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234841openalex-snapshot
Efficient algorithm for scheduling of periodic tasks in homogeneous distributed test&control system
inferred← citeshttps://doi.org/10.1109/icpads.2006.24openalex-snapshot
An accurate communication model of a heterogeneous cluster based on a switch-enabled Ethernet network
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370574openalex-snapshot
A Performance Model of Many-to-One Collective Communications for Parallel Computing
inferred← citeshttps://doi.org/10.1109/jsyst.2008.2011299openalex-snapshot
Time and Cost-Driven Scheduling of Data Parallel Tasks in Grid Workflows
inferred← citeshttps://doi.org/10.1109/ofc.2005.192680openalex-snapshot
Using divisible load theory to dimension optical transport networks for computational grids
inferred← citeshttps://doi.org/10.1109/pdp.2007.12openalex-snapshot
A Performance Model for Stream-based Computations
inferred← citeshttps://doi.org/10.1109/pdp.2007.73openalex-snapshot
Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1109/sbac-pad.2008.26openalex-snapshot
On Simulated Annealing for the Scheduling of Parallel Applications
inferred← citeshttps://doi.org/10.1109/tc.2015.2389843openalex-snapshot
Scheduling Divisible Loads in Gaussian, Mesh and Torus Network of Processors
inferred← citeshttps://doi.org/10.1109/tpds.2007.1073openalex-snapshot
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
inferred← citeshttps://doi.org/10.1142/s0129054105002929openalex-snapshot
NETWORK MODELING ISSUES FOR GRID APPLICATION SCHEDULING
inferred← citeshttps://doi.org/10.1142/s0129626421500134openalex-snapshot
Optimizing Data Intensive Flows for Networks on Chips
inferred← citeshttps://doi.org/10.1155/2014/460354openalex-snapshot
Comprehensive Review on Divisible Load Theory: Concepts, Strategies, and Approaches
inferred← citeshttps://doi.org/10.1177/1094342006061879openalex-snapshot
Scheduling Multiple Divisible Loads
inferred← citeshttps://doi.org/10.1504/ijcse.2014.058701openalex-snapshot
Multi-source task scheduling in grid computing environment using linear programming
inferred← citeshttps://doi.org/10.48550/arxiv.1806.05701openalex-snapshot
Computation-Aware Data Aggregation
inferred← citeshttps://doi.org/10.5121/ijgca.2012.3201openalex-snapshot
Load Balancing in Optical Grids
showing the first 40 of 41 · page through all 41
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.