STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
IEEE/ACM Transactions on Networking (TON)
Fiber Network Service Survivability
Fiber Network Service Survivability
Simulation of Dynamic Grid Replication Strategies in OptorSim
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Developments from a June 1996 seminar on Online algorithms: the state of the art
Scheduling Distributed Applications: the SimGrid Simulation Framework
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
An Evaluation of Processor Co-allocation for Different System Configurations and Job Structures
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
TransLight: a global-scale LambdaGrid for e-science
Communications of the ACM - Blueprint for the future of high-performance networking
Communications of the ACM - Blueprint for the future of high-performance networking
Evaluating Scheduling and Replica Optimisation Strategies in OptorSim
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Evaluation of grid scheduling strategies through NSGrid: a network-aware grid simulator
Neural, Parallel & Scientific Computations - Special issue: Grid computing
G-lambda: coordination of a grid scheduler and lambda path service over GMPLS
Future Generation Computer Systems - IGrid 2005: The global lambda integrated facility
Collaborative data visualization for earth sciences with the OptIPuter
Future Generation Computer Systems - IGrid 2005: The global lambda integrated facility
Federated grid clusters using service address routed optical networks
Future Generation Computer Systems
Future Generation Computer Systems
New options and insights for survivable transport networks
IEEE Communications Magazine
Design of the optical path layer in multiwavelength cross-connected networks
IEEE Journal on Selected Areas in Communications
Dimensioning of survivable WDM networks
IEEE Journal on Selected Areas in Communications
Editorial: Special Section: Scalable information systems
Future Generation Computer Systems
Co-scheduling in Lambda Grid Systems by means of Ant Colony Optimization
Future Generation Computer Systems
1+1 protection of overlay distributed computing systems: modeling and optimization
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Scheduling and capacity design in overlay computing systems
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Hi-index | 0.00 |
Grids consist of the aggregation of numerous dispersed computational, storage and network resources, able to satisfy even the most demanding computing jobs. Due to the data-intensive nature of Grid jobs, there is an increasing interest in Grids using optical transport networks as this technology allows for the timely delivery of large amounts of data. Such Grids are commonly referred to as Lambda Grids. An important aspect of Grid deployment is the allocation and activation of installed network capacity, needed to transfer data and jobs to and from remote resources. However, the exact nature of a Grid's network traffic depends on the way arriving workload is scheduled over the various Grid sites. As Grids possibly feature high numbers of resources, jobs and users, solving the combined Grid network dimensioning and workload scheduling problem requires the use of scalable mathematical methods such as Divisible Load Theory (DLT). Lambda Grids feature additional complexity such as wavelength granularity and continuity or conversion constraints must be enforced. Additionally, Grid resources cannot be expected to be available at all times. Therefore, the extra complexity of resilience against possible resource failures must be taken into account when modelling the combined Grid network dimensioning and workload scheduling problem, enforcing the need for scalable solution methods. In this work, we tackle the Lambda Grid combined dimensioning and workload scheduling problem and incorporate single-resource failure or unavailability scenarios. We use Divisible Load Theory to tackle the scalability problem and compare non-resilient lambda Grid dimensioning to the dimensions needed to survive single-resource failures. We distinguish three failure scenarios relevant to lambda Grid deployment: computational element, network link and optical cross-connect failure. Using regular network topologies, we derive analytical bounds on the dimensioning cost. To validate these bounds, we present comparisons for the resulting Grid dimensions assuming a 2-tier Grid operation as a function of varying wavelength granularity, fiber/wavelength cost models, traffic demand asymmetry and Grid scheduling strategy for a specific set of optical transport networks.