Mapping virtual processes onto physical processos is one of the most important issues in
parallel computing. The problem of mapping of processes/tasks onto processors is …

This introduction to networking large scale parallel computer systems acts as a primary
resource for a wide readership, including network systems engineers, electronics engineers …

Various network topologies can be used for deploying High Performance Computing (HPC)
clusters. The network topology, which connects switches In cabinets on a machine room …

In this paper, a deterministic algorithm for dynamically embedding binary trees into next to
optimal hypercubes is presented. Due to a known lower bound, any such algorithm must use …

The paper presents novel embeddings of various classical topologies into the OPAM
multicomputer. OPAM consists of a large number of processors that are connected by a two …

Embeddings of various graph classes into hypercubes have been widely studied. Almost all
these classes are regularly structured graphs such as meshes, complete trees or pyramids …

This paper explores one-to-one embeddings of 2-dimensional grids into hypercubes. It is
shown that each 2-dimensional grid can be embedded with edge-congestion 2 into its …

In this paper, we present a one-to-one embedding of a graph with bounded treewidth into its
optimal hypercube. This is the first time that embeddings of graphs with a highly irregular …

Embedding one parallel architecture into another is very important in the area of parallel
processing because parallel architectures can vary widely. Given a pyramid architecture of …

In this paper, a deterministic algorithm for dynamically embedding binary trees into
hypercubes is presented. Because of a known lower bound, any such algorithm must use …