On the public citation graph

Fast and High Quality Topology-Aware Task Mapping

0 signed · 56 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.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/3-540-61142-8_588openalex-snapshot
Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs
inferredcites →https://doi.org/10.1007/978-3-642-23719-5_40openalex-snapshot
Engineering Multilevel Graph Partitioning Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-32820-6_82openalex-snapshot
Topology-Aware Mappings for Large-Scale Eigenvalue Problems
inferredcites →https://doi.org/10.1016/0305-0548(94)p2435-7openalex-snapshot
Genetic algorithm based heuristics for the mapping problem
inferredcites →https://doi.org/10.1016/j.jpdc.2011.06.005openalex-snapshot
Optimization-based mapping framework for parallel applications
inferredcites →https://doi.org/10.1016/j.jpdc.2014.12.002openalex-snapshot
Hypergraph partitioning for multiple communication cost metrics: Model and methods
inferredcites →https://doi.org/10.1016/j.procs.2012.04.020openalex-snapshot
An Evaluation of Molecular Dynamics Performance on the Hybrid Cray XK6 Supercomputer
inferredcites →https://doi.org/10.1016/s0167-739x(00)00107-2openalex-snapshot
Multilevel mesh partitioning for heterogeneous communication networks
inferredcites →https://doi.org/10.1109/12.76410openalex-snapshot
Heuristic technique for processor and link assignment in multicomputers
inferredcites →https://doi.org/10.1109/92.748202openalex-snapshot
Multilevel hypergraph partitioning: applications in VLSI domain
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1109/hipc.2010.5713190openalex-snapshot
Automated mapping of regular communication graphs on mesh interconnects
inferredcites →https://doi.org/10.1109/hipc.2014.7116706openalex-snapshot
Optimizing the performance of parallel applications on a 5D torus via task mapping
inferredcites →https://doi.org/10.1109/ipdps.2011.340openalex-snapshot
Hierarchical Mapping for HPC Applications
inferredcites →https://doi.org/10.1109/ipdps.2014.15openalex-snapshot
Exploiting Geometric Partitioning in Task Mapping for Parallel Computers
inferredcites →https://doi.org/10.1109/sc.2004.63openalex-snapshot
Unlocking the Performance of the BlueGene/L Supercomputer
inferredcites →https://doi.org/10.1109/sc.2006.63openalex-snapshot
Topology Mapping for Blue Gene/L Supercomputer
inferredcites →https://doi.org/10.1109/sc.2012.75openalex-snapshot
Mapping applications with collectives over sub-communicators on torus networks
inferredcites →https://doi.org/10.1109/tc.1981.1675756openalex-snapshot
On the Mapping Problem
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1089014.1089021openalex-snapshot
An overview of the Trilinos project
inferredcites →https://doi.org/10.1145/1188455.1188502openalex-snapshot
Gordon Bell finalists I---Large-scale electronic structure calculations of high-Z metals on the BlueGene/L platform
inferredcites →https://doi.org/10.1145/1188455.1188576openalex-snapshot
Blue Gene system software---Topology mapping for Blue Gene/L supercomputer
inferredcites →https://doi.org/10.1145/1542275.1542295openalex-snapshot
Dynamic topology aware load balancing algorithms for molecular dynamics applications
inferredcites →https://doi.org/10.1145/1995896.1995909openalex-snapshot
Generic topology mapping strategies for large-scale parallel architectures

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-319-64203-1_27openalex-snapshot
An Efficient Communication Aware Heuristic for Multiple Cloud Application Placement
inferred← citeshttps://doi.org/10.1007/s11227-021-03650-6openalex-snapshot
Mapping techniques in multicore processors: current and future trends
inferred← citeshttps://doi.org/10.1007/s11227-022-04396-5openalex-snapshot
Optimal circulant graphs as low-latency network topologies
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.002openalex-snapshot
Topology and computational-power aware tile mapping of perfectly nested loops with dependencies on distributed systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.013openalex-snapshot
INRFlow: An interconnection networks research flow-level simulation framework
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.12.005openalex-snapshot
PackStealLB: A scalable distributed load balancer based on work stealing and workload discretization
inferred← citeshttps://doi.org/10.1016/j.sysarc.2020.101936openalex-snapshot
Efficient algorithms for task mapping on heterogeneous CPU/GPU platforms for fast completion time
inferred← citeshttps://doi.org/10.1051/e3sconf/202454803006openalex-snapshot
MPI task mapping for multi-cluster HPC systems
inferred← citeshttps://doi.org/10.1109/cahpc.2018.8645953openalex-snapshot
A Batch Task Migration Approach for Decentralized Global Rescheduling
inferred← citeshttps://doi.org/10.1109/candar.2016.0100openalex-snapshot
A Mapping Heuristic for Minimizing Message Latency in Massively Distributed MCTS
inferred← citeshttps://doi.org/10.1109/ccgrid.2016.59openalex-snapshot
Automatic Communication Optimization of Parallel Applications in Public Clouds
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188134openalex-snapshot
Distributed Memory Graph Representation for Load Balancing Data: Accelerating Data Structure Generation for Decentralized Scheduling
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.146openalex-snapshot
PTRAM: A Parallel Topology-and Routing-Aware Mapping Framework for Large-Scale HPC Systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.164openalex-snapshot
Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations
inferred← citeshttps://doi.org/10.1109/pdp50117.2020.00021openalex-snapshot
Adaptive Load Balancing based on Machine Learning for Iterative Parallel Applications
inferred← citeshttps://doi.org/10.1109/tcc.2022.3184081openalex-snapshot
HATS: HetTask Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2019.2900043openalex-snapshot
Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks
inferred← citeshttps://doi.org/10.1145/2851553.2851575openalex-snapshot
Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers
inferred← citeshttps://doi.org/10.1145/3225058.3225117openalex-snapshot
Topology-induced Enhancement of Mappings
inferred← citeshttps://doi.org/10.1145/3309711openalex-snapshot
EagerMap
inferred← citeshttps://doi.org/10.1145/3432261.3432262openalex-snapshot
A Deep Reinforcement Learning Method for Solving Task Mapping Problems with Dynamic Traffic on Parallel Systems
inferred← citeshttps://doi.org/10.1145/3559009.3569657openalex-snapshot
Efficient Task-Mapping of Parallel Applications Using a Space-Filling Curve
inferred← citeshttps://doi.org/10.14569/ijacsa.2018.091045openalex-snapshot
Topology-Aware Mapping Techniques for Heterogeneous HPC Systems: A Systematic Survey
inferred← citeshttps://doi.org/10.15827/0236-235x.140.583-597openalex-snapshot
Программное средство GraphHunter поиска отображения параллельной программы на структуру суперкомпьютерной системы
inferred← citeshttps://doi.org/10.1631/fitee.1900075openalex-snapshot
OHTMA: an optimized heuristic topology-aware mapping algorithm on the Tianhe-3 exascale supercomputer prototype
inferred← citeshttps://doi.org/10.3390/sym13122270openalex-snapshot
ROA-CONS: Raccoon Optimization for Job Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1701.00503openalex-snapshot
Distributed Graph Layout for Scalable Small-world Network Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2005.10413openalex-snapshot
Mapping Matters: Application Process Mapping on 3-D Processor Topologies
inferred← citeshttps://doi.org/10.70675/4bd284f9z97c0z4d18z89cfz340c9216f520openalex-snapshot
On the mapping of distributed applications onto multiple Clouds
inferred← citeshttps://doi.org/10.70675/5559690az1cf0z4119z83c3zc03ef82e2977openalex-snapshot
Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning
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.