On the public citation graph

Dynamic multi phase scheduling for heterogeneous clusters

0 signed · 46 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.1007/3-540-44587-0_14openalex-snapshot
Defining and Supporting Pipelined Executions in OpenMP
inferredcites →https://doi.org/10.1007/3-540-44864-0_112openalex-snapshot
A Parallel Loop Self-Scheduling on Extremely Heterogeneous PC Clusters
inferredcites →https://doi.org/10.1016/s0167-8191(02)00223-5openalex-snapshot
Optimal task scheduling at run time to exploit intra-tile parallelism
inferredcites →https://doi.org/10.1023/a:1023588520138openalex-snapshot
On the Scalability of Dynamic Scheduling Scientific Applications with Adaptive Weighted Factoring
inferredcites →https://doi.org/10.1109/71.205655openalex-snapshot
Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers
inferredcites →https://doi.org/10.1109/71.273046openalex-snapshot
Using processor affinity in loop scheduling on shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/71.569656openalex-snapshot
Adaptively scheduling parallel loops in distributed shared-memory systems
inferredcites →https://doi.org/10.1109/71.914756openalex-snapshot
Exploiting wavefront parallelism on large-scale shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/71.940749openalex-snapshot
An efficient adaptive scheduling scheme for distributed memory multicomputers
inferredcites →https://doi.org/10.1109/clustr.2002.1137768openalex-snapshot
Compiling tiled iteration spaces for clusters
inferredcites →https://doi.org/10.1109/hcw.2000.843740openalex-snapshot
Linear algebra algorithms in a heterogeneous cluster of personal computers
inferredcites →https://doi.org/10.1109/hpdc.1995.518697openalex-snapshot
Loop scheduling for heterogeneity
inferredcites →https://doi.org/10.1109/icpp.1996.538574openalex-snapshot
Load balancing for parallel loops in workstation clusters
inferredcites →https://doi.org/10.1109/icpp.2003.1240576openalex-snapshot
Exploiting pipelined executions in OpenMP
inferredcites →https://doi.org/10.1109/icppw.2000.869118openalex-snapshot
An investigation of feedback guided dynamic scheduling of nested loops
inferredcites →https://doi.org/10.1109/ipdps.2001.924976openalex-snapshot
Minimizing completion time for loop tiling with computation and communication overlapping
inferredcites →https://doi.org/10.1109/ispan.2005.40openalex-snapshot
Dynamic Scheduling of Nested Loops with Uniform Dependencies in Heterogeneous Networks ofWorkstations
inferredcites →https://doi.org/10.1109/nca.2005.43openalex-snapshot
Reducing the Communication Cost via Chain Pattern Scheduling
inferredcites →https://doi.org/10.1109/tc.1987.5009495openalex-snapshot
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
inferredcites →https://doi.org/10.1109/tse.1985.231547openalex-snapshot
Allocating Independent Subtasks on Parallel Processors
inferredcites →https://doi.org/10.1142/s0129626499000207openalex-snapshot
ALGORITHMIC ISSUES ON HETEROGENEOUS COMPUTING PLATFORMS
inferredcites →https://doi.org/10.1145/237502.237576openalex-snapshot
Load-sharing in heterogeneous systems via weighted factoring
inferredcites →https://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors

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.2812openalex-snapshot
Towards the optimal synchronization granularity for dynamic scheduling of pipelined computations on heterogeneous computing systems
inferred← citeshttps://doi.org/10.1002/cpe.3976openalex-snapshot
3‐D data partitioning for 3‐level perfectly nested loops on heterogeneous distributed systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74442-9_3openalex-snapshot
A Flexible General-Purpose Parallelizing Architecture for Nested Loops in Reconfigurable Platforms
inferred← citeshttps://doi.org/10.1007/s10766-016-0434-5openalex-snapshot
Scalable Loop Self-Scheduling Schemes for Large-Scale Clusters and Cloud Systems
inferred← citeshttps://doi.org/10.1016/j.future.2008.12.003openalex-snapshot
Derivation of self-scheduling algorithms for heterogeneous distributed computer systems: Application to internet-based grids of computers
inferred← citeshttps://doi.org/10.1016/j.parco.2011.01.003openalex-snapshot
Distributed dynamic load balancing for pipelined computations on heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.peva.2010.08.020openalex-snapshot
Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems
inferred← citeshttps://doi.org/10.1109/cluster.2018.00077openalex-snapshot
Towards a Mini-App for Smoothed Particle Hydrodynamics at Exascale
inferred← citeshttps://doi.org/10.1109/clustr.2006.311912openalex-snapshot
Self-Adapting Scheduling for Tasks with Dependencies in Stochastic Environments
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629237openalex-snapshot
Multi-dimensional dynamic loop scheduling algorithms
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629240openalex-snapshot
An optimal scheduling scheme for tiling in distributed systems
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629257openalex-snapshot
Optimal synchronization frequency for dynamic pipelined computations on heterogeneous systems
inferred← citeshttps://doi.org/10.1109/hipc.2011.6152724openalex-snapshot
A dynamic scheduling framework for emerging heterogeneous systems
inferred← citeshttps://doi.org/10.1109/icecet61485.2024.10698152openalex-snapshot
Designing a Naturalistic Driving Situation Extraction Method to Improve the Learning Process of Automated Driving Technology
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.104openalex-snapshot
Distributed Loop Scheduling Schemes for Cloud Systems
inferred← citeshttps://doi.org/10.1109/pact.2007.4336231openalex-snapshot
Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems
inferred← citeshttps://doi.org/10.1109/sies.2008.4577675openalex-snapshot
Implementation of dynamic loop scheduling in reconfigurable platforms
inferred← citeshttps://doi.org/10.1109/synasc.2014.54openalex-snapshot
Load Scheduling in a Cloud Based Massive Video-Storage Environment
inferred← citeshttps://doi.org/10.11606/t.3.2016.tde-29112016-085713openalex-snapshot
Uma metodologia para desenvolvimento de programas paralelos eficientes em ambientes homogêneos e heterogêneos.
inferred← citeshttps://doi.org/10.11606/t.3.2018.tde-22052018-134742openalex-snapshot
Metodologia e ferramentas para paralelização de laços perfeitamente aninhados com processamento heterogêneo.
inferred← citeshttps://doi.org/10.12694/scpe.v17i4.1205openalex-snapshot
Tiling and Scheduling of Three-level Perfectly Nested Loops with Dependencies on Heterogeneous Systems
inferred← citeshttps://doi.org/10.14569/ijacsa.2010.010302openalex-snapshot
Multiphase Scalable Grid Scheduler Based on Multi-QoS Using Min-Min Heuristic
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1764openalex-snapshot
Semi-Dynamic Multiprocessor Scheduling with an Asymptotically Optimal Performance Ratio
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.