Communicating sequential processes
Communicating sequential processes
Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor
IEEE Transactions on Computers
Programming in Occam
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
On Embedding Rectangular Grids in Hypercubes
IEEE Transactions on Computers
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
IEEE Transactions on Computers
The XYZ abstraction levels of Poker-like languages
Selected papers of the second workshop on Languages and compilers for parallel computing
ParaGraph: graph editor support for parallel programming environments
International Journal of Parallel Programming
A static performance estimator to guide data partitioning decisions
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
TIPS: transputer-based interactive parallelizing system
Proceedings of the world transputer user group (WOTUG) conference on Transputing '91
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Heuristic Technique for Processor and Link Assignment in Multicomputers
IEEE Transactions on Computers
Simulating parallel neighboring communications among square meshes and square toruses
The Journal of Supercomputing
Embedding Rectangular Grids Into Square Grids
IEEE Transactions on Computers
The IBM Victor V256 partitionable multiprocessor
IBM Journal of Research and Development
E-kernel on the IBM Victor V256 multiprocessor: an experimental platform for parallel systems
E-kernel on the IBM Victor V256 multiprocessor: an experimental platform for parallel systems
Multi-way graph partition by stochastic probe
Computers and Operations Research
Embeddings among meshes and tori
Journal of Parallel and Distributed Computing
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM (JACM)
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Embedding Grids into Hypercubes
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Mapping parallel programs onto parallel systems with torus and mesh-based communication structures
Mapping parallel programs onto parallel systems with torus and mesh-based communication structures
Hi-index | 0.00 |
We present the design of E-kernel, an embedding kernel on the Victor V256message-passing partitionable multiprocessor, developed for the support of programmapping and network reconfiguration. E-kernel supports the embedding of a new network topology onto Victor's 2D mesh and also the embedding of a task graph onto the 2D mesh network or the reconfigured network. In the current implementation, the reconfigured network can be a line or an even-size ring, and the task graphs meshes or tori of a variety of dimensions and shapes or graphs with similar topologies. For application programs having these task graph topologies and that are designed according to the communication model of E-kernel, they can be run without any change on partitions connected by the 2D mesh, line, or ring. Further, E-kernel attempts the communication optimization of these programs on the different networks automatically, thus making both the network topology and the communication optimization attempt completely transparent to the application programs. Many of the embeddings used in E-kernel are optimal or asymptotically optimal (with respect to minimum dilation cost). Theimplementation of E-kernel translated some of the many theoretical results in graphembeddings into practical tools for program mapping and network reconfiguration in aparallel system. E-kernel is functional on Victor V256. Measurements of E-kernel'sperformance on V256 are also included.