scientific article; zbMATH DE number 279005

zbMATH Open0798.68064MaRDI QIDQ5289224FDOQ5289224

Authors: O. G. Monakhov 

Publication date: 2 September 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1432332
• Mapping parallel programs onto multicore computers by recurrent neural networks
• ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES
• Efficient algorithms for mapping and partitioning a class of parallel computations

zbMATH Keywords

parallel computersparallel mappingparallel program graphs

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cited In (27)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Eigenanalysis-based task mapping on parallel computers with cellular networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• A layered method for process and code mapping
• Mapping parallel programs onto multicore computers by recurrent neural networks
• Title not available (Why is that?)
• On mapping processes to processors in distributed systems
• Multi-dimensional parallelization considering conditions of data localization
• Map-Reduce process algebra: a formalism to describe directed acyclic graph task-based jobs in parallel environments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the mapping of massively parallel processors onto finite element graphs
• Title not available (Why is that?)
• An architecture-independent graphical tool for automatic contention-free process-to-processor mapping
• Title not available (Why is that?)
• Input mapping algorithm for parallel transistor structures
• On mapping graphs of parallel programs onto graphs of distributed computer systems by recurrent neural networks
• An MPI-based algorithm for mapping complex networks onto hierarchical architectures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel mapping of sparse computations
• Mapping parallel programs to multiprocessors: A dynamic approach
• Efficient algorithms for mapping and partitioning a class of parallel computations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289224)