𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On partitioning and mapping for hypercube computing

✍ Scribed by Lionel M. Ni; Chung-Ta King

Publisher
Springer
Year
1988
Tongue
English
Weight
945 KB
Volume
17
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ring, torus and hypercube architectures/
Ring, torus and hypercube architectures/algorithms for parallel computing
✍ S. Lakshmivarahan; Sudarshan K. Dhall πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 371 KB

This paper provides a survey of both architectural and algorithmic aspects of solving problems using parallel processors with ring, torus and hypercube interconnection.

State assignment based on two-dimensiona
State assignment based on two-dimensional placement and hypercube mapping
✍ S. Liu; M. Pedram; A.M. Despain πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1019 KB

This paper addresses the problem of state assignment for finite-state machines (FSM). This is an important problem in digital system design where added functionality often comes at the expense of a larger (and slower) FSM to control the system. We present a new scheme to solve the graph embedding pr

Graph partitioning based methods and too
Graph partitioning based methods and tools for scientific computing
✍ FranΓ§ois Pellegrini πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 881 KB

The combinatorial optimization problem of assigning the communicating coexisting processes of a parallel program onto a parallel machine so as to minimize its overall execution time is called static mapping. This paper presents the work that has been carried out to date at the LaBRI on static mappin