Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Concurrent Localized Wait-Free Operations On A Red Black Tree, Vitaliy Kubushyn
Concurrent Localized Wait-Free Operations On A Red Black Tree, Vitaliy Kubushyn
UNLV Theses, Dissertations, Professional Papers, and Capstones
A red-black tree is a type of self-balancing binary search tree. Some wait-free algorithms have been proposed for concurrently accessing and modifying a red-black tree from multiple threads in shared memory systems. Most algorithms presented utilize the concept of a "window", and are entirely top-down implementations. Top-down algorithms like these have to operate on large portions of the tree, and operations on nodes that would otherwise not overlap at all still have to compete with and help one another.
A wait-free framework is proposed for obtaining ownership of small portions of the tree at a time in a bottom-up manner. …
Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala
Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala
UNLV Theses, Dissertations, Professional Papers, and Capstones
The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q2||Cmax using pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O (n T2) and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is …
Message Passing Algorithm For Different Problems Sum, Mean, Guide And Sorting In A Rooted Tree Network., Sabaresh Nageswara Rao Maddula
Message Passing Algorithm For Different Problems Sum, Mean, Guide And Sorting In A Rooted Tree Network., Sabaresh Nageswara Rao Maddula
UNLV Theses, Dissertations, Professional Papers, and Capstones
In this thesis, we give message passing algorithms in distributed environment for five different problems of a rooted tree having n nodes. In the first algorithm, every node has a value; the root calculates the sum of those values, and sends it to all the nodes in the network. In the second algorithm, the root computes the value of mean of values of all the nodes, and sends it to all nodes of the network. The third algorithm calculates the guide pairs. Guide pair of a node x is an ordered pair (pre_index(x), post_index(x)), where pre_index(x) and post_index(x) are the …