STUDY AND PERFORMANCE ANALYSIS OF THE WYLLIE?S LIST RANKING ALGORITHM USING VARIOUS PARALLEL PROGRAMMING MODELS

摘要

The Wyllie?s list ranking algorithm takes a linked list data structure as an input and it pass the linked list successor elements to the succ1 array to find the Rank. The algorithm depends upon the Pointer jumping operation and its concepts. The motivation for this work is to parallelize the Wyllie?s list ranking algorithm using three different parallel programming platforms and compare its performance on all the three platforms.