• The Journal of the Korea Contents Association
• /
• v.22 no.8
• /
• pp.81-93
• /
• 2022

Recently, research on processing a large-capacity graph using GPUs has been conducting. In order to process a large-capacity graph in a GPU with limited memory, the graph must be divided into subgraphs and then processed by scheduling subgraphs. In this paper, we propose an efficient graph algorithm processing scheme in GPU environments with limited memory and performance evaluation. The proposed scheme consists of a graph differential subgraph scheduling method and a graph segmentation method. The bulk graph segmentation method determines how a large-capacity graph can be segmented into subgraphs so that it can be processed efficiently by the GPU. The differential subgraph scheduling method schedule subgraphs processed by GPUs to reduce redundant transmission of the repeatedly used data between HOST-GPUs. It shows the superiority of the proposed scheme by performing various performance evaluations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.9
• /
• pp.1704-1709
• /
• 2016

In this paper, we propose efficient uplink data transmission method in ultra dense wireless networks as in intra-aircraft, where large-scale APs and wireless sensors are deployed. In the ultra dense wireless networks, a performance degradation is inevitable due to the inter-AP interference. However, the performance degradation can be avoided if a scheduling algorithm can estimate the amount of interference caused by each wireless sensor and reflects it. SGIR (Signal-to-Generating Interference Ratio) based scheduling algorithms is a typical example. Unfortunately, the scheduling algorithms based on the interference caused by wireless sensors necessarily yield large scale exchange of information through backhaul which connects APs. Therefore, we, in this paper, propose a novel scheme which can dramatically reduce the amount of information which are exchanged through backhaul connection. Monte-Carlo simulation results show that the proposed scheme can reduce the amount of backhaul traffic by 27% without loss of data transmission rate.

• Journal of Internet of Things and Convergence
• /
• v.10 no.3
• /
• pp.19-24
• /
• 2024

Recent advances in large-scale data processing technologies such as big data, cloud computing, and artificial intelligence have increased the demand for high-performance storage devices in data centers and enterprise environments. In particular, the fast data response speed of storage devices is a key factor that determines the overall system performance. Solid state drives (SSDs) based on the Non-Volatile Memory Express (NVMe) interface are gaining traction, but new bottlenecks are emerging in the process of handling large data input and output requests from multiple hosts simultaneously. SSDs typically process host requests by sequentially stacking them in an internal queue. When long transfer length requests are processed first, shorter requests wait longer, increasing the average response time. To solve this problem, data transfer timeout and data partitioning methods have been proposed, but they do not provide a fundamental solution. In this paper, we propose a dual queue based scheduling scheme (DQBS), which manages the data transfer order based on the request order in one queue and the transfer length in the other queue. Then, the request time and transmission length are comprehensively considered to determine the efficient data transmission order. This enables the balanced processing of long and short requests, thus reducing the overall average response time. The simulation results show that the proposed method outperforms the existing sequential processing method. This study presents a scheduling technique that maximizes data transfer efficiency in a high-performance SSD environment, which is expected to contribute to the development of next-generation high-performance storage systems

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1643-1651
• /
• 1999

Video-On-Demand (VOD) is expected to provide the user with interactive operations such as VCR functions. In particular, fast scan functions like “Fast Forward” of “Fast Backward” for a certain speedup playback are required. Since they require a significant amount of system resources, schemes to reduce bandwidth requirements for the network or disk are needed. In MPEG standard, Group-of-Pictures (GoP) is a random access unit which can be decoded independently. Since storing and transmitting a video stream based on GoP is efficient, it is practical to support fast scan functions based on GoP. In this paper, we present a dynamic transmission scheduling scheme to support fast scan functions with m-times normal playback rate for a stored video. The proposed scheme writes a transmission schedule whenever user requests a fast scan function. That is, the scheme constructs the data set to be smoothed by skipping GoPs according to a given speedup factor, and then writes the transmission schedule by applying a bandwidth smoothing. Finally, the scheme restarts the transmission of video data to a client according to the new schedule. The proposed scheme results in speeding up the playback rate by utilizing “GoP skipping”, and then reduces the computational overhead by applying a bandwidth smoothing based on GoP.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.85-88
• /
• 1997

Fieldbus is the real-time communication network for process control and manufacturing automation systems. IEC/ISA fieldbus was proposed as an international standard of fieldbus network. This protocol is operated on the basis of token-passing and scheduling mechanism. In this paper, we analyze the performance characteristics of the 1996 version of IEC/ISA fieldbus systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.38-40
• /
• 2012

비디오 서버는 다수의 비디오 요청을 동시에 서비스하기 때문에 통신망 대역폭을 공평하고 효율적으로 활용하는 것이 중요하다. 모바일 통신망에서 클라이언트들의 재생 버퍼 수준을 이용하여 VBR 비디오 스트림을 전송하는 스케쥴링 알고리즘들이 본 논문에서 제시되었다. 요청된 비디오 재생시 서비스 품질과 실시간적 성능을 향상시키기 위하여 비디오 서버는 일시적으로 버퍼 수준이 낮은 비디오 요청 작업을 우선적으로 서비스하고자 더 많은 대역폭을 할당하는 실시간 스케쥴링 알고리즘을 수행한다. 버퍼 수준이 상이한 모바일 클라이언트들에게 공평한 서비스와 부하 균형이 제공되는 시뮬레이션 결과가 나타났다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.331-332
• /
• 2009

서버가 전송하는 고품질의 MPEG 스트림을 클라이언트가 적시에 수신하고 재생하기 위해서는 통신망의 충분한 대역폭과 함께 효율적인 실시간 스케쥴링 방법이 반드시 필요하다. 본 논문에서 MPEG 비디오 스트림의 각 프레임은 단일 패킷으로 구성되며 프레임의 중요도에 따라 우선순위가 설정된다. 우선순위를 이용하는 스케쥴링 기법은 종료시한 내에 전송이 완료되는 패킷의 수를 최대화함으로써 멀티미디어 시스템의 실시간적 성능과 서비스 품질을 향상시킬 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.899-902
• /
• 2008

802.11 무선 LAN에서 MPEG-4 비디오 프레임들을 실시간으로 전송하기 위한 통신 스케쥴링 기법이 제시된다. 제시된 기법은 MPEG-4 비디오 전송시 프레임 크기에 따라 변동되는 작업부하를 효율적으로 처리할 수 있다. 본 연구의 목적은 종료시한 내에 전송되는 프레임의 수를 최대화하면서 종료시한 이후 전송이 완료된 프레임의 지연 시간을 최소화함으로써 실시간적 성능과 서비스 품질을 향상시키는 것이다.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.302-308
• /
• 2019

Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.43-52
• /
• 2005

In this paper, we introduce an adaptive radio resource allocation for IP-based mobile satellite services. We also present a synchronous multibeam CDMA satellite system using an orthogonal resource sharing mechanism among downlink beams for the adaptive packet transmission. The simulation results, using a Ka-band mobile satellite channel and various packet scheduling schemes, show that the proposed system and resource allocation scheme improves the beam throughput by more than two times over conventional systems. The simulation results also show that, in multibeam satellite systems, a system-level adaptation to a user's channel and interference conditions according to user locations and current packet traffic is more efficient in terms of throughput improvement than a user-level adaptation.