Use this URL to cite or link to this record in EThOS:
Title: Parallel scheduling of concurrent VLSI simulation modules onto a multiprocessor
Author: Rahin, Mohammad A.
ISNI:       0000 0001 3504 6373
Awarding Body: Loughborough University of Technology
Current Institution: Loughborough University
Date of Award: 1991
Availability of Full Text:
Access from EThOS:
Access from Institution:
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.
Supervisor: Not available Sponsor: Association of Commonwealth Universities
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Computer software & programming