Thesis-1991-Rahin.pdf (5.22 MB)
0/0

Parallel scheduling of concurrent VLSI simulation modules onto a multiprocessor

Download (5.22 MB)
thesis
posted on 26.10.2017 by Mohammad A. Rahin
The first of the two algorithms examined is the Concurrent Recursive Binary Partitioning (CRBP). This heuristic is based on Kernighan-Lin's graph bi-partitioning algorithm. An L-way partition is achieved by applying binary partitioning recursively, the procedure taking the form of a binary tree. In its parallel implementation each node of this tree is executed independently by a group of available processors and only the best among the solutions obtained is accepted. This provides enhanced processor utilisation and also assures improved results. The factors affecting the performance of the L-way partitioning heuristic at different stages are examined and their optimum values are investigated. [Continues.]

Funding

Association of Commonwealth Universities (Commonwealth Scholarships Programme).

History

School

  • Mechanical, Electrical and Manufacturing Engineering

Publisher

© M.A. Rahin

Publisher statement

This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 2.5 Generic (CC BY-NC-ND 2.5) licence. Full details of this licence are available at: http://creativecommons.org/licenses/by-nc-nd/2.5/

Publication date

1991

Notes

A Doctoral Thesis. Submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy at Loughborough University.

Language

en

Exports

Logo branding

Keyword(s)

Exports