• Title/Summary/Keyword: MPICH-G2

Search Result 17, Processing Time 0.03 seconds

TIGRIS Grid MPI Service based on WSRF (WSRF기반의 TIGRIS 그리드 MPI 서비스)

  • Kwon, Oh-Kyoung;Park, Kyung-Lang;Kwon, Oh-Young;Hahm, Jaegyoon;Lee, Pill Woo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.212-216
    • /
    • 2007
  • In this paper, we describe TIGRIS Grid MPI Service, which is the WS-Resource Framework (WSRF) based services to enable an MPI job to be executed on Grid environments. It covers heterogeneous compute resources and diverse MPI libraries. The main functionalities are as follows. First, it allows an MPI user to seamlessly launch a job without knowing how to use the specific MPI library. Secondly, it executes an MPI job on the cross-site resources by supporting the Grid-enabled MPI library such as MPICH-G2. Thirdly, it enables the user to launch a job using the source code without compiling.

  • PDF

TIGRIS Grid MPI Service based on WSRF (WSRF기반의 TIGRIS 그리드 MPI 서비스)

  • Kwon, Oh-Kyoung;Hahm, Jae-Gyoon;Lee, Pill-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.137-142
    • /
    • 2008
  • In this paper, we describe TIGRIS Grid MPI Service, which is 4he WS-Resource Framework (WSRF) based services to enable an MPI job to be executed on Grid environments. It covers heterogeneous compute resources and diverse MPI libraries. The main functionalities are as follows. First, it allows an MPI user to seamlessly launch a job without knowing how to use the specific MPI library. Secondly, it executes an MPI job on the cross-site resources by supporting the Grid-enabled MPI library such as MPICH-G2. Thirdly, it enables the user to launch a job using the source code without compiling. The service is implemented on top of the services of Globus Toolkit. We provide the user interface as a web portal and CLI(Command Line Interface).

A Study on the Efficient RFID Tag Identification considering Performance Information of Individual Nodes in a Grid Environment (그리드 환경에서 노드별 성능정보를 고려한 효율적인 RFID 태그 판별에 관한 연구)

  • Shin, Myeong-Sook;Lee, Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.5
    • /
    • pp.797-802
    • /
    • 2011
  • RFID is recognized to technically occupy important position in ubiquitous computing environment and expected to create new markets in a variety of fields from now on. In order to generalize RFID system, it is required to solve the problem of privacy invasion and expedite lots of tags We suggest efficient RFID Tag Identification to identify tags quickly on the satisfaction with 3 security requirements of privacy protection in this paper. This methods are transferred to Grid environment through parallel analysis of Hash-Chain, and we measure performance of each nodes under the Grid environment. Then, We'll suggest SP-Division Algorithm to identify tags with each nodes and implement it in a Grid environment.

Reducing Process Time for RFID Tag Identification on the Grid Environment (그리드 환경에서 RFID 태그 판별 시간 절감을 위한 태그 판별 처리)

  • Shin, Myeong-Sook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1049-1056
    • /
    • 2010
  • Recently RFID system has been adopted in various fields rapidly. However, we should solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system. To solve these problems, There is the Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of creasing numbers of Tag. Therefore We, suggest SP-Division algorithm satisfied with all necessary security of Privacy Protection Scheme and decreased in Tag Identification Time in this paper. And this paper implemented it in time standard finding the first key among the data devided into each nodes. The length of Hash-Chain holds 1000, and the total number of SPs increases 1000, 2000, 3000, and 4000. Comparing tag identification time by the total number of SPs and the number of Nodes with single node, extending the number of nodes to 1, 2, 3 and 4, when the number of nodes is 2, 40% of Performance, when the number of nodes is 3, 56%, and when the number of nodes is 4, 71% is improved.

Method to Reduce the Time when Identifying RFID Tag by using Computational Grid (계산 그리드를 이용한 대량의 RFID 태그 판별 시간 단축 방법)

  • Shin, Myeong-Sook;Lee, Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.5
    • /
    • pp.547-554
    • /
    • 2010
  • RFID is core technology to lead ubiquitous computing, and attract the notice of the world. It also improves social transparency, creates employment, and invigorates the allied industries. However, The technical characteristic with RFID has some problems with security and privacy. The commercialization of RFID is delayed due to these problems. This paper introduces the technical method to find solutions about an invasion of privacy to be due to introduce RFID system. First, this method applies Hash-Chain proposed by M. Ohkubo and some other researchers. The more tags increase, the more it demands lots of computation time. We divide SPs equally to solve these problems. And then, We'll suggest solutions to shorten the identification time of tag by implementing SPs with multi nodes of Grid environment at the same time. This makes it possible to keep the privacy protection of RFID tag, and process RFID tag in real time at the same time.

Tag Identification Process Model with Scalability for Protecting Privacy of RFID on the Grid Environment (그리드 환경에서 RFID 프라이버시 보호를 위한 확장성을 가지는 태그 판별 처리 모델)

  • Shin, Myeong-Sook;Kim, Choong-Woon;Lee, Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.6
    • /
    • pp.1010-1015
    • /
    • 2008
  • The choice of RFID system is recently progressing(being) rapidly at various field. For the sake of RFID system popularization, However, We should solve privacy invasion to gain the pirated information of RFID tag. There is the safest M Ohkubos's skill among preexistent studying to solve these problems. But, this skill has a problem that demands a immense calculation capability caused an increase in tag number when we discriminate tags. So, This paper proposes the way of transplant to Grid environment for keeping Privacy Protection up and reducing the Tag Identification Time. And, We propose the Tag Identification Process Model to apply Even Division Algorithm to separate SP with same site in each node. If the proposed model works in Grid environment at once, it would reduce the time to identify tags to 1/k.

RFID Tag Identification with Scalability Using SP-Division Algorithm on the Grid Environment (그리드 환경에서 SP분할 알고리즘을 이용한 확장성 있는 RFID 태그 판별)

  • Shin, Myeong-Sook;Ahn, Seong-Soo;Lee, Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2105-2112
    • /
    • 2009
  • Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, We suggest the way (process) satisfied with all necessary security of Privacy Protection Shreme and decreased in Tag Identification Time in this paper. First, We'll suggest the SP-Division Algorithm seperating SPs using the Performance Measurement consequence of each node after framing the program to create Hash-Chain Calculated table to get optimized performance because of character of the grid environment comprised of heterogeneous system. If we compare consequence fixed the number of nodes to 4 with a single node, equal partition, and SP partition, when the total number of SPs is 1000, 40%, 49%, when the total number of SPs is 2000, 42%, 51%, when the total number of SPs is 3000, 39%, 49%, and when the total number of SPs is 4000, 46%, 56% is improved.