Please use this identifier to cite or link to this item:
Full metadata record
|dc.description.abstract||With the advances in high-speed networks and processors hardware technology, parallel computing using a network of workstations (NOWs) becomes reachable to a wide sector of users and application programmers with minimal extra cost. The number of interconnected computers by LAN, MAN, or WAN has increased tremendously in the last few years. The Clustering algorithms are used to schedule the program DAGs on computing elements. There are many clustering algorithms given by different researchers, but they don't consider synchronisation requirements at application level as required in many NOW applications like SSL, SET etc. A bad clustering may generate deadlock between different modules on different clusters due to synchronisation requirement. To handle the problems Bassel R. Arafeh have proposed an algorithm named NLC_SynchCom in his research work. This algorithm for scheduling the tasks of a parallel program is belongs to the class of UNC (Unbounded Number of Clusters) scheduling algorithms for clusters of NOWs. The main objective of this algorithm is to consider synchronous communication with deadlock avoidance strategy, for intertask message passing. The algorithm generates nonlinear clusters by traversing the task graph (DAG) once, using the Edge-Zeroing (EZ) technique. In this dissertation, the Conventional NLC_SynchCom algorithm is modified to improve its performance. Further here the performance of the two variations of the modified algorithm is tested and compared with that of conventional algorithm for various type of gr||en_US|
|dc.subject||ELECTRONICS AND COMPUTER ENGINEERING||en_US|
|dc.title||MODIFIED CLUSTERING ALGORITHM TOR SCHEDULING DAGS ON NOWS||en_US|
|Appears in Collections:||MASTERS' DISSERTATIONS (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.