• 제목/요약/키워드: Cluster Systems

검색결과 1,228건 처리시간 0.031초

Avoiding Energy Holes Problem using Load Balancing Approach in Wireless Sensor Network

  • Bhagyalakshmi, Lakshminarayanan;Murugan, Krishanan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권5호
    • /
    • pp.1618-1637
    • /
    • 2014
  • Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

Scalar form of dynamic equations for a cluster of bodies

  • Vinogradov, Oleg
    • Structural Engineering and Mechanics
    • /
    • 제5권2호
    • /
    • pp.209-220
    • /
    • 1997
  • The dynamic equations for an arbitrary cluster comprising rigid spheres or assemblies of spheres (subclusters) encountered in granular-type systems are considered. The system is treated within the framework of multibody dynamics. It is shown that for an arbitrary cluster topology the governing equations can be given in an explicit scalar from. The derivation is based on the D'Alembert principle, on inertial coordinate system for each body and direct utilization of the path matrix describing the topology. The scalar form of the equations is important in computer simulations of flow of granular-type materials. An illustrative example of a three-body system is given.

Compact Stellar Systems and Dwarf Galaxies in the Pandora's Cluster Abell 2744

  • 이명균;장인성
    • 천문학회보
    • /
    • 제40권2호
    • /
    • pp.30.2-30.2
    • /
    • 2015
  • Abell 2744 is a giant merging cluster, called the Pandora's Cluster, at the redshift of z=0.308 (corresponding to a distance of 1270 Mpc). Taking the advantage of the deep high resolution images in the Hubble Frontier Field program, we study the properties of compact stellar systems including globular clusters and ultracompact dwarfs (UCDs) as well as dwarf galaxies in this cluster. We find a rich population of globular clusters and UCDs in Abell 2744. The spatial distribution of these objects is consistent with the mass map derived from lensing analysis, while showing a significant offset from the X-ray map of hot gas. The faint end of the luminosity function of the galaxies in the red sequence is fit by a flat slope, showing no faint upturn. We discuss these finding in relation with the origin of UCDs, formation of red sequence dwarf galaxies, and formation of the Pandora's cluster.

  • PDF

Nearest neighbor and validity-based clustering

  • Son, Seo H.;Seo, Suk T.;Kwon, Soon H.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제4권3호
    • /
    • pp.337-340
    • /
    • 2004
  • The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

Dynamic Load Balancing Algorithm using Execution Time Prediction on Cluster Systems

  • Yoon, Wan-Oh;Jung, Jin-Ha;Park, Sang-Bang
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.176-179
    • /
    • 2002
  • In recent years, an increasing amount of computer network research has focused on the problem of cluster system in order to achieve higher performance and lower cost. The load unbalance is the major defect that reduces performance of a cluster system that uses parallel program in a form of SPMD (Single Program Multiple Data). Also, the load unbalance is a problem of MPP (Massive Parallel Processors), and distributed system. The cluster system is a loosely-coupled distributed system, therefore, it has higher communication overhead than MPP. Dynamic load balancing can solve the load unbalance problem of cluster system and reduce its communication cost. The cluster systems considered in this paper consist of P heterogeneous nodes connected by a switch-based network. The master node can predict the average execution time of tasks for each slave node based on the information from the corresponding slave node. Then, the master node redistributes remaining tasks to each node considering the predicted execution time and the communication overhead for task migration. The proposed dynamic load balancing uses execution time prediction to optimize the task redistribution. The various performance factors such as node number, task number, and communication cost are considered to improve the performance of cluster system. From the simulation results, we verified the effectiveness of the proposed dynamic load balancing algorithm.

  • PDF

IT첨단산업클러스터 활성화방안 - 충북소프트웨어 산업을 중심으로 - (The Development Strategy of IT High-tech Industrial Cluster : with a Focus on the Chungbuk Software Industry)

  • 김상욱;권성택
    • 한국산업정보학회논문지
    • /
    • 제11권5호
    • /
    • pp.225-235
    • /
    • 2006
  • 1980년대 이후 세계 각국은 실리콘밸리를 모방하려는 노력을 경쟁적으로 추구하고 있다. 우리나라에서도 '90년 이후 첨단산업 클러스터에 대한 논의가 대두 되었다. 이에 본 논 논문은 '클러스터'에 관한 선행연구들로부터 클러스터의 형성의 핵심요인들을 도출한 후 이를 기준으로 '충북지역의 SW 산업'의 클러스터 형성 정도를 조사하였다. 아울러 통계분석으로 얻은 주요인별 성숙도에 기초하여 해당 지역의 클러스터 형성 촉진 방안을 그 대안으로 제시하였다.

  • PDF

무선 센서 네트워크의 자기 조직화된 클러스터의 에너지 최적화 구성에 관한 연구 (A Study on Energy Efficient Self-Organized Clustering for Wireless Sensor Networks)

  • 이규홍;이희상
    • 대한산업공학회지
    • /
    • 제37권3호
    • /
    • pp.180-190
    • /
    • 2011
  • Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

A Cluster-Based Relay Station Deployment Scheme for Multi-Hop Relay Networks

  • Chang, Jau-Yang;Chen, Yun-Wei
    • Journal of Communications and Networks
    • /
    • 제17권1호
    • /
    • pp.84-92
    • /
    • 2015
  • Multi-hop relay networks have been widely considered as a promising solution to extend the coverage area and to reduce the deployment cost by deploying the relay stations (RSs) in mobile communication systems. Suitable deployment for the RSs is one of the most important features of the demand nodes (DNs) to obtain a high data transmission rate in such systems. Considering a tradeoff among the network throughput, the deployment budget, and the overall coverage of the systems, efficient RS deployment schemes and corresponding algorithms must be developed and designed. A novel cluster-based RS deployment scheme is proposed in this paper to select the appropriate deployment locations for the relay stations from the candidate positions. To make an ideal cluster distribution, the distances between the DNs are calculated when deploying the RSs. We take into account the traffic demands and adopt a uniform cluster concept to reduce the data transmission distances of the DNs. On the basis of the different candidate positions, the proposed scheme makes an adaptive decision for selecting the deployment sites of the RSs. A better network throughput and coverage ratio can be obtained by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the network throughput and the coverage ratio. Additionally, a suitable deployment budget can be implemented in multi-hop relay networks.

The feasibility and properties of dividing virtual machine resources using the virtual machine cluster as the unit in cloud computing

  • Peng, Zhiping;Xu, Bo;Gates, Antonio Marcel;Cui, Delong;Lin, Weiwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권7호
    • /
    • pp.2649-2666
    • /
    • 2015
  • In the dynamic cloud computing environment, to ensure, under the terms of service-level agreements, the maximum efficiency of resource utilization, it is necessary to investigate the online dynamic management of virtual machine resources and their operational application systems/components. In this study, the feasibility and properties of the division of virtual machine resources on the cloud platform, using the virtual machine cluster as the management unit, are investigated. First, the definitions of virtual machine clusters are compared, and our own definitions are presented. Then, the feasibility of division using the virtual machine cluster as the management unit is described, and the isomorphism and reconfigurability of the clusters are proven. Lastly, from the perspectives of clustering and cluster segmentation, the dynamics of virtual machines are described and experimentally compared. This study aims to provide novel methods and approaches to the optimization management of virtual machine resources and the optimization configuration of the parameters of virtual machine resources and their application systems/components in large-scale cloud computing environments.

KISTI 슈퍼컴퓨팅 센터에서 수행중인 테라플롭스 클러스터 구축 및 개발에 관한 연구 (A project on building Tflops cluster at KISTI Supercomputing Center)

  • 홍정우;박형우;이상산
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2001년도 추계 학술대회논문집
    • /
    • pp.182-189
    • /
    • 2001
  • A project has been initiated at KISTI Supercomputing Center at year 1999 to build a Tflops cluster in order to support newly emerging demands for larger scale parallel computing resources. As a supportive substitute of traditional supercompters, the cluster systems are expected to play important role in supporting diversified computational needs. In this paper, KISTI Supercomputing Center's working status of building Tflops cluster system and future plans.

  • PDF