• Title/Summary/Keyword: slave node

Search Result 43, Processing Time 0.022 seconds

An Efficient Load-Sharing Scheme for Internet-Based Clustering Systems (인터넷 기반 클러스터 시스템 환경에서 효율적인 부하공유 기법)

  • 최인복;이재동
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.264-271
    • /
    • 2004
  • A load-sharing algorithm must deal with load imbalance caused by characteristics of a network and heterogeneity of nodes in Internet-based clustering systems. This paper has proposed the Efficient Load-Sharing algorithm. Efficient-Load-Sharing algorithm creates a scheduler based on the WF(Weighted Factoring) algorithm and then allocates tasks by an adaptive granularity strategy and the refined fixed granularity algorithm for better performance. In this paper, adaptive granularity strategy is that master node allocates tasks of relatively slower node to faster node and refined fixed granularity algorithm is to overlap between the time spent by slave nodes on computation and the time spent for network communication. For the simulation, the matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 75%, 79% and 17%, respectively.

  • PDF

Parallel Processing of k-Means Clustering Algorithm for Unsupervised Classification of Large Satellite Images: A Hybrid Method Using Multicores and a PC-Cluster (대용량 위성영상의 무감독 분류를 위한 k-Means Clustering 알고리즘의 병렬처리: 다중코어와 PC-Cluster를 이용한 Hybrid 방식)

  • Han, Soohee;Song, Jeong Heon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.6
    • /
    • pp.445-452
    • /
    • 2019
  • In this study, parallel processing codes of k-means clustering algorithm were developed and implemented in a PC-cluster for unsupervised classification of large satellite images. We implemented intra-node code using multicores of CPU (Central Processing Unit) based on OpenMP (Open Multi-Processing), inter-nodes code using a PC-cluster based on message passing interface, and hybrid code using both. The PC-cluster consists of one master node and eight slave nodes, and each node is equipped with eight multicores. Two operating systems, Microsoft Windows and Canonical Ubuntu, were installed in the PC-cluster in turn and tested to compare parallel processing performance. Two multispectral satellite images were tested, which are a medium-capacity LANDSAT 8 OLI (Operational Land Imager) image and a high-capacity Sentinel 2A image. To evaluate the performance of parallel processing, speedup and efficiency were measured. Overall, the speedup was over N / 2 and the efficiency was over 0.5. From the comparison of the two operating systems, the Ubuntu system showed two to three times faster performance. To confirm that the results of the sequential and parallel processing coincide with the other, the center value of each band and the number of classified pixels were compared, and result images were examined by pixel to pixel comparison. It was found that care should be taken to avoid false sharing of OpenMP in intra-node implementation. To process large satellite images in a PC-cluster, code and hardware should be designed to reduce performance degradation caused by file I / O. Also, it was found that performance can differ depending on the operating system installed in a PC-cluster.

A Distributed Electrical Impedance Tomography Algorithm for Real-Time Image Reconstruction (실시간 영상 복원을 위한 분산 전기단층촬영 알고리즘)

  • Junghoon Lee;Gyunglin Park
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.25-36
    • /
    • 2004
  • This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

Neighbor Node Discovery and Load Balancing Schemes for Energy-Efficient Clustering in Wireless Sensor Networks (주변 노드 발견을 통한 무선 센서 네트워크에서의 에너지 효율적인 클러스터링 및 전력 균형 분산 기법)

  • Choi, Ji-Young;Kang, Chung-Gu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11A
    • /
    • pp.1147-1158
    • /
    • 2006
  • Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.

Hybrid MAC Protocol Design for an Underwater Acoustic Network (수중음향통신망을 위한 하이브리드 MAC 프로토콜 설계)

  • Park, Jong-Won;Ko, Hak-Lim;Cho, A-Ra;Yun, Chang-Ho;Choi, Young-Chol;Lim, Yong-Kon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.10
    • /
    • pp.2088-2096
    • /
    • 2009
  • This paper deals with hybrid MAC protocol design for underwater acoustic networks. The proposed MAC protocol has the cluster structure with a master node and slave nodes, and the hybrid network structure that combines a contention free period based on TDMA(Time Division Multiple Access) with a contention period. The suggested MAC protocol has a beacon packet for supervising network, a guard period between time slots for packet collision, time tag for estimation of propagation delay with a master node, the time synchronization of nodes, entering and leaving of network, and the communication method among nodes. In this paper, we adapt the proposed hybrid MAC protocol to AUV network, that is the representative mobile device of underwater acoustic network, and verify this protocol is applicable in real underwater acoustic network environment.

Big data-based information recommendation system (빅데이터 기반 정보 추천 시스템)

  • Lee, Jong-Chan;Lee, Moon-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.3
    • /
    • pp.443-450
    • /
    • 2018
  • Due to the improvement of quality of life, health care is a main concern of modern people, and the demand for healthcare system is increasing naturally. However, it is difficult to provide customized wellness information suitable for a specific user because there are various medical information on the Internet and it is difficult to estimate the reliability of the information. In this study, we propose a user - centered service that can provide customized service suitable for users rather than simple search function by classifying big data as text mining and providing personalized medical information. We built a big data system and measured the data processing time while increasing the Hadoop slave node for efficient big data analysis. It is confirmed that it is efficient to build big data system than existing system.

A Study for Preventing Secondary Incident Caused by Incoincidence of Individual Flights PID values or Sensor or Telecommunication Defects During Formation Flying (쿼드콥터 편대비행 중 PID값 불일치 및 센서, 모듈 고장진단을 통해 2차사고 발생 방지를 위한 연구)

  • Kim, Hyo-jin;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.487-489
    • /
    • 2016
  • In this paper, quad copter provides a method for preventing the possibility of accident in the air during a formation flight. The existing studies had a few studies upon the falls because quad copter formation flight was generally implemented indoors. Therefore, in this paper, we provide a self-diagnosis system to prevent a secondary accident for mismatching the Proportional-Integral-Derivative(PID) and detecting an abnormal communication modules each others in formation flying system. Scheme to be proposed, a system is that when one of the node meets a problem, the header node is sending the information of the current state to the server in the first and making a diagnosis itself in order to avoid the problems caused by dropping from the air. Therefore, if the difference between PID value of header node and slave node is greater than specified values or if it detects a defective sensors and communication modules, the proposed system is set to provide for moving toward a safe place. As a result, we expect that this proposed system is possible to minimize additional incidents by self adjusting the height through a self-diagnosis discovering flawed the acceleration sensor, gyro sensor and various attached sensors.

  • PDF

Efficient Processing of Huge Airborne Laser Scanned Data Utilizing Parallel Computing and Virtual Grid (병렬처리와 가상격자를 이용한 대용량 항공 레이저 스캔 자료의 효율적인 처리)

  • Han, Soo-Hee;Heo, Joon;Lkhagva, Enkhbaatar
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.4
    • /
    • pp.21-26
    • /
    • 2008
  • A method for processing huge airborne laser scanned data using parallel computing and virtual grid is proposed and the method is tested by generating raster DSM(Digital Surface Model) with IDW(Inverse Distance Weighting). Parallelism is involved for fast interpolation of huge point data and virtual grid is adopted for enhancing searching efficiency of irregularly distributed point data. Processing time was checked for the method using cluster constituted of one master node and six slave nodes, resulting in efficiency near to 1 and load scalability property. Also large data which cannot be processed with a sole system was processed with cluster system.

  • PDF

Rigid-Plastic FE Modeling of Frictional Contact Problems based on a Penalty Method (벌칙방법에 의한 마찰 접촉문제의 강소성 유한요소 모델링)

  • 장동환;황병복
    • Transactions of Materials Processing
    • /
    • v.12 no.1
    • /
    • pp.34-42
    • /
    • 2003
  • This paper presents a rigid-plastic finite element method to handle the frictional contact problem between two deformable bodies experiencing large deformation. The variational formulation combined with incremental quasi-static model is employed for treating the contact boundary condition. The frictional behavior of the model obeys Coulomb's law of friction. The proposed contact algorithms are classified into two categories, one for searching contacting nodes and the other for calculating contact forces at the contact surface. A slave node and master contact segment are defined using the geometric condition of finite elements on the contact interface. The penalty parameter is used to limit the penetration between contacting bodies, and the finite elements are coupled with contact boundary elements.us gates and cavity thicknesses. Through this study we have observed that the jetting is related to the die swell of material. This means that the jotting is strongly affected by the elastic flow property rather than the viscous flow property in viscoelastic characteristics of molten polymer. Different resins have different elastic properties, and elastic flow behavior depends on the shear rate of flow, i.e. injection speed. Large die swell would eliminate jetting however, the retardation of die swell would stimulate jetting. In the point of mole design, reducing the thickness ratio of cavity to gate can reduce or eliminate jetting regardless of amount of elasticity of polymer melt.

A Job Allocation Manager for Dynamic Remote Execution of Distributed Jobs in P2P Network (분산처리 작업의 동적 원격실행을 위한 P2P 기반 작업 할당 관리자)

  • Lee, Seung-Ha;Kim, Yang-Woo
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.87-103
    • /
    • 2006
  • Advances in computer and network technology provide new computing environment that were only possible with supercomputers before. In order to provide the environment, a distributed runtime system has to be provided, but most of the conventional distributed runtime systems lack in providing dynamic and flexible system reconfiguration depending on workload variance, due to a static architecture of fixed master node and slave working nodes. This paper proposes and implements a new model for distributed job allocation and management which is a distributed runtime system is P2P environment for flexible and dynamic system reconfiguration. The implemented systems enables job program transfer and management, remote compile and execution among cooperative developers based on P2P standard protocol Jxta platform. Since it makes dynamic and flexible system reconfiguration possible, the proposed method has some advantages in that it can collect and utilize idle computing resources immediately at a needed time for distributed job processing. Moreover, the implemented system's effectiveness and performance increase are shown by applying and processing the crawler jobs, in a distributed way, for collecting a large amount of data needed for internet search.

  • PDF