Learn More
With energy shortages and global climate change leading our concerns these days, the power consumption of datacenters has become a key issue. Obviously, a substantial reduction in energy consumption can be made by powering down servers when they are not in use. This paper aims at designing, implementing and evaluating a Green Scheduling Algorithm(More)
The ability to accurately predict future resource capabilities is of great importance for applications and scheduling algorithms which need to determine how to use time-shared resources in a dynamic grid environment. In this paper we present and evaluate a new and innovative method to predict the one-stepahead CPU load in a grid. Our prediction strategy(More)
SUMMARY Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic(More)
SUMMARY Heterogeneous distributed computing environments are well suited to meet the fast increasing computational demands. Task scheduling is very important for a heterogeneous distributed system to satisfy the large computational demands of applications. The performance of a scheduler in a heterogeneous distributed system normally has something to do with(More)
Data aggregation is a widely used technique in wireless sensor networks. The security issues, data confidentiality and integrity, in data aggregation become vital when the sensor network is deployed in a hostile environment. There has been many related work proposed to address these security issues. In this paper we survey these work and classify them into(More)
The capability to predict the host load of a system is significant for computational grids to make efficient use of shared resources. This paper attempts to improve the accuracy of host load predictions by applying a neural network predictor to reach the goal of best performance and load balance. We describe feasibility of the proposed predictor in a(More)
The ability to accurately predict task running time is of great importance for interactive applications and scheduling algorithms which need to determine how to use time-shared resources in a dynamic grid environment. In this paper we present and evaluate a new method to predict the running time of tasks in a grid. The prediction of task running time is(More)
Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the mobile agents technique and(More)