Resource Discovery in a dynamical grid based on Re-routing Tables

https://doi.org/10.1016/j.simpat.2008.04.010Get rights and content

Abstract

This paper studies the Resource Discovery problem in a dynamical grid based on a grid-router model. This model suggests that the grid can be seen as an environment comprised by routers and resources, where each router is in charge of its local resources. We address the Grid Resource Discovery problem as a problem of discovering the appropriate resource for a specific request within that environment. Attempting to solve the Grid Resource Discovery problem, several mechanisms have been proposed in the past. One of those mechanisms is the Routing Tables mechanism, which can guarantee finding the appropriate resource for a specific request within a static grid environment, where resources are permanently online, connected in the grid. This paper investigates the effectiveness of a Routing Tables mechanism, called Re-routing Tables which can guarantee finding the appropriate resource in a dynamical grid environment, where resources could disconnect from the grid, and therefore get in an offline state. Due to an offline resource situation, the resource request must be re-routed in order to be satisfied.

Introduction

The term “Grid” was introduced in early 1998 with the publication of the book “The Grid: Blueprint for a new computing infrastructure”. Until then researchers and scientists referred to “the computing resources transparently available to the user via a networked environment” with the terms metasystem or metacomputer [23], [24], [25]. The release of this book laid the groundwork of the field and provided definitions regarding that field. Since that time, many technological changes have occurred in computer science resulting to the evolution of the grid technology. Therefore, the need for clear definitions and descriptions about the grid technologies is now more than obvious, mainly because new aspects of the grid need to be included [1].

In [2], the authors extracted characteristics and definitions from main grid literature sources in order to provide a clear and complete grid definition. According to the list of characteristics extracted from literature, a grid can be defined as “a large-scale, geographically distributed, hardware and software infrastructure composed of heterogeneous networked resources owned and shared by multiple administrative organizations which are coordinated to provide transparent, dependable, pervasive and consistent computing support to a wide range of applications. These applications can perform distributed computing [26], [28], high throughput computing, on-demand computing [30], data-intensive computing [29], collaborative computing or multimedia computing”.

It is obvious, that the base of grid technology is the concept of resource sharing. The types of resources shared in a grid infrastructure could be desktop systems, clusters, storage devices and large data-sets. The question is what happens when a remote user requests access to a remote resource either to execute a job or to have access in the resource’s data? A mechanism provided by the grid infrastructure should be available to discover an appropriate resource for a request. Therefore, one of the main capabilities a grid infrastructure needs to support is a Resource Discovery mechanism [3].

Discovering a specific resource in traditional computing environments is relatively easy because the number of shared resources is small and all resources are under central control. In a grid environment, there are certain factors that make the resource discovery problem difficult to solve. These factors are: the huge number of resources, distributed ownership, heterogeneity of resources, resource failure, and resource evolution (upgrades changing a resource’s technical characteristics). An efficient Resource Discovery mechanism should take into consideration the above factors.

Another important aspect in a grid infrastructure is the dynamicity of such a system. Resources, shared in a grid, exist in two states: online and offline. Not all resources are permanently online in a grid. A resource’s state could change during time from online to offline and backwards. The main reason that this happens is the distributed ownership of grid resources. An owner may establish a policy on a workstation that states that a foreign job can be run on a machine only at certain periods of time. Another reason for a resource to exit the grid, therefore get in an offline state, is due to heavy local load. An owner may establish a policy on a workstation that states that a foreign job can be run on a machine when the local load is under a certain limit. When the local load reaches that limit, a resource must exit the grid and execute local jobs only. Finally, the huge number of resources in a grid increases the probabilities of resource failures. Resource failures are unpredictable and common due to hardware faults, software faults or power outages.

Taken into consideration the dynamicity that characterizes a grid system, we propose a new framework for resource discovery based on Routing Tables, called Re-routing Tables. Based on a large number of tests, we investigate the effectiveness of the Re-routing Tables mechanism which can guarantee finding the appropriate resource in a dynamical grid environment, where resources could disconnect from the grid, and therefore get in an offline state.

This paper is organized as follows: Section 2 presents related work on resource discovery in a grid environment. Section 3 describes the Resource Discovery mechanism based on Routing Tables. Section 4 describes our deployed framework of the Re-routing Tables mechanism. Section 5 presents experiments and testing of the mechanism.

Section snippets

Related work

Attempting to solve the Grid Resource Discovery problem, several mechanisms and frameworks have been proposed during the past years. In this section, we present some popular approaches for the Grid Resource Discovery problem mentioned in bibliography.

One of the popular approaches for the Grid Resource Discovery problem is the so called matchmaking one [4]. The matchmaking framework was designed to solve real problems encountered in the deployment of Condor, a high throughput computing system.

Grid Resource Discovery based on Routing Tables

Before we start examining the Re-routing Tables mechanism, we have to demonstrate the Routing Tables mechanism in a static grid environment using the grid-router model. This model suggests that a grid system can be seen as an environment comprised by routers and resources. Each router is in charge of its local resources. Fig. 1 demonstrates a grid system comprised by 12 routers, where each router controls a specific number of resources, 3–5. We assume that there are 20 different types of

Grid Resource Discovery based on Re-routing Tables

We have deployed a framework for Resource Discovery in a Dynamical grid, taken into consideration the fact that a grid system is characterized by resources that can get in an offline state at any time. An effective Grid Resource Discovery mechanism should be able to overcome the dynamicity of such a system. The proposed mechanism called Re-routing Tables is based on the Routing Tables mechanism analyzed in previous section. The Re-routing Tables mechanism can effectively deal with offline

Testing: environment and experiments

We have tested the Re-routing Tables mechanism in a number of experiments taken into consideration that a Resource Discovery mechanism should perform well in both small and large networks. Driven by this fact, simulations started in networks of 202 routers and ended in networks of 1002 routers. We used the Grid Graph generator created by Resende [31] to produce networks for our simulation needs.

Grid Graph is a user-friendly generator used to produce networks. It uses two basic parameters (h, w)

Conclusion

We have presented a new framework for the Grid Resource Discovery problem, called Re-routing Tables mechanism. The Re-routing Tables mechanism deals with offline resource events bound to happen in any grid system. Resources in a grid system exist in two states: online and offline. When a request for a resource is created in a router, the Routing Tables mechanism is responsible for discovering that resource. If that resource is offline, then the Re-routing Tables mechanism re-computes the

References (31)

  • Constandinos X. Mavromoustakis et al.

    Performance evaluation of an on demand tunable Resource allocation apparatus using constrained active network

    Journal of Simulation Practice and Theory (SIMPRA)

    (2006)
  • Heinz Stockinger

    Defining the grid: a snapshot on the current view

    (2007)
  • Miguel L. Bote-Lorenzo, Yannis A. Dimitriadis, Eduardo Gomez-Sanchez, Grid characteristics and uses: a grid definition,...
  • Rajkumar Buyya et al.

    A Gentle Introduction to Grid Computing and Technologies

    (2005)
  • R. Raman, M. Livny, M. Solomon, Matchmaking: distributed resource management for high throughput computing, hpdc, in:...
  • Rajesh. Raman

    Matchmaking Frameworks for Distributed Resource Management

    (2001)
  • Adriana Iamnitchi, Ian Foster, Daniel C. Nurmi, A peer-to-peer approach to resource location in grid enviroments, in:...
  • N.A. Al-Dmour, W.J. Teahan, Peer-to-Peer protocols for resource discovery in the grid, Parallel and Distributed...
  • Juan Li, Son Vuong, Grid resource discovery using semantic communities, in: Proceedings of the 4th International...
  • Hongsuda Tangmurarunkit, Stefan Decker, Carl Kesselman, Ontology-based resource matching in the grid – the grid meets...
  • Wei Li, Zhiwei Xu, Fangpeng Dong, Jun Zhang, Grid Resource Discovery based on a Routing-Transferring Model, Grid 2002,...
  • Juan Li, Son Vuong, Semantic overlay network for Grid Resource Discovery, in: Grid Computing Workshop,...
  • Ye Zhu, Junzhou Luo, Teng Ma, Dividing Grid Service Discovery into 2-stage matchmaking, ISPA 2004, LNCS, vol. 3358,...
  • Cheng Zhu et al.

    Decentralized Grid Resource Discovery based on Resource Information Community

    Journal of Grid Computing

    (2005)
  • Kashif Ali, Suprakash Datta, Mokhtar Aboelaze, Grid Resource Discovery using Small World Overlay Graphs, in:...
  • Cited by (13)

    • An enhanced load balancing mechanism based on deadline control on GridSim

      2012, Future Generation Computer Systems
      Citation Excerpt :

      In our future work, more characters, including the bandwidth, the resource processing ability, the requirement of Gridlet, will be taken into consideration. Routing protocols can also guarantee finding the appropriate resource for a specific request [33]. We hope to extend the mechanism proposed in [33] to load balancing aspects taking into consideration the re-routing table in order to provide the resource load balancing and route in future work.

    • Resource discovery in a Grid system: Directing requests to trustworthy virtual organizations based on global trust values

      2011, Journal of Systems and Software
      Citation Excerpt :

      This paper is mainly focused in proposing and presenting an efficient way of dealing with global trust values of Grid nodes and how these values can be managed effectively for solving the Grid resource discovery problem. A Grid system can be seen as an environment comprised by routers and resources (Karaoglanoglou and Karatza, 2008; Li et al., 2002). Each router is in charge of its local resources and also connects with other routers within the Grid system.

    • Acquiring knowledge in a grid system VIA a resource discovery scheme

      2011, International Journal of Modeling, Simulation, and Scientific Computing
    • Periodic scheduling of mixed workload in distributed systems

      2017, 2017 International Conference on Engineering, Technology and Innovation: Engineering, Technology and Innovation Management Beyond 2020: New Challenges, New Approaches, ICE/ITMC 2017 - Proceedings
    View all citing articles on Scopus
    View full text