Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

LSU Doctoral Dissertations

Computer Sciences

Approximation

Publication Year

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Fairness And Approximation In Multi-Version Transactional Memory., Basem Ibrahim Assiri Jan 2016

Fairness And Approximation In Multi-Version Transactional Memory., Basem Ibrahim Assiri

LSU Doctoral Dissertations

Shared memory multi-core systems bene_x000C_t from transactional memory implementations due to the inherent avoidance of deadlocks and progress guarantees. In this research, we examine how the system performance is a_x000B_ected by transaction fairness in scheduling and by the precision in consistency. We _x000C_rst explore the fairness aspect using a Lazy Snapshot (multi-version) Algorithm. The fairness of transactions scheduling aims to balance the load between read-only and update transactions. We implement a fairness mechanism based on machine learning techniques that improve fairness decisions according to the transaction execution history. Experimental analysis shows that the throughput of the Lazy Snapshot Algorithm is …


Oblivious Buy-At-Bulk Network Design Algorithms, Srivathsan Srinivasagopalan Jan 2011

Oblivious Buy-At-Bulk Network Design Algorithms, Srivathsan Srinivasagopalan

LSU Doctoral Dissertations

Large-scale networks such as the Internet has emerged as arguably the most complex distributed communication network system. The mere size of such networks and all the various applications that run on it brings a large variety of challenging problems. Similar problems lie in any network - transportation, logistics, oil/gas pipeline etc where efficient paths are needed to route the flow of demands. This dissertation studies the computation of efficient paths from the demand sources to their respective destination(s). We consider the buy-at-bulk network design problem in which we wish to compute efficient paths for carrying demands from a set of …


A Distributed Quadtree Dictionary Approach To Multi-Resolution Visualization Of Scattered Neutron Data, Rion Dooley Jan 2004

A Distributed Quadtree Dictionary Approach To Multi-Resolution Visualization Of Scattered Neutron Data, Rion Dooley

LSU Doctoral Dissertations

Grid computing is described as dependable, seamless, pervasive access to resources and services, whereas mobile computing allows the movement of people from place to place while staying connected to resources at each location. Mobile grid computing is a new computing paradigm, which joins these two technologies by enabling access to the collection of resources within a user's virtual organization while still maintaining the freedom of mobile computing through a service paradigm. A major problem in virtual organization is needs mismatch, in which one resources requests a service from another resources it is unable to fulfill, since virtual organizations are necessarily …