On the public citation graph
Load Balancing of Dynamical Nucleation Theory Monte Carlo Simulations through Resource Sharing Barriers
0 signed · 44 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/978-3-642-24449-0_32openalex-snapshot
Noncollective Communicator Creation in MPI
inferredcites →https://doi.org/10.1007/bfb0097937openalex-snapshot
ARMCI: A portable remote memory copy library for distributed array libraries and compiler run-time systems
inferredcites →https://doi.org/10.1016/j.apnum.2004.08.028openalex-snapshot
New challenges in dynamic load balancing
inferredcites →https://doi.org/10.1016/j.cpc.2010.04.018openalex-snapshot
NWChem: A comprehensive and scalable open-source solution for large scale molecular simulations
inferredcites →https://doi.org/10.1016/j.jpdc.2007.11.002openalex-snapshot
Parallel multilevel algorithms for hypergraph partitioning
inferredcites →https://doi.org/10.1016/s0010-4655(00)00065-5openalex-snapshot
High performance computational chemistry: An overview of NWChem a distributed parallel application
inferredcites →https://doi.org/10.1088/1742-6596/125/1/012017openalex-snapshot
High performance computations using dynamical nucleation theory
inferredcites →https://doi.org/10.1103/physrevlett.82.3484openalex-snapshot
Dynamical Nucleation Theory: A New Molecular Approach to Vapor-Liquid Nucleation
inferredcites →https://doi.org/10.1109/hpdc.2006.1652155openalex-snapshot
Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O
inferredcites →https://doi.org/10.1109/icpp.2008.88openalex-snapshot
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
inferredcites →https://doi.org/10.1109/icpp.2009.56openalex-snapshot
LeWI: A Runtime Balancing Algorithm for Nested Parallelism
inferredcites →https://doi.org/10.1109/ipdps.2009.5161079openalex-snapshot
Work-first and help-first scheduling policies for async-finish task parallelism
inferredcites →https://doi.org/10.1109/ipps.1993.262887openalex-snapshot
A load balancing strategy for prioritized execution of tasks
inferredcites →https://doi.org/10.1109/pact.2005.34openalex-snapshot
Parallel programming and parallel abstractions in Fortress
inferredcites →https://doi.org/10.1109/sc.2006.36openalex-snapshot
Hypergraph Partitioning for Automatic Memory Hierarchy Management
inferredcites →https://doi.org/10.1109/superc.1994.344297openalex-snapshot
Global Arrays: a portable "shared-memory" programming model for distributed memory computers
inferredcites →https://doi.org/10.1109/tpds.2006.112openalex-snapshot
ScalaBLAST: A Scalable Implementation of BLAST for High-Performance Data-Intensive Bioinformatics Analysis
inferredcites →https://doi.org/10.1109/tpds.2008.219openalex-snapshot
An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications
inferredcites →https://doi.org/10.1145/1188455.1188558openalex-snapshot
Data management and query---Hypergraph partitioning for automatic memory hierarchy management
inferredcites →https://doi.org/10.1145/1236463.1236466openalex-snapshot
Using the GA and TAO toolkits for solving large-scale optimization problems on parallel computers
inferredcites →https://doi.org/10.1145/1629911.1630048openalex-snapshot
The Cilk++ concurrency platform
inferredcites →https://doi.org/10.1145/277650.277725openalex-snapshot
The implementation of the Cilk-5 multithreaded language
inferredcites →https://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors
inferredcites →https://doi.org/10.1145/602791.602793openalex-snapshot
Run-time and compile-time support for adaptive irregular problems
inferredcites →https://doi.org/10.1147/rd.411.0171openalex-snapshot
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
inferredcites →https://doi.org/10.1177/1094342006064503openalex-snapshot
Advances, Applications and Performance of the Global Arrays Shared Memory Programming Toolkit
inferredcites →https://doi.org/10.1177/1094342007078442openalex-snapshot
Parallel Programmability and the Chapel Language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119129271.ch7openalex-snapshot
Nucleation Using the Effective Fragment Potential and Two‐Level Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-642-33518-1_11openalex-snapshot
Efficient Multithreaded Context ID Allocation in MPI
inferred← citeshttps://doi.org/10.1109/icpp.2013.12openalex-snapshot
Inspector-Executor Load Balancing Algorithms for Block-Sparse Tensor Contractions
inferred← citeshttps://doi.org/10.1109/icpp.2013.32openalex-snapshot
Expression Tree Evaluation by Dynamic Code Generation - Are Accelerators Up for the Task?
inferred← citeshttps://doi.org/10.1109/ipdps.2016.108openalex-snapshot
A Hartree-Fock Application Using UPC++ and the New DArray Library
inferred← citeshttps://doi.org/10.1145/2464996.2467282openalex-snapshot
Inspector/executor load balancing algorithms for block-sparse tensor contractions
inferred← citeshttps://doi.org/10.1145/2488551.2488561openalex-snapshot
Dataflow coordination of data-parallel tasks via MPI 3.0
inferred← citeshttps://doi.org/10.1145/3545008.3545045openalex-snapshot
Transparent load balancing of MPI programs using OmpSs-2@Cluster and DLB
inferred← citeshttps://doi.org/10.5821/dissertation-2117-108227openalex-snapshot
Dynamic load balancing for hybrid applications
inferred← citeshttps://doi.org/10.5821/dissertation-2117-380814openalex-snapshot
Methodology for malleable applications on distributed memory systems
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.