• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.7-10
• /
• 2008

본 논문은 멀티에이전트 환경에서 에이전트간의 지식 이종성과 통신 가능성 분산 제어의 방법에 중점을 두고 협동을 위한 정보를 KQML을 통하여 메시지를 전달한다. 항공사, 숙박업소, 설명 정보를 제공하는 에이전트들로 구성하여 조정 에이전트로 하여금 다른 에이전트가 필요한 정보를 주는 투어 스케줄링 에이전트 시스템을 구현하여 여행 준비자들이 자유 투어 스케줄링을 계획하는데 필요한 정보를 제공하는 것을 목적으로 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.7-9
• /
• 2002

본 논문에서는 DSP 코드 생성시 어드레스 인스트럭션의 개수를 최소화하기위한 효과적 인 어드레스 코드 생성 기법을 제안하였다. 기존의 방법에서는 코드 스케줄링이 수행된 다음에 어드레스 코드가 생성되었다. 본 논문에서는 코드 스케줄링과 어드레스 코드 생성을 결합하였고, 어드레스 인스트럭션의 개수를 줄이기 위한 효과적인 스케줄링 방법을 제안하였다. 실험결과는 최근 연구에[6,8] 비해 23.7% 크기의 향상을 보여주었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.7-9
• /
• 2003

여러 지역에 산재되어 있는 고성능의 컴퓨팅 자원들을 이용하는 그리드에서는 어떠한 자원을 선택하느냐에 따라 응용 프로그램의 성능이 좌우된다. 본 논문에서는 단일 클러스터의 노드 개수에 우선한 스케줄링 방법과 노드의 속도를 우선으로 한 스케줄링 방법을 고려하였다. 이러한 실험을 위하여 스케줄링 구조를 설계하고 그리드 자원에서 실제 실험하여 결과를 비교하였다.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.25-35
• /
• 2005

The Rate Monotonic(RM) scheduling algorithm and Earliest Deadline First(EDF) scheduling algorithm are normally used in Real-Time scheduling algorithm. In those scheduling algorithm, we could predict the performance possibility with total utilization value of task group. But. it had problems with prediction of the boundedness in individual task when the utilization value was over in temporary task. In this paper, the suggested scheduling algorithm can predict task when the utilization value was over and it suggested the method of predicting scheduling possibility based on the utilization value of individual task as well. it predicted the boundedness of scheduling possibility test through simulation In Real-Time scheduling algorithm and analyzed the result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1631-1639
• /
• 2010

This paper proposes a scheduling algorithm that can reduce the power consumed for execution of application programs and the communication cost incurred due to dependencies among tasks. The proposed scheduling algorithm can increase energy efficiency of the DVS(Dynamic Voltage Scaling) by estimating laxity usage during scheduling, making up for conventional algorithms that apply the DVS after scheduling. Energy efficiency can be increased by applying the proposed algorithm to complex multimedia applications. Experimental results show that energy consumptions for executing HD MPEG4, MotionJPEG codec, MP3, and Wavelet have been reduced by 11.2% on the average, when compared to conventional algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.69-78
• /
• 2006

The client request scheduling techniques for web server can classified into the scheduling techniques considering a document size to be requested and not. The scheduling techniques considering a document site to be requested provides a better average response time than another As the size-based SRPT(Shortest Remaining Processing Time first) is typical, and the most of scheduling techniques considering a web document size are based on SRPT. Most of existing researches, however, have not considered the feature of HTTP/1.1 which enable the clients to request concurrent multiple inlined-contents in a HTML document via each connection. In this paper we propose a connection scheduling technique with the scheduling window which provides a better response time in HTTP/1.1. The experimental results show that the performance with the proposed approach is improved about $10\%$ more than the connection scheduling with SRPT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.304-310
• /
• 2009

In this paper, we evaluate the performance of VoIP in OFDMA-based relay systems with various capabilities of relays. We classify relays according to capability as "mid-capability (MC)" and "high-capability (HC)" relay. In system with HC relays, not only base station (BS) but also relay station (RS) performs scheduling at its ova whereas only BS performs scheduling in system with MC relays using the information reported by MS (i.e. the received signal-to-interference-plus-noise ratio (SINR) of mobile station (HS), the amount of MS traffic, etc). In system with MC relays, the controling overhead of BS is larger than that of system with HC relays. However, since BS has all MS information, efficient resource allocation and scheduling is possible. We derived the "average packet delay," "good packet ratio," and "cell goodput" in a VoIP environment. The simulation results demonstrate that the system with MC relays has better VoIP performance over that with HC relays.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.521-529
• /
• 2010

In this paper, we propose a new scheduling algorithms in OFDM systems to reduce inter-cell interference. The proposed algorithm applies different subcarrier allocation sequences for different cells which is optimized through integer programming to minimize inter-cell interference. System level simulation is executed to derive the performance of the proposed algorithm. Simulation results show that the proposed scheduling algorithm improves user fairness as well as throughput compared with previous algorithms and therefore improves support of user QoS.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.3-9
• /
• 2015

We investigate rate scheduling and power allocation problem for a delay constrained CDMA systems. Specifically, we determine an energy efficient scheduling policy, while each user maintains the short term (n time slots) average throughput. We consider a multirate CDMA system where multirate is achieved by multiple codes. Each code can be interpreted as a virtual user. The aim is to schedule the virtual users into each time slot, such that the sum of transmit energy in n time slots is minimized. We then show that the total energy minimization problem can be solved by a shortest path algorithm. We compare the performance of the optimum scheduling with that of TDMA-type scheduling.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.575-580
• /
• 2006

It is important matter that inflect well allocated frequency resource in cellular network and is still more serious element in environment that provide multimedia services. This paper describes model and algorithm that increase two elements that is frequency allocation and job scheduling that consider multimedia service traffic special quality by emphasis that do mapping present in CDMA cellular system. We proposed the model composed three parts (channel allocation algorithm, mapping algorithm and scheduling algorithm) and simulation results.