• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.511-518
• /
• 2002

Symmetric Multiprocessors (SMP) has emerged as an important and cost-effective platform for high performance parallel computing. Scheduling of parallel tasks and communications of SMP is important because the choice of a scheduling discipline can have a significant impact on the performance of the system. In this paper, we present a task duplication based scheduling scheme for bus-based SMP. The proposed scheme pre-allocates network communication resources so as to avoid potential communication conflicts. The performance of the proposed scheme has been observed by comparing the schedule length under various number of processors and the communication cost.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.1015-1017
• /
• 2005

본 논문에서는 웹기반의 그리드 컴퓨팅 환경에서 시스템을 모델링하고 스케줄링 기법을 시뮬레이션 할 수 있는 그리드 스케줄링 플랫폼을 설계하고 구현하였다. 구현한 웹기반 그리드 스케줄링 플랫폼은 자바 환경의 그리드 스케줄링 툴킷인 GridSim을 시뮬레이션 도구로 활용하였으며, 자원 모델링, 작업 모델링, 알고리즘 컴파일, 시뮬레이션을 웹 환경에서 빠르게 수행할 수 있다. 구축한 스케줄링 플랫폼은 향후 그리드 연구에 기반구조로 활용될 수 있으며 스케줄링 기법의 성능 분석을 위한 도구로 사용될 수 있다.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.9
• /
• pp.399-406
• /
• 2023

Cloud computing has been evolved to support edge computing architecture that combines fog management layer with edge servers. The main reason why it is received much attention is low communication latency for real-time IoT applications. At the same time, various cloud task scheduling techniques based on artificial intelligence have been proposed. Artificial intelligence-based cloud task scheduling techniques show better performance in comparison to existing methods, but it has relatively high scheduling time. In this paper, we propose a deep learning-based dynamic scheduling with multi-agents supporting scalability in edge computing environments. The proposed method shows low scheduling time than previous artificial intelligence-based scheduling techniques. To show the effectiveness of the proposed method, we compare the performance between previous and proposed methods in a scalable experimental environment. The results show that our method supports real-time IoT applications with low scheduling time, and shows better performance in terms of the number of completed cloud tasks in a scalable experimental environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.425-427
• /
• 2000

접속이 빈번한 웹사이트들의 서버는 동시에 수백개의 커넥션을 처리해야 하므로 효율적인 커넥션 스케줄링 기법이 요구된다. 기존의 SRPT(Shortest Remaining Processing Time first)를 이용한 커넥션 스케줄링 기법은 가장 짧은 처리시간이 남아있는 커넥션을 먼저 처리함으로써 각 문서에 대한 응답시간의 향상을 가져왔다. 그러나, 클라이언트의 요청에 의해 형성된 하나의 커넥션으로 다수의 정적 문서들을 동시에 요청할 수 있는 HTTP/1.1에서 크기가 다른 다수의 정적 문서들이 요청됐을 때, 각 문서에 대한 응답시간은 빠를 수 있으나 커넥션에 대한 전체 응답시간의 향상은 보장할 수 없다. 따라서 본 논문은 HTTP/1.1 환경에서 웹 서버의 CPU와 메모리의 부하가 높을 때 발생되는 성능저하의 단점을 보완하면서 정적 문서 요청에 관한 응답시간을 향상시키는 pipelining 기반의 커넥션 스케줄링 기법을 제시한다. 실험을 통해서 제안한 커넥션 스케줄링 기법이 전체적으로 커넥션에 대한 빠른 응답시간을 보이고, 스케줄링 윈도우의 사용으로 스케줄링에 공평성을 보임을 알 수 있다.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.521-528
• /
• 2004

In this-paper, we propose a new task scheduling scheme for bus-based cluster architectures and analyze performance of the scheduling scheme which has been implemented in a PC cluster. The implemented scheme schedules the tasks of a task graph to the processors of a PC cluster, and it reduces parallel execution time by selectively duplicating critical tasks using heuristic. Experimental results show that the proposed scheduling scheme produces better parallel execution time than the other scheduling scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1820-1831
• /
• 2011

When both types of periodic and aperiodic tasks are required to run on a sensor node platform with limited energy resources, we propose an energy-efficient hybrid task scheduling technique that guarantees the deadlines of real-time tasks and provides non-real-time tasks with good average response time. The proposed hybrid task scheduling technique achieved better performance than existing EDF-based DVS scheduling techniques available in the literature, the FIFO-based TinyOS scheduling technique, and the task-clustering based non-preemptive real-time scheduling technique.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.337-344
• /
• 2004

In this paper, we propose a thread scheduling algorithm for faster packet processing on the network processors with multithreaded multiprocessor architecture. To implement the proposed algorithm. we derived several basic parameters related to the thread scheduling and included a new parameter representing the packet contents and the multithreaded architecture. Through the empirical study using a simulator, we proved the proposed scheduling algorithm provides better throughput and load balancing compared to the general thread scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7A
• /
• pp.717-724
• /
• 2006

In order to maximize the throughput and provide the fairness between users in MIMO-OFDM system, FATM(fairness-aware throughput maximization) scheduling algorithm was proposed. In this paper, a QoS-aware scheduling algorithms for MINO-OFDM system are proposed, each of which is based on FATM. These scheduling algorithms aim to satisfy the different service requirements of various service classes. Three proposed QoS scheduling algorithms called SPQ (Strict Priority Queueing), DCBQ (Delay Constraint Based Queuing), HDCBQ (Hybrid Delay Constraint Based Queuing) are compared through computer simulations. It is shown that HDCBQ algorithm outperforms other algorithms in satisfying different requirements of various service classes.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.156-164
• /
• 2000

실시간 시뮬레이션이란 시뮬레이션 모델의 시간 진행을 실시간에 기반하여 수행하는 시뮬레이션을 말한다. 이러한 시뮬레이션은 가상 운전 교육 프로그램 또는 컴퓨터를 이용한 컨트롤 시스템의 검증 등에 사용된다. 본 논문에서는 DEVS 형식론［Zei84］을 확장한 RT-DEVS 모델의 실시간 시뮬레이션에서 주어진 모델의 스케줄링 가능성에 대한 분석 기법을 다룬다. 제한된 시스템 리소스 상에서 여러 개의 모델을 실시간에 기반하여 시뮬레이션하려면 스케줄링이 필요하다. 실시간 스케줄링 가능성을 분석하기 위하여 시뮬레이션 모델에 제한점이 주어진다. 본 논문에서는 이러한 제한점을 알아보고 이를 만족하는 시뮬레이션 모델의 상태 궤적 그래프의 합성을 통하여 전체 시뮬레이션 시스템의 스케줄링 가능성을 알아보는 기법을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1238-1244
• /
• 2008

Each layer operates independently in the present network structure. However, the importance of designing cross layer, which adapt between different layers, is on the rise, because of adapt to the variable communication environments. In this paper, we investigate the scheduling techniques of the cross layer. we research conventional scheduling methods and propose the multimedia service scheduling method which will be applied in future wireless communication environments. This method considers the diversity of multimedia service and manages the radio resources efficiently Moreover, we apply AMC for flexibility and improve the performance of the scheduling method. The proposed method is verified through the simulation appying variable environments.