• Title/Summary/Keyword: block placement

Search Result 125, Processing Time 0.035 seconds

A Network Load Sensitive Block Placement Strategy of HDFS

  • Meng, Lingjun;Zhao, Wentao;Zhao, Haohao;Ding, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3539-3558
    • /
    • 2015
  • This paper investigates and analyzes the default block placement strategy of HDFS. HDFS is a typical representative distributed file system to stream vast amount of data effectively at high bandwidth to user applications. However, the default HDFS block placement policy assumes that all nodes in the cluster are homogeneous, and places blocks with a simple RoundRobin strategy without considering any nodes' resource characteristics, which decreases self-adaptability of the system. The primary contribution of this paper is the proposition of a network load sensitive block placement strategy. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results indicate that our work not only performs much better in the data distribution but also improves write performance more significantly than the others.

Nonparametric method using linear placement statistics in randomized block design with replications (반복이 있는 랜덤화 블록 계획법에서 선형위치통계량을 이용한 비모수 검정법)

  • Kim, Aran;Kim, Dongjae
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.6
    • /
    • pp.931-941
    • /
    • 2017
  • Typical Nonparametric methods for randomized block design with replications are two methods proposed by Mack (1981) and Mack and Skillings (1980). This method is likely to cause information loss because it uses the average of repeated observations instead of each repeated observation in the processing of each block. In order to compensate for this, we proposed a test method using linear placement statistics, which is a score function applied to the joint placement method proposed by Chung and Kim (2007). Monte Carlo simulation study is adapted to compare the power with previous methods.

Atrophic Alveolar Ridge Augmentation using Autogenous Block Bone Graft for Implant Placement (임플란트 식립을 위해 블록형 자가골이식을 이용한 퇴축된 치조골의 재건)

  • Chee, Young-Deok;Cho, Jin-Hyoung
    • Journal of Dental Rehabilitation and Applied Science
    • /
    • v.22 no.2
    • /
    • pp.161-171
    • /
    • 2006
  • Endosseous implants have restored normal function and dental health to many patients. When implants were introduced as an effective treatment modality, their efficacy was limited by the amount of available bone. Today, various grafting procedures can surgically create bone width and volume. Implants can be placed in more ideal locations for successful prosthetic reconstruction. The use of autogenous bone grafts represents the "gold standard" for bone augmentation procedures. Either intraoral or extraoral sites may be considered for donor sites. Alveolar ridge augmentation using autogenous bone block, can be done during implant placement or staged with implant placement, after bone graft healing. In the staged technique, a better implant positioning and the use of wide diameter implants are possible. Alveolar ridge augmentation using autogenous block graft is a predictable way of treatment, for the atrophic alveolar ridge before implant placement. The cases presented in this article clinically demonstrate the efficacy of using a autogenous block graft in generating effective new bone fill for dental implant placement.

Realistic Analysis Method for Continuously Block-Placed Mass Concrete Structures Considering Block Size and Sequence of Concrete Placement (매스 콘크리트 구조물의 연속 분할타설시 타설블록의 크기 및 타설순서를 고려한 합리적인 수화열 해석)

  • 오병환;전세진;유성원
    • Journal of the Korea Concrete Institute
    • /
    • v.11 no.3
    • /
    • pp.59-67
    • /
    • 1999
  • The mass concrete structures are generally constructed in an incremental manner by deviding the whole structures by a series of many blocks. The temperature and stress distributions of any specific block are continuously affected by the blocks placed before and after the specific block. For an accurate analysis of mass concrete structures, the sequence of all the blocks must be accordingly considered including the change of material properties with time for those blocks considered. The purpose of this study is to propose a realistic analysis method which can take into account not only the influence of the sequence, time interval and size of concrete block placement on the temperatures and stresses, but also the change of material properties with time. It is seen from this study that the conventional simplified analysis, which neglects material property changes of some blocks with time and does not consider the effect of adjacent blocks in the analysis, may yield large discrepancies in the temperature and stress distributions of mass concrete structures. This study gives a method to choose the minimum number of blocks required to obtain reasonably accurate results in analysis. The study provides a realistic method which can determine the appropriate size and time interval of block placement, and can be efficiently used in the design and construction of mass concrete structures.

RDP: A storage-tier-aware Robust Data Placement strategy for Hadoop in a Cloud-based Heterogeneous Environment

  • Muhammad Faseeh Qureshi, Nawab;Shin, Dong Ryeol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4063-4086
    • /
    • 2016
  • Cloud computing is a robust technology, which facilitate to resolve many parallel distributed computing issues in the modern Big Data environment. Hadoop is an ecosystem, which process large data-sets in distributed computing environment. The HDFS is a filesystem of Hadoop, which process data blocks to the cluster nodes. The data block placement has become a bottleneck to overall performance in a Hadoop cluster. The current placement policy assumes that, all Datanodes have equal computing capacity to process data blocks. This computing capacity includes availability of same storage media and same processing performances of a node. As a result, Hadoop cluster performance gets effected with unbalanced workloads, inefficient storage-tier, network traffic congestion and HDFS integrity issues. This paper proposes a storage-tier-aware Robust Data Placement (RDP) scheme, which systematically resolves unbalanced workloads, reduces network congestion to an optimal state, utilizes storage-tier in a useful manner and minimizes the HDFS integrity issues. The experimental results show that the proposed approach reduced unbalanced workload issue to 72%. Moreover, the presented approach resolve storage-tier compatibility problem to 81% by predicting storage for block jobs and improved overall data block placement by 78% through pre-calculated computing capacity allocations and execution of map files over respective Namenode and Datanodes.

Nonparametric procedures using placement in randomized block design with replications (반복이 있는 랜덤화 블록 계획법의 위치를 이용한 비모수 검정법)

  • Lee, Sang-Yi;Kim, Dong-Jae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.6
    • /
    • pp.1105-1112
    • /
    • 2011
  • Mack (1981), Skilling and Wolfe (1977, 1978) proposed typical nonparametric method in randomized block design with replications. In this paper, we proposed the procedures based on placement as extension of the two sample placement tests described in Orban and Wolfe (1982) and treatment versus control tests described in Kim (1999). Also Monte Carlo simulation study is adapted to compare power of the proposed procedure with those of previous procedures.

A hierarchical plcement method for building block layout design (빌딩블록의 레이아웃 설계를 위한 계층적 배치 방법)

  • 강병익;이건배
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.11
    • /
    • pp.128-139
    • /
    • 1996
  • In this paper, we propose an algorithm to solve the problem of placement of rectangular blocks whose sizes and shpaes are pre-determined. The proposed method solves the placement of many retangular blocks of different sizes and shapes in a hierarchical manner, so as to minimize the chip area. The placement problem is divided into several sub-problems: hierarchical partioning, hierarchical area/shape estimation, hierarchical pattern pacement, overlap removal, and module rotation. After the circuit is recursively partitioned to build a hierarchy tree, the necessary wiring area and module shpaes are estimated using the resutls of the partitioning and the pin information before the placement is performed. The placement templaes are defined to represent the relative positions of the modules. The area and the connectivity are optimized separately at each level of hierachy using the placement templates, so the minimization of chip area and wire length can be achieved in a short execution time. Experiments are made on the MCNC building block benchmark circuits and the results are compared with those of other published methods. The proposed technique is shown to produce good figures in tems of execution time and chip area.

  • PDF

Nonparametric procedures using aligned method and linear placement statistics in randomized block design (랜덤화 블록 계획법에서 정렬방법과 선형위치통계량을 이용한 비모수 검정법)

  • Han, Jinjoo;Kim, Dongjae
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.7
    • /
    • pp.1411-1419
    • /
    • 2016
  • Nonparametric procedures in randomized block design was proposed by Friedman (1937) as a general alternative. This method is used to find out the difference in treatment effect. It can cause a loss of inter block information using the ranking in each block. This paper proposed nonparametric procedures using an aligned method proposed by Hodges and Lehmann (1962) to reduce block information based on joint placement suggest by Jo and Kim (2013) in a randomized block design. We also compared the power of the test of the proposed procedures and established method through a Monte Carlo simulation.

Macro Block Placement Using Simulated Annealing (시뮬레이티드 어닐링을 이용한 마크로 블럭의 배치)

  • Park, In-Cheol;Kyung, Chong-Min
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.147-154
    • /
    • 1989
  • An effective placement of macro blocks having arbitrary width and height is very important in reducing the chip area and the signal delay. In this paper, we proposed a method of macro block placement to obtain the globally optimal placement using simulated annealing, and an efficient algorithm for eliminating the overlaps between the rectangular macro blocks which may remain even after the simulated annealing process is terminated. Each macro block was enlarged to take into account minimal routing area, and these macro blocks were compacted as much as possible during the placement. This procedure was implemented in C language running on MV10000/UNIX computer system, and good placements were obtained by applying this procedure to two circuits which were consisted of 50 and 160 macro blocks respectively. Several parameters giving great effects to final placements were investigated.

  • PDF

Nonparametric procedures using aligned method and joint placement in randomized block design with replications (반복이 있는 랜덤화 블록 계획법에서 정렬방법과 결합위치를 이용한 비모수 검정법)

  • Lee, Eunjee;Kim, Dongjae
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.2
    • /
    • pp.291-299
    • /
    • 2017
  • Mack and Skillings (1980) proposed nonparametric procedures in a randomized block design with replications as general alternatives. This method is used to find the difference in the treatment effect; however, it can cause a loss of inter block information using the ranking in each block. In this paper, we proposed new nonparametric procedures in a randomized block design with replications using an aligned method proposed by Hodges and Lehmann (1962) that used information of blocks and based on the joint placement suggest by Chung and Kim (2008). We also compared the power of the test of the proposed procedures and established a method through Monte Carlo simulation.