Process mapping on any topology with TopoMatch

نویسندگان

چکیده

Process mapping (or process placement) is a useful algorithmic technique to optimize the way applications are launched and executed onto parallel machine. By taking into account topology of machine affinity between processes, helps reducing communication time whole application. Here, we present TopoMatch, generic versatile library algorithm address placement problem. We describe its features characteristics, report different use-cases that benefit from this tool. also study impact factors: sparsity input matrix, trade-off speed quality procedure as well uncertainty (noise) input.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lectures on Controlled Topology: Mapping Cylinder Neighborhoods

The existence theorem for mapping cylinder neighborhoods is discussed as a prototypical example of controlled topology and its applications. The first of a projected series developed from lectures at the Summer School on High-Dimensional Topology, Trieste Italy 2001

متن کامل

Analysis of Axisymmetric Extrusion Process through Dies of any Shape with General Shear Boundaries

In this paper, a generalized expression for the flow field in axisymmetric extrusion process is suggested to be valid for any dies and the boundary shapes of the plastic deformation zone. The general power terms are derived and the extrusion force is calculated by applying upper bound technique for a streamlined die shape and exponential functions for shear boundaries. It is shown that assuming...

متن کامل

Mapping Process

Images formed by a human face change with viewpoint. A new technique is described for synthesizing images of faces from new viewpoints, when only a single 2D image is available. A novel 2D image of a face can be computed without knowledge about the 3D structure of the head. The technique draws on a single generic 3D model of a human head and on prior knowledge of faces based on example images o...

متن کامل

Almost Decouplability of any Directed Weighted Network Topology

This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form being composed of uncoupled vertices, and thus reduce the complexity of analysis for networked dynamical systems. As an example of its application, the consensus problem of linear multi-agent systems with time-varying network topologi...

متن کامل

The TorchLight Tool: Analyzing Search Topology Without Running Any Search

The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work [Hoffmann, JAIR’05], it was observed that the optimal relaxation heuristic h has amazing qualities in many classical planning benchmarks, in particular pertaining to the complete absence of local minima. The proofs of this are hand-made, raising the question whether such pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 2022

ISSN: ['1096-0848', '0743-7315']

DOI: https://doi.org/10.1016/j.jpdc.2022.08.002