Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Distributed Algorithms For Maximizing The Lifetime Of Wireless Sensor Networks, Akshaye Dhawan
Distributed Algorithms For Maximizing The Lifetime Of Wireless Sensor Networks, Akshaye Dhawan
Computer Science Dissertations
Wireless sensor networks (WSNs) are emerging as a key enabling technology for applications domains such as military, homeland security, and environment. However, a major constraint of these sensors is their limited battery. In this dissertation we examine the problem of maximizing the duration of time for which the network meets its coverage objective. Since these networks are very dense, only a subset of sensors need to be in "sense" or "on" mode at any given time to meet the coverage objective, while others can go into a power conserving "sleep" mode. This active set of sensors is known as a …
A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver
A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Increased levels of science objectives expected from spacecraft systems necessitate the ability to carry out fast on-board autonomous mission planning and scheduling. Heterogeneous radiation-hardened Field Programmable Gate Arrays (FPGAs) with embedded multiplier and memory modules are well suited to support the acceleration of scheduling algorithms. A methodology to design circuits specifically to accelerate Simulated Annealing Kernels (SAKs) in event scheduling algorithms is shown. The main contribution of this thesis is the low complexity scoring calculation used for the heuristic mapping algorithm used to balance resource allocation across a coarse-grained pipelined data-path. The methodology was exercised over various kernels with different …
A Sensitivity Analysis Of Scheduling Changes On Flight Training Resource Utilization Using Discrete Event Simulation, Melissa A. Findlay
A Sensitivity Analysis Of Scheduling Changes On Flight Training Resource Utilization Using Discrete Event Simulation, Melissa A. Findlay
Master's Theses - Daytona Beach
This study presented a scheduling model of the Flight Training Department at Embry Riddle Aeronautical University's Daytona Beach Campus built using ARENA 12.0. The purpose of the study was to determine if the Flight Training Department system was sensitive to changes in the resources available to students in Flight Training Device (FTD) course modules. Historical data from the Flight Training Department was used to build the model. As no significant difference was found between the actual real world system and the model for the number of active students and for the time it took students to complete the program, the …
Project Scheduling To Maximize Positive Impacts Of Reconstruction Operations, Andrew D. Chaney
Project Scheduling To Maximize Positive Impacts Of Reconstruction Operations, Andrew D. Chaney
Theses and Dissertations
Since the decline of the Cold War, the risk of major conflict between powerful industrialized nations has significantly decreased. Insecurity in the twenty-first century is forecast to arise rather from the debris of imploding states. Such situations may require intervention | military or otherwise | by concerned states, and the frequency with which these interventions occur is increasing. To meet this new operational challenge, the US military must adapt its planning procedures to account for Security, Stabilization, Transition, and Reconstruction Operations (SSTRO). This research develops a project scheduling based framework for post-conflict reconstruction that prioritizes and schedules reconstruction activities in …
An Algorithm To Solve The Associative Parallel Machine Scheduling Problem, Mohannad Abdelrahman Shuaib
An Algorithm To Solve The Associative Parallel Machine Scheduling Problem, Mohannad Abdelrahman Shuaib
University of Kentucky Master's Theses
Effective production scheduling is essential for improved performance. Scheduling strategies for various shop configurations and performance criteria have been widely studied. Scheduling in parallel machines (PM) is one among the many scheduling problems that has received considerable attention in the literature. An even more complex scheduling problem arises when there are several PM families and jobs are capable of being processed in more than one such family. This research addresses such a situation, which is defined as an Associative Parallel Machine scheduling (APMS) problem. This research presents the SAPT-II algorithm that solves a highly constrained APMS problem with the objective …
Scheduling Policy Design Using Stochastic Dynamic Programming, Robert Glaubius
Scheduling Policy Design Using Stochastic Dynamic Programming, Robert Glaubius
All Theses and Dissertations (ETDs)
Scheduling policies for open soft real-time systems must be able to balance the competing concerns of meeting their objectives under exceptional conditions while achieving good performance in the average case. Balancing these concerns requires modeling strategies that represent the range of possible task behaviors, and solution techniques that are capable of effectively managing uncertainty in order to discover scheduling policies that are effective across the range of system modes. We develop methods for solving a particular class of task scheduling problems in an open soft real-time setting involving repeating, non-preemptable tasks that contend for a single shared resource. We enforce …
Improving Throughput Of Simultaneous Multithreaded (Smt) Processors Using Shareable Resource Signatures And Hardware Thread Priorities, Mitesh Ramesh Meswani
Improving Throughput Of Simultaneous Multithreaded (Smt) Processors Using Shareable Resource Signatures And Hardware Thread Priorities, Mitesh Ramesh Meswani
Open Access Theses & Dissertations
Simultaneous multithreading (SMT) allows multiple hardware threads to execute concurrently on a processor core, potentially increasing the utilization and throughput of the processor core by a factor of the degree of multithreading. However, such performance gains may not be achieved due to contention for resources shared by the threads. Hardware thread priorities can be used to control the ratio of decode cycles allocated to the hardware threads of a processor core and, therefore, the degree of resource contention among the threads. The IBM POWER5, which has two hardware threads associated with each of its two cores, supports hardware thread priorities. …