Learn More
Due to the emergence of Grid computing over the Internet, there is presently a need for dynamic load balancing algorithms which take into account the characteristics of Grid computing environments. In this paper, we consider a Grid architecture where computers belong to dispersed administrative domains or groups which are connected with heterogeneous(More)
This paper presents an efficient protection scheme to dynamically allocate restorable bandwidth-guaranteed paths in integrated IP-over-wavelength division multiplexing (WDM) networks. A restorable bandwidth-guaranteed path implies an active path and another link-disjoint backup path both with the required bandwidth. In this paper, we propose two(More)
Managing resources and cleverly pricing them on computing systems is a challenging task. Resource sharing demands careful load balancing and often strives to achieve a win-win situation between resource providers and users. Toward this goal, we consider a joint treatment of load balancing and pricing. We do not assume static pricing to determine load(More)
It is the key of Krusal Algorithm to select edges and judge loop. Though realized path-compression in operation of searching tree of Union-Find Sets Data Structure, and optimized merging-operation which the shallower tree has been merged into the deeper tree, the operation of selecting edges and judging loop in Krusal Algorithm is optimized and the time(More)
Fault-tolerant scheduling is an imperative step for large-scale computational Grid systems, as often geographically distributed nodes co-operate to execute a task. By and large, the <i>primary-backup</i> approach is a common methodology used for fault tolerance where in each task has a primary copy and a backup copy on two different processors. Backup(More)