On the public citation graph
Scheduling Moldable BSP Tasks
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.1002/cpe.4330020404openalex-snapshot
PVM: A framework for parallel distributed computing
inferredcites →https://doi.org/10.1006/jpdc.2001.1735openalex-snapshot
JBSP: A BSP Programming Library in Java
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-44860-8openalex-snapshot
Computational Science — ICCS 2003
inferredcites →https://doi.org/10.1007/3-540-44860-8_23openalex-snapshot
A Parallel Programming Environment on Grid
inferredcites →https://doi.org/10.1016/0167-8191(96)00024-5openalex-snapshot
A high-performance, portable implementation of the MPI message passing interface standard
inferredcites →https://doi.org/10.1016/s0167-8191(02)00218-1openalex-snapshot
The Paderborn University BSP (PUB) library
inferredcites →https://doi.org/10.1016/s0167-8191(98)00093-3openalex-snapshot
BSPlib: The BSP programming library
inferredcites →https://doi.org/10.1109/71.932708openalex-snapshot
Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling
inferredcites →https://doi.org/10.1109/ipdps.2001.925004openalex-snapshot
A model for moldable supercomputer jobs
inferredcites →https://doi.org/10.1109/ipps.1999.760442openalex-snapshot
The Paderborn university BSP (PUB) library-design, implementation and performance
inferredcites →https://doi.org/10.1137/0209062openalex-snapshot
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
inferredcites →https://doi.org/10.1137/0209064openalex-snapshot
Orthogonal Packings in Two Dimensions
inferredcites →https://doi.org/10.1137/s0097539701385995openalex-snapshot
A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
inferredcites →https://doi.org/10.1137/s0097539793255801openalex-snapshot
A Strip-Packing Algorithm with Absolute Performance Bound 2
inferredcites →https://doi.org/10.1145/1028493openalex-snapshot
Proceedings of the 2nd workshop on Middleware for grid computing -
inferredcites →https://doi.org/10.1145/1028493.1028499openalex-snapshot
Checkpointing-based rollback recovery for parallel applications on the InteGrade grid middleware
inferredcites →https://doi.org/10.1145/140901.141909openalex-snapshot
Approximate algorithms scheduling parallelizable tasks
inferredcites →https://doi.org/10.1145/305619.305622openalex-snapshot
Efficient approximation algorithms for scheduling malleable tasks
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
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.3350openalex-snapshot
Using a sparse promoting method in linear programming approximations to schedule parallel jobs
inferred← citeshttps://doi.org/10.1007/11549468_35openalex-snapshot
Hierarchical Scheduling for Moldable Tasks
inferred← citeshttps://doi.org/10.1007/978-3-030-88224-2_8openalex-snapshot
Performance-Cost Optimization of Moldable Scientific Workflows
inferred← citeshttps://doi.org/10.1007/978-3-031-22698-4_8openalex-snapshot
Optimization of Execution Parameters of Moldable Ultrasound Workflows Under Incomplete Performance Data
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_14openalex-snapshot
Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.08.002openalex-snapshot
Scheduling in distributed systems: A cloud computing perspective
inferred← citeshttps://doi.org/10.1109/cec60901.2024.10611947openalex-snapshot
Prediction of Distributed Ultrasound Simulation Execution Time Using Machine Learning
inferred← citeshttps://doi.org/10.1109/cisis.2009.203openalex-snapshot
Job Scheduler Parameter Analysis to Find an Optimal Parameter Configuration
inferred← citeshttps://doi.org/10.1109/icicic.2008.416openalex-snapshot
Parameter Optimization of Job Scheduler Based on NQS Simulator
inferred← citeshttps://doi.org/10.1109/ispdc.2011.15openalex-snapshot
Using Virtualization and Job Folding for Batch Scheduling
inferred← citeshttps://doi.org/10.1109/ispdc55340.2022.00017openalex-snapshot
A scalable algorithm for homomorphic computing on multi-core clusters
inferred← citeshttps://doi.org/10.1109/pdp.2009.34openalex-snapshot
Job Scheduler Parameter Analysis for Evaluation of Effectiveness
inferred← citeshttps://doi.org/10.1109/pdp.2014.83openalex-snapshot
An Experimental Analysis for Hardware Resource Management Using a New Strip Packing Problem
inferred← citeshttps://doi.org/10.1145/1101499.1101504openalex-snapshot
The implementation of the BSP parallel computing model on the InteGrade Grid middleware
inferred← citeshttps://doi.org/10.5753/sbrc.2018.2491openalex-snapshot
Processamento Distribuído de Grafos: Modelagem de Desempenho e Escalonamento de Tarefas Moldáveis
inferred← citeshttps://doi.org/10.5753/wscad.2015.14279openalex-snapshot
Scheduling Moldable BSP Tasks on Clouds
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.