• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.248-256
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single－hop broadcast－and－select networks. The existing multicast scheduling algorithms do not concerned the previous state of receivers, but the proposed method call H－EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. the performance of proposed algorithms are evaluated through the computer simulation. They show the better Performance comparing with the existing multicast scheduling algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.101-102
• /
• 2012

안드로이드 플랫폼에 적합한 어플리케이션 보급이 급증하면서 안드로이드 가상머신인 달빅(dalvik)의 성능 향상을 위한 연구가 다양하게 시도되고 있다. 전력 공급이 제한적인 모바일 기기에서 효율적인 어플리케이션 실행을 위한 플랫폼의 성능 향상과 더불어 전력 에너지의 최적화된 소비가 중요한 이슈가 되고 있다. 이 논문은 달빅에서 실행되는 dex 파일의 바이트코드를 에너지 소비 중심으로 스케줄링하여 Java 어플리케이션의 전력 에너지 소비를 최적화하고자 하는 시도이다. 에너지 지향적인 스케줄링 기법은 전통적인 리스트-인스트럭션 스케줄링 기법을 기반으로 하였으며 스케줄링 전 후의 실험 결과를 제시하여 이 연구의 효과를 입증한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.137-144
• /
• 2016

In this paper, we have proposed a circuit complexity optimization ILP algorithm of high-level synthesis system for new multiprocessor design. We have analyzed to the operator characteristics and structure of datapath in the most important high-level synthesis. We also introduced the concept of virtual operator for the scheduling of multi-cycle operations. Thus, we demonstrated the complexity to implement a multi-cycle operation of the operator, regardless of the type of operation that can be applied for commonly use in the ILP algorithm. We have achieved is that standard benchmark model for the scheduling of the 5th digital wave filter, it was exactly the same due to the existing datapath scheduling results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.115-121
• /
• 2015

In this paper, we proposed an iterative data-flow optimal scheduling algorithm based on genetic algorithm for high-performance multiprocessor. The basic hardware model can be extended to include detailed features of the multiprocessor architecture. This is illustrated by implementing a hardware model that requires routing the data transfers over a communication network with a limited capacity. The scheduling method consists of three layers. In the top layer a genetic algorithm takes care of the optimization. It generates different permutations of operations, that are passed on to the middle layer. The global scheduling makes the main scheduling decisions based on a permutation of operations. Details of the hardware model are not considered in this layer. This is done in the bottom layer by the black-box scheduling. It completes the scheduling of an operation and ensures that the detailed hardware model is obeyed. Both scheduling method can insert cycles in the schedule to ensure that a valid schedule is always found quickly. In order to test the performance of the scheduling method, the results of benchmark of the five filters show that the scheduling method is able to find good quality schedules in reasonable time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1619-1622
• /
• 2003

방송환경은 서버에서 이동 클라이언트로의 대역폭보다 이동 클라이언트에서 서버로의 대역폭이 상당히 좁은 비대칭 구조이다. 이러한 방송환경을 기반으로 하는 이동 컴퓨팅 응용 시스템은 제한된 대역폭의 효율성과 거래의 수행성능을 향상시키기 위한 비용 효과적인 방법이 요구된다. 본 논문에서는 방송환경에서 이동 클라이언트의 갱신연산이 가능한 경우에 데이터의 현재성과 상호일관성을 만족하기 위한 효율적인 거래 스케줄링 알고리즘을 소개하고 시뮬레이션을 통하여 기존에 제안된 기법과 비친 분석함으로써 제안하는 알고리즘의 우수성을 확인한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.169-175
• /
• 2015

In the field of health informatics converging ICT technology and medicine technology, XML-based CCR document make sure the continuity and mobility of the information of patients. When a number of clients access CCR documents, wireless data broadcast that supports any number of clients can be an alternative for the scalability. In this paper, we propose a framework for wireless data broadcast of XML-based CCR documents. We design and implement the framework that can adopt various data scheduling algorithms and indexing schemes for the optimized performances of clients. The implemented framework shows the efficiency with simulations adopting various data scheduling algorithms and indexing schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1110-1112
• /
• 2013

본 논문에서는 무선방송 환경을 기반으로 한 서버가 클라이언트에게 데이터를 전송할 때 클라이언트의 질의처리 시간을 줄일 수 있는 방안을 제안한다. 서버는 무선방송을 통해 공간 데이터를 클라이언트에게 전송한다. 데이터 스케줄링 관리의 목적은 서버의 데이터 전송 순서를 효과적으로 배치하여 클라이언트의 질의처리시간을 줄이기 위함이다. 본 논문에서 서버는 클라이언트에게 위치기반 서비스를 제공하기 위하여 영역별 클라이언트의 수에 따라 hot-cold기법을 접목시킨 Number of Clients number Hot-Cold(NCHC)를 제안한다. NCHC의 장점은 클라이언트의 분포에 따라 데이터(객체)를 분류하기 때문에 클라이언트들의 평균 질의처리 시간을 줄일 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

In this paper, a new multicasting scheduling is proposed for WDM single-hop broadcast network. The main idea of traditional multicast scheduling algorithms is partitioning the multicast group into several subgroups to reduce the delay time after receiving previous message. Those partitioning algorithms are grouping method of receivers already tuned to transmitters wavelength. However, multicast scheduling shows better performance by considering the previous status of receivers. Thus, in this paper, a new subgrouping method is proposed to minimize delay through collecting the current status of receivers. This method is operated by using the tunable transceiver in WDM single hop broadcasting network and uses fixed control channel for collecting the status of receivers. In addition, we analyzed the performance of proposed method through the computer simulation and then compared with existing multicast scheduling algorithm.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.919-926
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single-hop broadcast-and-select networks. The existing multicast scheduling algorithms are focused on the partitioning a multicast group into several subgroups to reduce the delay time of each receiver. These partitioning algorithms are grouping method of the receivers already tuned to the transmitter's wavelength. However, these algorithms ignore the state of receivers, which leads to increase the number of subgroups and the delay time. Therefore, 1 propose two new multicast scheduling algorithms called H_EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. The performance of proposed algorithms are evaluated through the computer simulation. They show the better performance comparing with the existing multicast scheduling algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.139-144
• /
• 2023

Recently, many manufacturing companies are paying more attention to energy efficiency due to increased energy costs. Energy-efficient scheduling of production systems is a good method for energy efficiency improvement and cost reduction. In this research, we assumed the tire production problem and aim to construct a production scheduling considering specific shape module types, ordered amount for each tire, number of production modules, and the production time for each type. To facilitate effective production scheduling, we considered the types and number of shape modules currently available, and tire types that can be selected to be produced in the next stage were used as additional inputs, In addition to that, additional production was permitted to reduce the halt of production processing. Thus, an average production module utilization rate of about 62 percent was obtained.