The faster processing power of modern computers and the development of efficient algorithms have made it possible for operations researchers to tackle a much wider range of problems than ever before. Further improvements in processing speed can be achieved utilising relatively inexpensive transputers to process components of an algorithm in parallel. The Davidon-Fletcher-Powell method is one of the most successful and widely used optimisation algorithms for unconstrained problems. This paper examines the algorithm and identifies the components that can be processed in parallel. The results of some experiments with these components are presented which indicates under what conditions parallel processing with an inexpensive configuration is li...
The work presented in this thesis is mainly involved in the design and analysis of asynchronous para...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
The traveling salesman problem (TSP) is a problem in computer science that has been extensively stud...
The paper presents an analysis of the use of optimization algorithms in parallel solutions and distr...
The paper presents an approach to improve the efficiency of some two-level optimization algorithms b...
. This paper describes an approach to constructing derivative-free algorithms for unconstrained opti...
Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
SIGLEAvailable from British Library Document Supply Centre- DSC:DXN002626 / BLDSC - British Library ...
The main aim of this thesis is the comparison of parallel and sequential algorithm implementation fo...
The performance of a computer system is important. One way of improving performance is to use multip...
Graduation date: 1988The specific objectives of this project are to compare the\ud Sequent and the t...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Parallel programs are characterised by their speedup behaviour. Each parallel program is a collectio...
Abstract — A well organized parallel application can accomplish better performance over sequential e...
The work presented in this thesis is mainly involved in the design and analysis of asynchronous para...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
The traveling salesman problem (TSP) is a problem in computer science that has been extensively stud...
The paper presents an analysis of the use of optimization algorithms in parallel solutions and distr...
The paper presents an approach to improve the efficiency of some two-level optimization algorithms b...
. This paper describes an approach to constructing derivative-free algorithms for unconstrained opti...
Three parallel physical optimization algorithms for allocating irregular data to multicomputer nodes...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
SIGLEAvailable from British Library Document Supply Centre- DSC:DXN002626 / BLDSC - British Library ...
The main aim of this thesis is the comparison of parallel and sequential algorithm implementation fo...
The performance of a computer system is important. One way of improving performance is to use multip...
Graduation date: 1988The specific objectives of this project are to compare the\ud Sequent and the t...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Parallel programs are characterised by their speedup behaviour. Each parallel program is a collectio...
Abstract — A well organized parallel application can accomplish better performance over sequential e...
The work presented in this thesis is mainly involved in the design and analysis of asynchronous para...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
The traveling salesman problem (TSP) is a problem in computer science that has been extensively stud...