• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.2
• /
• pp.13-20
• /
• 2021

Placement is a very important step in the VLSI physical design process. It is the problem of placing circuit modules to optimize the circuit performance and reliability of the circuit. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for circuit placement include the cluster growth, simulated annealing, integer linear programming and genetic algorithm. In this paper we propose a adapted genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of each implementation. As a result, it was found that the adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.2
• /
• pp.421-431
• /
• 1999

NOD systems contain the data of multiple types such as text, image and video, and the size of NOD data depend on their data types. Therefore, in this paper, we propose a Data Placement Method based on Data Types(DPMDT), in which the data placement method depends on their type. Then, we analyze the performance of DPMDT with that of a Time Based Storage Management(TBSM) in which the data placement method depends on their created date, and that of Rate Based Storage Management(RBSM) in which the data placement method depends on their created date and accessed rate. In case of long playback of video news and a few disks(one disk), our results show that the performance of DPMDT is less efficient than that of TBSM and RBSM methods, however, in case of over 2 disks, the performance of DPMDT is more efficient than that of TBSM and RBSM methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1610-1623
• /
• 2013

In-network caching is a key component of information-centric networking (ICN) for reducing content download time, network traffic, and server workload. Data center network (DCN) is an ideal candidate for applying the ICN design principles. In this paper, we have evaluated the effectiveness of caching placement and replacement in DCN with butterfly-topology. We also suggest a new cache placement policy based on the number of routing nodes (i.e., hop counts) through which travels the content. With a probability inversely proportional to the hop counts, the caching placement policy makes each routing node to cache content chunks. Simulation results lead us to conclude (i) cache placement policy is more effective for cache performance than cache replacement, (ii) the suggested cache placement policy has better caching performance for butterfly-type DCNs than the traditional caching placement policies such as ALWASYS and FIX(P), and (iii) high cache hit ratio does not always imply low average hop counts.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.7
• /
• pp.140-145
• /
• 1989

In this paper, we present an effective circuit placement method called SOAP (self-organization assisted placement) for rectilinear or arbitrarily-shaped region arised form the layout of ASIC (application specific integrated circuit). Self-organization is a learning algorithm for neural networks proposed by [1] which adjusts weights of synapses connected to neurons such that topologically close neurons are sensitive to inputs that are physically similar. In SOAP, we obtain a good circuit placement result in arbitrarily-shaped region by replacing the block of circuit and the position (x, y coordinates) of the block with the neuron and the weight pair of synapses connected to the neuron, respectively. This method can also be extended to the circuit placement over the nonplanar surface.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.117-126
• /
• 1989

In this paper, a new placement algorithm for gate array lay out design is proposed. The proposed algorithm can treat the variable-sized macrocells and by considering the I/Q pad locations, the routing between I/Q pads and the internal region of a chip can be automated effectively. The algorithm is composed of 3 parts. which are initial partitioning, initial placement and placement improvement. In the initial placement phase, a given circuit is partitioned into 5 sub-circuits, by clustering method with considers connectivities of cells not only with I/Q pads but also with related partitioned groups is used repeatedly to assign a unique position to each cell. In the placement improvement phase, the concept of probabilistic wiring density is introduced, and cell moving algorithm is proposed to make the density in a chip even.

• Journal of Korean Neurosurgical Society
• /
• v.51 no.1
• /
• pp.66-70
• /
• 2012

Thoracic pedicle screw fixation techniques are still controversial for thoracic deformities because of possible complications including neurologic deficit. Methods to aid the surgeon in appropriate screw placement have included the use of intraoperative fluoroscopy and/or radiography as well as image-guided techniques. We describe our technique for free hand pedicle screw placement in the thoracic spine without any radiographic guidance and present the results of pedicle screw placement analyzed by computed tomographic scan in two human cadavers. This free hand technique of thoracic pedicle screw placement performed in a step-wise, consistent, and compulsive manner is an accurate, reliable, and safe method of insertion to treat a variety of spinal disorders, including spinal deformity.

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

• The Journal of Industrial Distribution & Business
• /
• v.7 no.4
• /
• pp.17-31
• /
• 2016

Purpose - The purpose of this study is to discuss problems and propose the direction of the current international university placement program in the country by deriving the concept of and developing questionnaires for 'service satisfaction'. Research design, data, and methodology -The SERVQUAL scale was used to measure the quality of services. In this study reliability, empathy, and assurance are used to measure the quality of the international university placement system, considering the characteristics of the education environment. The survey data is based on responses from 280 students who either have completed the international university placement system and currently studying abroad, or are studying the domestic part of the program. Cronbach's Alpha value was calculated. To verify the hypothesis, the multiple regression analysis was conducted. Results - According to the study, the satisfaction rate of the domestic learning process is heavily relied on reliability and empathy; particularly empathy on the curriculum of the international placement program. The study also found that to make students to feel a high sense of achievement, the satisfaction rate is a priority which should be improved. Conclusions - The results from the analysis of the hypothesis shows that the satisfaction rate of students who are taking the domestic part of the international university placement program should be increased.

• Journal of Practical Engineering Education
• /
• v.6 no.2
• /
• pp.99-104
• /
• 2014

Most important Industry-Academy cooperation program in university is field placement for increasing ability work. Purpose of field placement are to provide training opportunities and to increase competition in job market. But field placement may vary depending on the size of the industry and the students' ability. In severe cases, some students did not practicing but simple work. So it is difficult to achieve the purpose of practical training. Thus, we propose a method for increasing field training ability and activation field placement using Base camp.