Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 4 of 4
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 …
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 …
Energy-Efficient Scheduling In Wmsns, Mohamed K. Watfa, Farah Abou Shahla
Energy-Efficient Scheduling In Wmsns, Mohamed K. Watfa, Farah Abou Shahla
University of Wollongong in Dubai - Papers
Recent technological breakthroughs in ultra-high integration and low-power electronics have enabled the development of tiny battery-operated sensors. The signal processing and communication activities are the main consumers of sensor’s energy. Since sensors are battery-operated, keeping the sensor active all the time will limit the battery’s lifetime. Therefore, optimal organization and management of the sensor network is crucial in order to perform the desired function with an acceptable level of quality and to maintain sufficient sensor energy for the required mission. Wireless multimedia sensor networks (WMSN) are a new and emerging type of sensor networks producing multimedia content. These networks have …
A Location Analysis Approach For Military Maintenance Scheduling With Geographically Dispersed Service Areas, Dale L. Overholts Ii, John E. Bell, Marvin A. Arostegui
A Location Analysis Approach For Military Maintenance Scheduling With Geographically Dispersed Service Areas, Dale L. Overholts Ii, John E. Bell, Marvin A. Arostegui
United States Air Force: Publications
This research uses a two-stage maximal covering location problem (MCLP) model to develop Intercontinental ballistic missile (ICBM) maintenance schedules for the US Air Force. Solutions are compared to actual missile maintenance activities accomplished at F. E. Warren Air Force Base (AFB), Wyoming in May 2005. Sensitivity analysis is performed to determine the impact of altering security response times and the number of security patrol are as on the quality of daily maintenance schedules and personnel usage. Results indicate marked improvement over traditional Air Force scheduling methods. In addition, sensitivity analysis identifies the levels at which the quality and quantity of …