• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2005년도 춘계학술대회 논문집
• /
• pp.29-33
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.523-530
• /
• 2016

We use both theoretical analysis and simulations to study the impact of crosspoint-queued (CQ) buffer size on CQ switch throughput and delay performance under different traffic models, input loads, and scheduling algorithms. In this paper, we present the following. 1) We prove the stability of CQ switch using any work-conserving scheduling algorithm. 2) We present an exact closed-form formula for the CQ switch throughput and a non-closed-form but convergent formula for its delay using static non-work-conserving random scheduling algorithms with any given buffer size under independent Bernoulli traffic. 3) We show that the above results can serve as a conservative guide on deciding the required buffer size in pure CQ switches using work-conserving algorithms such as the random scheduling, under independent Bernoulli traffic. 4) Furthermore, our simulation results under real-trace traffic show that simple round-robin and random work-conserving algorithms can achieve quite good throughput and delay performance with a feasible crosspoint buffer size. Our work reveals the impact of buffer size on the CQ switch performance and provides a theoretical guide on designing the buffer size in pure CQ switch, which is an important step toward building ultra-high-speed switch fabrics.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권1호
• /
• pp.24-30
• /
• 2006

The Controller Area Network (CAN) is being widely used for real-time control application and small-scale distributed computer controller systems. When the stuff bits are generated by bit-stuffing mechanism in the CAN network, it causes jitter including variations in response time and delay In order to eliminate this jitter, stuff bits must be controlled to minimize the response time and to reduce the variation of data transmission time. This paper proposes the method to reduce the stuff bits by restriction of available identifier and bit mask using exclusive OR operation. This da manipulation method are pretty useful to the real-time control strategy with respect to performance. However, the CAN may exhibit unfair behavior under heavy traffic conditions. When there are both high and low priority messages ready for transmission, the proposed precedence priority filtering method allows one low priority message to be exchanged between any two adjacent higher priority messages. In this way, the length of each transmission delays is upper bounded. These procedures are implemented as local controllers for the ISHURO(Inha Semvung Humanoid Robot).

• 정보처리학회논문지C
• /
• 제12C권3호
• /
• pp.387-394
• /
• 2005

IEEE 802.11e를 포함한 IEEE 802.11x의 모든 매체접속제어 부계층은 형태는 다르지만 공통적으로 CP(Contention Period)와 CFP(Contention Free Period) 서비스 기능을 정의하고 있다. 본 논문에서는 현재 여러IEEE 802.11x PCF나 IEEE 802.11e HCCA 상에서 서비스되고 있는 기존 라운드로빈 방식의 폴링 기법을 수정하여 트래픽의 부하가 큰 채널을 선택하여 가중치를 주어 서비스할 수 있는 New-CF 방식을 제안하였다. NS-2로 기존 기법과의 비교를 수행한 시뮬레이션 결과 전체적인 통과율이 상승한 것을 검증하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.729-732
• /
• 2006

본 논문에서는 VOD 서 스트리밍 데이터를 효율적으로 서비스할 수 있는 Consistency 알고리즘을 제시하고 개발한다. 본 논문에서는 일반적인 계산 용도로 사용되는 barrier 메커니즘을 미디어 플레이 최소 단위인 (SH, GOP) 미디어 데이터에 서비스할 수 있도록 한다. VOD 시스템에서 RTP 패킷 데이터는 빠른 미디어 서비스 제공을 위하여 본 논문에서 제시한 consistency 알고리즘을 설계 및 구현하였다. 또한 이 알고리즘에 추가 기능으로 시간 동기화에 따라 공유메모리에 존재하는 멀티미디어 데이터의 순서화된 서비스를 보장하는 것이다. 그리고 예상 페이징 기법을 적용하여 효율적인 버퍼링 기능을 보장하는 것이다. 그리고 본 논문에서 제시한 알고리즘에 대한 성능 평가를 실시하였다.

• 정보처리학회논문지A
• /
• 제9A권4호
• /
• pp.503-510
• /
• 2002

본 논문에서는 범용 내장형 컴퓨터 시스템을 설계하고 구현한다. 범용 내장형 컴퓨터 시스템의 가장 중요한 점은 확장성과 유연성이다. 개발된 시스템은 세 개의 모듈로 나뉘어 구성되며, 소프트웨어는 하드웨어에 독립적인 응용 프로그램 인터페이스를 제공한다. 또한 공개 실시간 운영체제인 uC/OS-II의 기능을 확장하여 개발된 범용 내장형 컴퓨터 시스템에 이식한다. 확장된 uC/OS-II는 여러 프로세스들이 같은 우선순위를 가지는 것을 지원하고, 같은 우선순위의 프로세스들에 대해서는 라운드-로빈 방식으로 스케줄링 된다.

• 한국지진공학회논문집
• /
• 제25권3호
• /
• pp.93-102
• /
• 2021

The dynamic characterization of a three-story auxiliary building in a nuclear power plant (NPP) constructed with a monolithic reinforced concrete shear wall is investigated in this study. The shear wall is subjected to a joint-research, round-robin analysis organized by the Korea Atomic Energy Research Institute, South Korea, to predict seismic responses of that auxiliary building in NPP through a shake table test. Five different intensity measures of the base excitation are applied to the shaking table test to get the acceleration responses from the different building locations for one horizontal direction (front-back). Simultaneously to understand the global damage scenario of the structure, a frequency search test is conducted after each excitation. The primary motivation of this study is to develop a nonlinear numerical model considering the multi-layered shell element and compare it with the test result to validate through the modal parameter identification and floor responses. In addition, the acceleration amplification factor is evaluated to judge the dynamic behavior of the shear wall with the existing standard, thus providing theoretical support for engineering practice.

• ETRI Journal
• /
• 제41권2호
• /
• pp.197-206
• /
• 2019

Software-defined networking (SDN) is a modern approach for current computer and data networks. The increase in the number of business websites has resulted in an exponential growth in web traffic. To cope with the increased demands, multiple web servers with a front-end load balancer are widely used by organizations and businesses as a viable solution to improve the performance. In this paper, we propose a load-balancing mechanism for SDN. Our approach allocates web requests to each server according to its response time and the traffic volume of the corresponding switch port. The centralized SDN controller periodically collects this information to maintain an up-to-date view of the load distribution among the servers, and incoming user requests are redirected to the most appropriate server. The simulation results confirm the superiority of our approach compared to several other techniques. Compared to LBBSRT, round robin, and random selection methods, our mechanism improves the average response time by 19.58%, 33.94%, and 57.41%, respectively. Furthermore, the average improvement of throughput in comparison with these algorithms is 16.52%, 29.72%, and 58.27%, respectively.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• 한국멀티미디어학회논문지
• /
• 제24권1호
• /
• pp.95-105
• /
• 2021

In the case of laptops and tablet PC's that replace desktop, it uses the Windows operating system to provide various functions depending on operating system dependency, the Windows operating system does not support real-time processing because it uses multi-level feedback queue scheduling that extends round-robin scheduling. Also, since the initial value of Local APIC Counter can not be obtained from the Windows 8, the real-time processing function provided through the existing RTiK does not work. In this paper, we calculate Local APIC Counter value by using MSR_FSB_FREQ register to support real-time processing function on tablet PC's. We designed and implemented RTiK+, which provides real-time processing function to guarantee the periodicity by calculating the operation time of accurate timer. In order to verify and evaluate the performance of the implemented the RTiK+, the period was measured by using the Read Time-Stamp Counter(RDTSC) instruction and it was confirmed that it operates normally at 1ms and 0.1ms period.