Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Entire DC Network
Dynamic Load Balancing For I/O-Intensive Applications On Clusters, Xiao Qin, Hong Jiang, Adam Manzanares, Xiaojun Ruan, Shu Yin
Dynamic Load Balancing For I/O-Intensive Applications On Clusters, Xiao Qin, Hong Jiang, Adam Manzanares, Xiaojun Ruan, Shu Yin
School of Computing: Faculty Publications
Load balancing for clusters has been investigated extensively, mainly focusing on the effective usage of global CPU and memory resources. However, previous CPU- or memory-centric load balancing schemes suffer significant performance drop under I/O-intensive workloads due to the imbalance of I/O load. To solve this problem, we propose two simple yet effective I/O-aware load-balancing schemes for two types of clusters: (1) homogeneous clusters where nodes are identical and (2) heterogeneous clusters, which are comprised of a variety of nodes with different performance characteristics in computing power, memory capacity, and disk speed. In addition to assigning I/O-intensive sequential and parallel jobs …
Sensor Control And Scheduling Strategies For Sensor Networks, Victoria U. Manfredi
Sensor Control And Scheduling Strategies For Sensor Networks, Victoria U. Manfredi
Open Access Dissertations
We investigate sensor control and scheduling strategies to most effectively use the limited resources of an ad hoc network or closed-loop sensor network. In this context, we examine the following three problems. Where to focus sensing? Certain types of sensors, such as cameras or radars, are unable to simultaneously collect high fidelity data from all environmental locations, and thus require some sort of sensing strategy. Considering a meteorological radar network, we show that the main benefits of optimizing sensing over expected future states of the environment are when there are multiple small phenomena in the environment. Considering multiple users, we …
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 Distributed Algorithmic Framework For Coverage Problems In Wireless Sensor Networks, Akshaye Dhawan, Sushil K. Prasad
A Distributed Algorithmic Framework For Coverage Problems In Wireless Sensor Networks, Akshaye Dhawan, Sushil K. Prasad
Mathematics and Computer Science Faculty Publications
One of the key challenges in Wireless Sensor Networks (WSNs) is that of extending the lifetime of the network while meeting some coverage requirements. In this paper, we present a distributed algorithmic framework to enable sensors to determine their sleep-sense cycles based on specific coverage goals. The framework is based on our earlier work on the target coverage problem. We give a general version of the framework that can be used to solve network/graph optimization problems for which melding compatible neighboring local solutions directly yields globally feasible solutions such as the maximal independent set problem. We also apply this framework …
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 …
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. …