• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.9
• /
• pp.76-84
• /
• 1992

The DSP silicon compiler consists of language compiler, module generator, placement tool, router, layout generation tools, and simulator. In this paper, The language compiler, the module generator, placement tool, and simulator were developed and provided for the system designer. The language compiler translates the designer's system description language into the intermediate form file. The intermediate form file expresses the interconnections and specifications of the cells in the cell library. The simulator was developed and provided for the behavioral verification of the DSP system. For its implementation, the event-driven technique and the C$^{++}$ task library was used. The module generator was developed for the layout of the verified DSP system, and generates the functional block to be used in the DSP chip. And then the placement tool determines the appropriate positions of the cells in the DSP chip. In this paper, the placement tool was implemented by Min-Cut and Simulated Annealing algorithm. The placement process can be controlled by the several conditions input by the system designer.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.183-189
• /
• 2018

This paper proposes distributed file placement and coverage expansion techniques for mitigating the traffic bottleneck in backhaul for small-cell networks. In order to minimize the backhaul load with limited memory space, the proposed scheme controls the coverage and file placement of base station according to file popularity distribution and memory space of base stations. In other words, since the cache hit ratio is low when there is small memory capacity or widespread file popularity distribution, the base stations expand its coverage and cache different set of files for the user located in overlapped area to exploit multiple cached file sets of base stations. Our simulation results show that the proposed scheme outperforms the conventional cache strategy in terms of network throughput when there is small memory capacity or widespread file popularity distribution.

• Restorative Dentistry and Endodontics
• /
• v.30 no.1
• /
• pp.31-37
• /
• 2005

The aim of this study was to evaluate the effectiveness of sealer placement in simulated root canal extensions. Forty resin blocks were attained from the Endo-training Bloc. In each block. The simulated root canal was made with $\#20$, 80taper GT file. After each block was longitudinally split into two halves, a standardized groove was prepared on one canal wall of two halves to simulate the canal extensions with various irregularities. The two halves of each block were assembled and all simulated root canals were obturated by single cone method with AH26 sealer. Four different methods of sealer placement were used: group A, $\#20$ K-file; group B, ultrasonic file; group C, lentulo spiral; group D, EZ-Fill bi-directional spiral. All obturated blocks were stored in $100\%$ humidity at $37^{\circ}C$ for 1 week, Using a low speed saw, each block was sectioned horizontally. Images of the sections were taken using a stereomicroscope at $\times$ 30 magnification and a digital camera. The amount of the sealer in the groove was evaluated using a scoring system, a higher score indicated better sealing effectiveness. The data was statistically analysed by Fisher's Exact Test. The sealing score was the lowest, specially at the middle area of canal extensions in group A, and that was statistically significant difference from other groups. In conclusion, the ultrasonic file, lentulo spiral and EZ-Fill bi-directional spiral were effective methods of sealer placement in simulated canal extensions. The K file was the least effective method, specially at the middle area of canal extensions.

• Proceedings of the KACD Conference
• /
• 2003.11a
• /
• pp.579-579
• /
• 2003

I. Objectives The aim of this study was to evaluate and compare the effectiveness of sealer placement in simulated root canal extensions using the K file, ultrasonic file, lentulo spiral and EZ-Fill. II. Materials and Methods Forty resin blocks were attained from cutting Endo-training Bloc with diamond saw. In each parallelepiped block, the simulated root canal was made with ＃20, 08taper GT file. After each block was longitudinally split into two halves using mallet and chisel, a standardized groove of 4mm in length, located 2mmapart from the root apex, was prepared on one wall of two halves using the custom-made knife to simulate the canal extensions with various irregularities.(omitted)

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.11
• /
• pp.682-689
• /
• 2014

Due to explosive growth of mobile data traffic, many kind of techniques based on small cell is proposed as solution for phenomenon. However, those techniques essentially demands increase of backhaul capacity and causes performance degradation if not satisfied. Based on that, the approach applying the storage capacity in place of backhaul capacity, which is known as femto-caching, is proposed to reduce data downloading delay of users in system. In this paper, we expanded previous research by proposing file placement strategy with distribution of user position, which is more practical scenario. Simulation results verify that our proposed scheme has better performance gains mainly because when coverage of helpers are overlapped, users get more opportunity to connect various helpers which enables users to download a variety kind of files from helpers, not base station.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1681-1693
• /
• 1997

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.9-17
• /
• 2009

In this paper, we propose a dynamic load distribution technique at the operating system level in mobile storage systems with a heterogeneous storage pair of a small form-factor and disk and a flash memory, which aims at saving energy consumption as well as enhancing I/O performance. Our proposed technique takes a combinatory approach of file placement and buffer cache management techniques to find how the load can be distributed in an energy and performance-aware way for a heterogeneous mobile storage air of a hard disk and a flash memory. We demonstrate that the proposed technique provides better experimental results with heterogeneous mobile storage devices compared with the existing techniques through extensive simulations.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.68-70
• /
• 2013

대량의 데이터를 효과적으로 저장하고 관리하기 위해서 클라우드 스토리지 시스템에서는 분산 파일 시스템 기술이 이용되고 있다. 그러나 데이터가 증가함에 따라 분산 파일 시스템을 이용함에도 스토리지 확장 비용이 증가하게 된다. 본 논문에서는 분산 파일 시스템의 스토리지 확장 비용을 줄이기 위해서 우리는 중복제거 파일 시스템을 적용한 분산 파일 시스템에서의 청크 배치 기법을 제안한다. 오픈 소스 기반의 분산 파일 시스템인 MooseFS 에 중복제거 파일 시스템인 lessfs 를 적용함으로써 스토리지의 가용공간을 늘릴 수 있으며, 이는 스토리지 확장 비용을 줄이는 효과를 가져온다. 또한, 동일한 청크는 같은 청크 서버에 배치 시킴으로써 중복제거 기회를 높인다. 실험을 통해서 제안 시스템의 중복제거량과 성능에 대해서 평가한다.

• The Journal of Korean Academy of Prosthodontics
• /
• v.55 no.1
• /
• pp.1-8
• /
• 2017

Purpose: The purpose of this study is to compare the accuracy of the CT guided implant template that was produced by using an intraoral scanner according to the edentulous distance. Materials and methods: Five maxillary casts were fabricated using radiopaque acrylic resin with the second premolars, first molars, and second molars missing. Then a virtual cast was acquired by scanning each resin cast. Implant treatment was planned on the missing sites by superimposing the presurgical CT DICOM file and the virtual cast. Then the implants were placed using a surgical template followed by postsurgical CT scan. The distance and angle of the platform and apex between the presurgical implant and postsurgical implant were measured using the X, Y, and Z axis of the superimposed presurgical CT and postsurgical CT via software followed by statistical analysis using Kruskall-Wallis test and Mann-Whitney test. Results: The implant placement angle error increased towards the second molars but there was no statistically significant difference. The implant placement distance error at the platform and apex also increased towards the second molars and there was a statistically significant error at the second molars. Conclusion: Although the placement angle had no statistically significant difference between the presurgical implant and postsurgical implant, the placement distance at the platform and apex showed a larger error and a statistically significant difference at the second molar implant.