Add to ORKGThis paper investigates the merits of message routing hardware (as proposed within the PUMA project [3]) for the implementation of Newton’s method for unconstrained optimisation on a local mem-ory MIMD Transputer-based architecture. The performance of such an architecture is predicted, and compared with the performance of current Transputer architectures.
The orchestration of communication of distributed memory parallel applications on a parallel compute...
textabstractIn this paper we give a classification of parallel branch and bound algorithms and devel...
This thesis investigates and develops dynamic load-balancing mechanisms on distributed-memory MIMD m...
This paper presents an overview of parallel algorithms for unconstrained optimisation. The suitabili...
AbstractIn this paper, we survey many of the approaches that have been proposed for solving communic...
Efficient data motion has been critical in high performance computing for as long as computers have ...
In this Thesis the design and analysis of parallel algorithms is investigated under the framework of...
The routing problem of VLSI layout design is computationally very expensive because of the inherent ...
104 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.Using the Message Passing Int...
In this paper, we propose three different parallel algorithms based on a state-of-the-art global rou...
SIGLEAvailable from British Library Document Supply Centre- DSC:0678.231F(AD-A--193940)(microfiche) ...
Working out the best route for a land vehicle to take from its current position to a certain destina...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Data parallel programming provides a simple and powerful framework for designing parallel algorithms...
The orchestration of communication of distributed memory parallel applications on a parallel compute...
textabstractIn this paper we give a classification of parallel branch and bound algorithms and devel...
This thesis investigates and develops dynamic load-balancing mechanisms on distributed-memory MIMD m...
This paper presents an overview of parallel algorithms for unconstrained optimisation. The suitabili...
AbstractIn this paper, we survey many of the approaches that have been proposed for solving communic...
Efficient data motion has been critical in high performance computing for as long as computers have ...
In this Thesis the design and analysis of parallel algorithms is investigated under the framework of...
The routing problem of VLSI layout design is computationally very expensive because of the inherent ...
104 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1997.Using the Message Passing Int...
In this paper, we propose three different parallel algorithms based on a state-of-the-art global rou...
SIGLEAvailable from British Library Document Supply Centre- DSC:0678.231F(AD-A--193940)(microfiche) ...
Working out the best route for a land vehicle to take from its current position to a certain destina...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Data parallel programming provides a simple and powerful framework for designing parallel algorithms...
The orchestration of communication of distributed memory parallel applications on a parallel compute...
textabstractIn this paper we give a classification of parallel branch and bound algorithms and devel...
This thesis investigates and develops dynamic load-balancing mechanisms on distributed-memory MIMD m...