Parallel scheduling of concurrent VLSI simulation modules onto a multiprocessor
thesisposted on 26.10.2017 by Mohammad A. Rahin
In order to distinguish essays and pre-prints from academic theses, we have a separate category. These are often much longer text based documents than a paper.
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.]
Association of Commonwealth Universities (Commonwealth Scholarships Programme).
- Mechanical, Electrical and Manufacturing Engineering