The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Yoshiaki KATAYAMA(2hit)

1-2hit
  • Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property

    Yukiko YAMAUCHI  Sayaka KAMEI  Fukuhito OOSHITA  Yoshiaki KATAYAMA  Hirotsugu KAKUGAWA  Toshimitsu MASUZAWA  

     
    PAPER-Distributed Cooperation and Agents

      Vol:
    E92-D No:3
      Page(s):
    451-459

    A desired property of large distributed systems is self adaptability against the faults that occur more frequently as the size of the distributed system grows. Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing self-stabilizing protocols promise not only self-stabilization but also containment of faults (quick recovery and small effect) against small number of faults. However, existing composition techniques for self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing self-stabilizing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that provides a composition of multiple fault-containing self-stabilizing protocols while preserving the fault-containment property of the source protocols.

  • A Framework for an Integrated Co-allocator for Data Grid in Multi-Sender Environment

    Raghuvel S. BHUVANESWARAN  Yoshiaki KATAYAMA  Naohisa TAKAHASHI  

     
    PAPER

      Vol:
    E90-B No:4
      Page(s):
    742-749

    Data grid consists of scattered computing and storage resources located dispersedly in the grid network. These large sized data sets are replicated in more than one site for the better availability to the other nodes in a grid. Downloading the dataset from these replicated locations have practical difficulties and we find interest in a co-allocated download framework, which enables parallel download of replicated data from multiple servers. In this paper, we proposed a dynamic co-allocation scheme for parallel data transfer in grid environment, which copes up with highly inconsistent network and server performance. The model comprises of co-allocator, monitor and control mechanisms. The scheme initially obtains the bandwidth parameter from the monitor module to fix the partition size and the data transfer tasks are allocated onto the servers in duplication. In this way, the process of data transfer can neither be interrupted nor paralyzed, even when the network link is broken or server crash. We used Globus toolkit for our framework by making use of grid information and GridFTP services. We compared our scheme with the existing schemes and the results show notable improvement in overall completion time of data transfer.