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

Physical Sciences and Mathematics Commons

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

Articles 1 - 7 of 7

Full-Text Articles in Physical Sciences and Mathematics

Extreme Scale Parallel Nbody Algorithm With Event Driven Constraint Based Execution Model, Chirag Dekate Jan 2011

Extreme Scale Parallel Nbody Algorithm With Event Driven Constraint Based Execution Model, Chirag Dekate

LSU Doctoral Dissertations

Traditional scientific applications such as Computational Fluid Dynamics, Partial Differential Equations based numerical methods (like Finite Difference Methods, Finite Element Methods) achieve sufficient efficiency on state of the art high performance computing systems and have been widely studied / implemented using conventional programming models. For emerging application domains such as Graph applications scalability and efficiency is significantly constrained by the conventional systems and their supporting programming models. Furthermore technology trends like multicore, manycore, heterogeneous system architectures are introducing new challenges and possibilities. Emerging technologies are requiring a rethinking of approaches to more effectively expose the underlying parallelism to the applications …


Cognitive Radio Network With A Distributed Control Channel And Quality-Of-Service Solution, Urban Terrell Wiggins Jan 2011

Cognitive Radio Network With A Distributed Control Channel And Quality-Of-Service Solution, Urban Terrell Wiggins

LSU Doctoral Dissertations

The proliferation of wireless access and applications to the Internet and the advent of a myriad of highly evolved portable communication devices; creates the need for an efficiently utilized radio spectrum. This is paramount in the licensed and unlicensed radio frequency bands, that spawn an exponential growth in Dynamic Spectrum Access (DSA) research, Cognitive Radio (CR) and Cognitive Radio Networks (CRN) research. DSA research has given way to the paradigm shift toward CR with its dynamic changes in transmission schemas. This paradigm shift from a fixed and centralized frequency spectrum environment has morphed into a dynamic and decentralized one. CR …


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 …


Quality Of Service Based Data-Aware Scheduling, Archit Kulshrestha Jan 2011

Quality Of Service Based Data-Aware Scheduling, Archit Kulshrestha

LSU Doctoral Dissertations

Distributed supercomputers have been widely used for solving complex computational problems and modeling complex phenomena such as black holes, the environment, supply-chain economics, etc. In this work we analyze the use of these distributed supercomputers for time sensitive data-driven applications. We present the scheduling challenges involved in running deadline sensitive applications on shared distributed supercomputers running large parallel jobs and introduce a ``data-aware'' scheduling paradigm that overcomes these challenges by making use of Quality of Service classes for running applications on shared resources. We evaluate the new data-aware scheduling paradigm using an event-driven hurricane simulation framework which attempts to run …


Advanced Semantics For Accelerated Graph Processing, Dylan Thomas Stark Jan 2011

Advanced Semantics For Accelerated Graph Processing, Dylan Thomas Stark

LSU Doctoral Dissertations

Large-scale graph applications are of great national, commercial, and societal importance, with direct use in fields such as counter-intelligence, proteomics, and data mining. Unfortunately, graph-based problems exhibit certain basic characteristics that make them a poor match for conventional computing systems in terms of structure, scale, and semantics. Graph processing kernels emphasize sparse data structures and computations with irregular memory access patterns that destroy the temporal and spatial locality upon which modern processors rely for performance. Furthermore, applications in this area utilize large data sets, and have been shown to be more data intensive than typical floating-point applications, two properties that …


Sensor-Based Autonomous Pipeline Monitoring Robotic System, Jong-Hoon Kim Jan 2011

Sensor-Based Autonomous Pipeline Monitoring Robotic System, Jong-Hoon Kim

LSU Doctoral Dissertations

The field of robotics applications continues to advance. This dissertation addresses the computational challenges of robotic applications and translations of actions using sensors. One of the most challenging fields for robotics applications is pipeline-based applications which have become an indispensable part of life. Proactive monitoring and frequent inspections are critical in maintaining pipeline health. However, these tasks are highly expensive using traditional maintenance systems, knowing that pipeline systems can be largely deployed in an inaccessible and hazardous environment. Thus, we propose a novel cost effective, scalable, customizable, and autonomous sensor-based robotic system, called SPRAM System (Sensor-based Autonomous Pipeline Monitoring Robotic …


Data-Aware Workflow Scheduling In Heterogeneous Distributed Systems, Dengpan Yin Jan 2011

Data-Aware Workflow Scheduling In Heterogeneous Distributed Systems, Dengpan Yin

LSU Doctoral Dissertations

Data transferring in scientific workflows gradually attracts more attention due to large amounts of data generated by complex scientific workflows will significantly increase the turnaround time of the whole workflow. It is almost impossible to make an optimal or approximate optimal scheduling for the end-to-end workflow without considering the intermediate data movement. In order to reduce the complexity of the workflow-scheduling problem, most researches done so far are constrained by many unrealistic assumptions, which result in non-optimal scheduling in practice. A constraint imposed by most researchers in their algorithms is that a computation site can only start the execution of …