• Title/Summary/Keyword: Distributed Computing.

Search Result 1,279, Processing Time 0.03 seconds

Implementation of an Intelligent Grid Computing Architecture for Transient Stability Constrained TTC Evaluation

  • Shi, Libao;Shen, Li;Ni, Yixin;Bazargan, Masound
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.1
    • /
    • pp.20-30
    • /
    • 2013
  • An intelligent grid computing architecture is proposed and developed for transient stability constrained total transfer capability evaluation of future smart grid. In the proposed intelligent grid computing architecture, a model of generalized compute nodes with 'able person should do more work' feature is presented and implemented to make full use of each node. A timeout handling strategy called conditional resource preemption is designed to improve the whole system computing performance further. The architecture can intelligently and effectively integrate heterogeneous distributed computing resources around Intranet/Internet and implement the dynamic load balancing. Furthermore, the robustness of the architecture is analyzed and developed as well. The case studies have been carried out on the IEEE New England 39-bus system and a real-sized Chinese power system, and results demonstrate the practicability and effectiveness of the intelligent grid computing architecture.

Volume Rendering using Grid Computing for Large-Scale Volume Data

  • Nishihashi, Kunihiko;Higaki, Toru;Okabe, Kenji;Raytchev, Bisser;Tamaki, Toru;Kaneda, Kazufumi
    • International Journal of CAD/CAM
    • /
    • v.9 no.1
    • /
    • pp.111-120
    • /
    • 2010
  • In this paper, we propose a volume rendering method using grid computing for large-scale volume data. Grid computing is attractive because medical institutions and research facilities often have a large number of idle computers. A large-scale volume data is divided into sub-volumes and the sub-volumes are rendered using grid computing. When using grid computing, different computers rarely have the same processor speeds. Thus the return order of results rarely matches the sending order. However order is vital when combining results to create a final image. Job-Scheduling is important in grid computing for volume rendering, so we use an obstacle-flag which changes priorities dynamically to manage sub-volume results. Obstacle-Flags manage visibility of each sub-volume when line of sight from the view point is obscured by other subvolumes. The proposed Dynamic Job-Scheduling based on visibility substantially increases efficiency. Our Dynamic Job-Scheduling method was implemented on our university's campus grid and we conducted comparative experiments, which showed that the proposed method provides significant improvements in efficiency for large-scale volume rendering.

Web Service Connection Management Scheme for Seamless Migration of User Workspace in Cloud Computing (클라우드 컴퓨팅에서 사용자 작업환경의 끊김 없는 연계를 위한 웹 서비스 연결 관리 기법)

  • Choi, Min
    • Journal of Information Technology Services
    • /
    • v.8 no.1
    • /
    • pp.193-202
    • /
    • 2009
  • Cloud computing emerges as a new computing paradigm which targets reliable and customizable services. The term builds on decades of research in virtual machine, distributed and parallel computing, utility computing, and more recently networking, web service, and software as a service. In this paper, we provide a seamless connection migration of web services. This is useful for cloud computing environment in which many client terminals have mobility. With the wireless internet facility, those mobile users can move place to place during internet communication. Therefore, we provide solutions to the two major problems in current virtualization based migration: communication failure problems and connection re-establishment. Communication channel flushing by zero window notification helps to resolve the communication failure problems and TCP port inheritance prevents connection re-establishment errors during socket reconstruction. Thus, our web service migration facility is now able to preserve open network connections, and even for server sockets. This is a highly transparent approach, in that we did not Introduce additional messages for channel flushing and did not make any modification to the TCP protocol stack. Experimental results show that the overhead due to connection migration of web services is almost negligible when compared with time to take the conventional web service migration.

Network-based Feature Modeling in Distributed Design Environment (네트워크 기반 특징형상 모델링)

  • Lee, J.Y.;Kim, H.;Han, S.B.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.1
    • /
    • pp.12-22
    • /
    • 2000
  • Network and Internet technology opens up another domain for building future CAD/CAM environment. The environment will be global, network-centric, and spatially distributed. In this paper, we present an approach for network-centric feature-based modeling in a distributed design environment. The presented approach combines the current feature-based modeling technique with distributed computing and communication technology for supporting product modeling and collaborative design activities over the network. The approach is implemented in a client/server architecture, in which Web-enabled feature modeling clients, neutral feature model server, and other applications communicate with one another via a standard communication protocol. The paper discusses how the neutral feature model supports multiple views and maintains naming consistency between geometric entities of the server and clients. Moreover, it explains how to minimize the network delay between the server and client according to incremental feature modeling operations.

  • PDF

Formal Specification Methods for Distributed Object-Oriented Systems (분산 객체지향 시스템을 위한 정형 명세 방법에 관한 연구)

  • Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1426-1433
    • /
    • 2000
  • As distributed computing systems become popular, many modeling techniques and methods have been developed in specify the specification formally and verify the distributed/concurrent sytems. In spite of importance of communication in distributed object-oriented systems, specifying of communication method generally has not been emphasized in the design phase. One reason is due to the system designer misunderstanding, that is, a specification needs to be independent on the implementation. However, since defining communication pattern indistributed object-oriented systems is more serious than the required message passing method in the design phase. specifying the communication pattern is necessary instead of postponing until the implementation. In this paper, two formal specification techniques, temporal logic method and Petri nets method, for the communication in distributed systems are discussed. One is based on the temporal logic, which specifies the different patterns of primitive predicates. This method enable to define the underlying mechanism which can be interpreted as constraints. The Petri net method helps to specify the dynamic behavior of communicational patterns using the properties of Petri nets.

  • PDF

DVSF: A Distributed System for Virtual Screening (DVSF: 가상 검색을 위한 분산 시스템)

  • 황석찬;최종선;이상근;임재훈;최재영;노경태;이지수
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.25-32
    • /
    • 2003
  • As one of a new generation of industries, biotechnology is currently spotlighted, and is creating new research and industrial areas that can be readily combined with information technology. Among them, virtual screening is a method for new drug design which uses computer simulation to virtually design active drug candidates for special disease. In this paper, we present a distributed system for virtual screening, called DVSF(Distributed Virtual Screening Facilities). DVSF is designed and developed to perform virtual screening efficiently on logically distributed idle or strategic resources in a small or medium scale laboratory.

Design and Specification of an Election Algorithm in Mobile Ad Hoc Distributed Systems (모바일 애드 혹 분산 시스템에서 선출 알고리즘의 명세 및 설계)

  • Park, Sung-Hoon
    • Journal of Digital Contents Society
    • /
    • v.11 no.4
    • /
    • pp.453-461
    • /
    • 2010
  • Specifying and designing the election algorithm in mobile ad hoc distributed systems is very difficult task. It is because mobile ad hoc systems are more prone to failures than conventional distributed systems. The aim of this paper is to propose a specification and design of the election algorithm in a specific ad hoc mobile computing environment. For this aim, we specify and design an election algorithm in this paper. In addition, we formally verify it and show that it is correct. This solution is based on the nodes detection algorithm that is a classical one for synchronous distributed systems.