• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.274-281
• /
• 1999

Many popularly used recent high-sped and high-capacity disks use the Zone-Structured in which a disk consists of multiple zones. A zone-structured disk has multiple zones, and the bandwidth and the number of sectors in each zone are different from each other. When the previous studies that modeled disks based on the assumption that the number of sectors in all tracks are same are applied to the zone-structured disk and the video data stored in a round-robin manner are read out with the SCAN technique, the transfer rate of the disk is fixed with that of the innermost zone. And excessive disk space is wasted either. To resolve the problem, this paper proposes a method for reconstructing the physical zones into logical zones by split and merge operations and develops a method for determining optimum transfer block size.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1992.10a
• /
• pp.2-2
• /
• 1992

최근 여러 분야에서 컴퓨터의 용도가 확산되고 더 높은 computing power에 대한 요구가 증가함에 따라, 컴퓨터의 성능을 향상시키기 위하여 프로세서의 고속화와 함께 시스템 구조의 개선을 위한 많은 연구가 진행되고 있다. 한 시스템내에 여러 개의 CPU들이 존재하는 다중프로세서 시스템(multiprocessor system) 구조를 가진 슈퍼미니급 중형 컴퓨터들은 상호연결망으로서 버스(bus) 방식을 많이 채택하고 있다. 버스 구조는 하드웨어가 간단하여 구현이 용이하지만, 여러 개의 시스템 지원들(프로세서들, 기억장치 모듈들 및 입출력 모듈들)이 버스를 공유하기 때문에 경합으로 인한 지연 시간이 발생하게 된다. 이러한 지연 시간으로 인한 성능 저하를 개선하는 방법으로는 버스 수의 증가와 최적 통제 프로토콜의 설계가 있다. 본 연구에서는 여러 개의 버스를 가진 다중프로세서 시스템에서 4가지 대표적인 버스 중재 프로토콜들에 대해 성능을 분석, 비교하여 최적 프로토콜을 제시하고자 한다. 이러한 대규모 하드웨어에 의하여 구현되는 시스템에서 주요 설계 요소들에 따른 시스템 성능 분석과 비교는 설계 단계에서 필수적인 과정이다. 그러나 하드웨어를 만들어서 분석하는 방법은 시간과 비용이 많이 소요되기 때문에 소프트웨어 시뮬레이션 방법이 널리 사용되고 있다. 본 연구팀에서는 시뮬레이션 전용언어인 SLAM II를 이용하여 다중프로세서 시스템의 시뮬레이터를 개발하고, 버스중재 프로토콜(bus arbitration protocol)을 용이하게 변경할 수 있도록 하여 각각의 성능을 비교하였다. 이 연구에서 비교된 프로토콜들은 고정-우선순위 방식(fixed-priority scheme), FIFO(first-in first-out) 방식, 라운드-로빈 방식(round-robin scheme), 및 회전-우선순위 방식(rotating-priority scheme) 등이다. 실험은 시스템의 주요 요소들인 프로세서와 기억장치 모듈 및 버스의 수들을 변경시킴으로써 다양한 시스템 환경에 대한 분석을 시도하였다. 작업 부하가 되는 기하장치 액세스 요구간 시간가격(inter-memory access request time interval)은 필요에 따라서 고정값 또는 확률 분포함수를 사용하였다. 특히, 실행될 프로그램의 특성에 따라 각 프로토콜의 성능이 다르게 나타날 수 있음을 검증하였으며, 기억장치의 지역성(memory locality)에 대한 프로토콜들의 성능도 비교하였다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.5
• /
• pp.111-118
• /
• 2019

Recent graphic processing units (GPUs) provide high throughput by using powerful hardware resources. However, massive memory accesses cause GPU performance degradation due to cache inefficiency. Therefore, the performance of GPU can be improved by reducing thread parallelism when cache suffers memory contention. In this paper, we propose a dynamic warp scheduler which controls thread parallelism according to degree of cache contention. Usually, the greedy then oldest (GTO) policy for issuing warp shows lower parallelism than loose round robin (LRR) policy. Therefore, the proposed warp scheduler employs the LRR warp scheduling policy when Miss Status Holding Register(MSHR) utilization is low. On the other hand, the GTO policy is employed in order to reduce thread parallelism when MSHRs utilization is high. Our proposed technique shows better performance compared with LRR and GTO policy since it selects efficient scheduling policy dynamically. According to our experimental results, our proposed technique provides IPC improvement by 12.8% and 3.5% over LRR and GTO on average, respectively.

• Journal of the Korea Institute of Building Construction
• /
• v.22 no.6
• /
• pp.577-583
• /
• 2022

On large-scale sites, concrete is often delivered from a number of ready-mixed concrete companies, but even if the same concrete mixture table is used, it is thought that there will be a difference in quality due to differences in materials and manufacturing equipment. Due to a lack of previous research in this area, this study measured the properties of fresh concrete, compressive strength, and chlorine ion diffusion coefficient using the concrete supplied by 12 ready-mixed companies in Busan. The fresh concrete properties met the criteria. The compressive strength increased by 137% for 30MPa, 131% for 45MPa, and 117% for 80MPa by specified compressive strength. For the chlorine ion diffusion coefficient, the average value for each specified compressive strength could be derived without significant variation. The higher the compressive strength, the greater the deviation , and the lower the compressive strength, the greater the deviation in the chlorine ion diffusion coefficient.

• Journal of the Korean Geotechnical Society
• /
• v.38 no.11
• /
• pp.31-42
• /
• 2022

This study verified numerical analysis of the liquefaction phenomenon using LEAP-2017 international round-robin centrifuge test results. Dynamic centrifuge test is performed by applying a 1 Hz tapered sine wave to the model soil deposit, which was formed under a water table in a surface slope of 5° using Ottawa F-65 sand. A numerical model was made on a prototype scale and analyzed using the finite difference method in 2D and 3D conditions. The analyses were verified for acceleration and pore-water pressure histories with depth and residual displacement. Verification results revealed that all numerical liquefaction models agree reasonably with the test result for acceleration histories but not for pre-water pressure histories. Numerical analyses showed much smaller residual displacement than the centrifuge test. Thus, it is necessary to compare the results of numerical analysis with the centrifuge test performed by other institutes in the future.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.210-213
• /
• 2010

최근 사용자의 멀티미디어에 대한 요구의 증가가 VOD (Video-on-Demand) 서비스를 발전시키게 되었다. VOD는 엔터테인먼트나 원격 교육, 광고 및 정보 등 많은 분야에서 사용되고 있다. 이러한 VOD 서비스는 많은 디스크 I/O와 네트워크 I/O를 요구하며 기존 웹 서버 시스템과 비교했을 때 오랜 시간동안 서비스를 해야 하는 특징을 가지고 있다. 또한 VOD 서비스는 많은 네트워크와 디스크의 대역폭을 요구하며, 서비스의 QoS에 민감해서 사용자 응답시간이 길어지면 사용자 요청의 취소율이 높아지게 된다. 따라서 불만족스러운 서비스의 증가로 네트워크 부하만 증가하게 된다. 이러한 기존 웹 서버 환경과는 다른 부하의 패턴이 있는 VOD 서비스 환경에서는 부하를 균형적으로 분배하여 서비스의 QoS를 높이는 것이 매우 중요하다. 본 논문에서는 분산 VOD 시스템 환경에서 부하를 효율적으로 분산하기 위해 계층형 분산 VOD 시스템 모델과 사용자 요청 패턴의 히스토리와 유전 알고리즘을 기반으로 한 스케줄러를 제안한다. 본 논문에서 제안한 계층형 분산 VOD 시스템 모델은 서버들을 지역적으로 분산하고 제어 서버를 지역마다 설치하여 지역에 있는 VOD 서버들을 관리하도록 구성한다. 사용자 요청을 지역 서버군 내에서 분산시키기 위해서 히스토리를 기반으로 한 유전 알고리즘을 사용한다. 이러한 히스토리 정보를 기반으로 유전 알고리즘의 적합도 함수에 적용하여 VOD 시스템을 위한 유전 알고리즘과 유전 연산을 구현한다. 본 논문에서 제안한 부하 분산 알고리즘은 VOD 서비스 환경에서 사용자 요구에 대한 부하를 보다 정확하게 예측하여 부하를 분산할 수 있다. 본 논문에서 제안한 계층형 분산 VOD 시스템의 부하 분산 알고리즘의 성능을 테스트하기 위해 OPNET 기반 시뮬레이터를 구현한다. 라운드로빈(round-robin) 방식과 랜덤(random) 방식과의 비교 실험을 통해 본 논문에서 제안한 부하 분산 알고리즘의 성능을 평가한다. 비교 실험을 통해 본 논문에서 제안한 알고리즘이 보다 안정적인 QoS를 제공하는 것을 보여준다.

• Journal of Internet of Things and Convergence
• /
• v.9 no.3
• /
• pp.1-6
• /
• 2023

One of the economical ways to satisfy the quality of service desired by the user in a web service environment is to adjust the size of the object. To this end, this study finds the maximum size of objects that satisfy this constraint when the mean response time is given below an arbitrary threshold for quality of service. It can be inferred that in the steady state of system, the mean response time in the deterministic model by using the round-robin will be the same as that of the queueing model following the general distribution. Based on this, analytical formulas and procedures for finding the maximum object size are obtained. As a service distribution of web traffic, the Pareto distribution is appropriate, so the maximum object size is computed by applying the M/G(Pareto)/1 model and the M/G/1/PS model using exponential distribution as computational experience. Performance evaluation through numerical calculation shows that as the shape parameter in the Pareto distribution increases, the M/G(Pareto)/1 model and M/G/1/PS model have the same maximum object size. The results of this study can be used to environments where objects can be sized for economical web service control.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.11-18
• /
• 2004

The on-line games in the past were played by only two persons exchanging data based on one-to-one connections, whereas recent ones (e.g. MMORPG: Massively Multi-player Online Role-playings Game) enable tens of thousands of people to be connected simultaneously. Specifically, Korea has established an excellent network infrastructure that can't be found anywhere in the world. Almost every household has a high-speed Internet access. What made this possible was, in part, high density of population that has accelerated the formation of good Internet infrastructure. However, this rapid increase in the use of on-line games may lead to surging traffics exceeding the limited Internet communication capacity so that the connection to the games is unstable or the server fails. expanding the servers though this measure is very costly could solve this problem. To deal with this problem, the present study proposes the load distribution technology that connects in the form of local clustering the game servers divided by their contents used in each on-line game reduces the loads of specific servers using the load balancer, and enhances performance of sewer for their efficient operation. In this paper, a cluster system is proposed where each Game server in the system has different contents service and loads are distributed efficiently using the game server resource information such as CPU utilization. Game sewers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 12%, 10% respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.257-266
• /
• 2007

In On-Chip bus, the arbitration scheme is one of the critical factors that decide the overall system performance. The arbitration scheme used in traditional shared bus is the master-side arbitration based on the request and grant signals between multiple masters and single arbiter. In the case of the master-side arbitration, only one master and one slave can transfer the data at a time. Therefore the throughput of total bus system and the utilization of resources are decreased in the master-side arbitration. However in the slave-side arbitration, there is an arbiter at each slave port and the master just starts a transaction and waits for the slave response to proceed to the next transfer. Thus, the unit of arbitration can be a transaction or a transfer. Besides the throughput of total bus system and the utilization of resources are increased since the multiple masters can simultaneously perform transfers with independent slaves. In this paper, we implement and analyze the arbitration schemes for the Multi-Layer AHB BusMatrix based on the slave-side arbitration. We implement the slave-side arbitration schemes based on fixed priority, round robin and dynamic priority and accomplish the performance simulation to compare and analyze the performance of each arbitration scheme according to the characteristics of the master and slave. With the performance simulation, we observed that when there are few masters on critical path in a bus system, the arbitration scheme based on dynamic priority shows the maximum performance and in other cases, the arbitration scheme based on round robin shows the highest performance. In addition, the arbitration scheme with transaction based multiplexing shows higher performance than the same arbitration scheme with single transfer based switching in an application with frequent accesses to the long latency devices or memories such as SDRAM. The improvements of the arbitration scheme with transaction based multiplexing are 26%, 42% and 51%, respectively when the latency times of SDRAM are 1, 2 and 3 clock cycles.

• International Journal of Highway Engineering
• /
• v.13 no.1
• /
• pp.157-168
• /
• 2011

Recently, the cases of freeze-thaw distress on concrete pavement in domestic have been reported periodically. Hereupon, the necessity to establish the standard of spacing factor came to the fore. The test method for analyzing spacing factor is provided in the standard of ASTM C 457. Since researchers tend to judge study results subjectively, the results should be revised throughly. Image analysis program for determining the characteristics of air-void system on hardened concrete identify air void through the difference of a color. The pixel intensity values used in this program have a significant effect on the analysis results. This study compared the automated void count by varying pixel intensity values with the manual void count in order to determine the optimum range of pixel intensity values. Also, this study analyzed the air-void characteristics on eight kinds of concrete mixtures. In this study, it was confirmed that the variation of void counted manually was around 10% from the results of round robin test, and that the optimum range of pixel intensity values is around 80~90. And it was also confirmed that air content (as a whole) was increased generally and spacing factor was decreased by increasing air-entrainer content. But some concrete mixtures showed a tendency that air content was constant and spacing factor was decreased by increasing air-entrainer content. This causes the air entrained by air-entrainer has more influence on spacing factor than air content. Also, the deviation of spacing factor by cutting position of concrete specimen was about 30~100${\mu}m$ because of the limit of 2-D image analysis. The additional study about variation of spacing factor by cutting position of concrete specimen will be performed later.