On the public citation graph
Scheduling parallel applications using malleable tasks on clusters
0 signed · 38 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.1007/3-540-44676-1_12openalex-snapshot
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
inferredcites →https://doi.org/10.1007/3-540-44681-8_29openalex-snapshot
Approximation Algorithms for Scheduling Independent Malleable Tasks
inferredcites →https://doi.org/10.1007/3-540-48311-x_39openalex-snapshot
Dynamic Load Balancing for Ocean Circulation Model with Adaptive Meshing
inferredcites →https://doi.org/10.1007/978-3-540-46642-0_38openalex-snapshot
Parallel Real Root Isolation Using the Descartes Method
inferredcites →https://doi.org/10.1016/0166-218x(87)90042-4openalex-snapshot
UET scheduling with unit interprocessor communication delays
inferredcites →https://doi.org/10.1016/0167-6377(94)90024-8openalex-snapshot
Three, four, five, six, or the complexity of scheduling with communication delays
inferredcites →https://doi.org/10.1016/0377-2217(96)00124-5openalex-snapshot
On the complexity of scheduling with large communication delays
inferredcites →https://doi.org/10.1016/s0377-2217(02)00264-3openalex-snapshot
An approximation algorithm for scheduling trees of malleable tasks
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1137/0209062openalex-snapshot
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
inferredcites →https://doi.org/10.1137/0402042openalex-snapshot
Complexity of Scheduling Parallel Task Systems
inferredcites →https://doi.org/10.1137/s0097539793255801openalex-snapshot
A Strip-Packing Algorithm with Absolute Performance Bound 2
inferredcites →https://doi.org/10.1142/s0129054102001308openalex-snapshot
APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
inferredcites →https://doi.org/10.1145/140901.141909openalex-snapshot
Approximate algorithms scheduling parallelizable tasks
inferredcites →https://doi.org/10.1145/167088.167254openalex-snapshot
Optimal online scheduling of parallel jobs with dependencies
inferredcites →https://doi.org/10.1145/258533.258570openalex-snapshot
Optimal time-critical scheduling via resource augmentation (extended abstract)
inferredcites →https://doi.org/10.1145/305619.305622openalex-snapshot
Efficient approximation algorithms for scheduling malleable tasks
inferredcites →https://doi.org/10.1145/378580.378640openalex-snapshot
Scheduling on hierarchical clusters using malleable tasks
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.13053/cys-4-2-938openalex-snapshot
Schedulling Malleable Task with Convex Processing Speed Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11752578_106openalex-snapshot
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
inferred← citeshttps://doi.org/10.1007/978-3-540-92859-1_13openalex-snapshot
A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters
inferred← citeshttps://doi.org/10.1007/978-94-007-2792-2_74openalex-snapshot
Scheduling DAGs with Parallel Tasks in Multi-Clusters Based on Parallel Efficiency
inferred← citeshttps://doi.org/10.1016/j.future.2018.11.012openalex-snapshot
Improving task scheduling with parallelism awareness in heterogeneous computational environments
inferred← citeshttps://doi.org/10.1016/j.parco.2010.12.004openalex-snapshot
Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters
inferred← citeshttps://doi.org/10.1051/ro/2014048openalex-snapshot
Scheduling 2-dimensional grids with large communication delays
inferred← citeshttps://doi.org/10.1109/cloudtech.2016.7847717openalex-snapshot
Multi-criteria malleable task management for hybrid-cloud platforms
inferred← citeshttps://doi.org/10.1109/clustr.2005.347020openalex-snapshot
A Poly-Algorithm for Efficient Parallel Matrix Multiplication on Metacomputing Platforms
inferred← citeshttps://doi.org/10.1109/clustr.2005.347024openalex-snapshot
Static scheduling of dependent parallel tasks on heterogeneous clusters
inferred← citeshttps://doi.org/10.1109/clustr.2006.311861openalex-snapshot
Locality Conscious Processor Allocation and Scheduling for Mixed Parallel Applications
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.123openalex-snapshot
Handling Heterogeneity for Efficient Implementations: A Case Study on Sequence Comparison
inferred← citeshttps://doi.org/10.1109/ispdc.2009.19openalex-snapshot
Dynamic Job Scheduling on Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1109/parelec.2004.44openalex-snapshot
Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly
inferred← citeshttps://doi.org/10.1109/pcee.2004.44openalex-snapshot
Moldable Task Scheduling in Dynamic SMP Clusters with Communication on the Fly
inferred← citeshttps://doi.org/10.1109/rtss.2009.42openalex-snapshot
Gang EDF Scheduling of Parallel Task Systems
inferred← citeshttps://doi.org/10.1109/tc.2013.115openalex-snapshot
Task Scheduling on Adaptive Multi-Core
inferred← citeshttps://doi.org/10.3166/tsi.31.1021-1047openalex-snapshot
Les riches heures de l’ordonnancement
inferred← citeshttps://doi.org/10.48550/arxiv.1609.08588openalex-snapshot
Efficient Algorithms for Scheduling Moldable Tasks
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.