• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.574-576
• /
• 2004

임베디드 시스템에서 입출력에서 소모되는 전력양은 상당한 수준이다. 입출력 장치에서의 수행되는 타스크의 순서를 정하여 전체적으로 입출력 장지에서의 휴식 시간을 최대한 많이 허락하는 기법이 필요하다. 기존의 연구는 입출력 장치 소비 전력 최소화를 위한 타스크 스케줄링 문제를 단순한 지협적인 휴리스틱에 기반하여 풀었다. 본 연구는 기존의 연구에서의 방법과는 달리 최적의 해를 내는 해법을 제시한다. 구체적으로 시간 제약 조건을 가진 저전력을 위한 타스크 스케줄링 문제를 ILP (integer linear programming) 기법을 적용하는 방법을 제시한다. 본 연구는 또한, 실험을 통해 주어진 시간 안에 최적의 해를 구하는 문제의 크기를 판단하는 기준을 제시할 수 있다는 의의를 가진다.

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

본 논문은 다중 프로세서에서의 다양한 실시간 스케줄링 기법을 지원하기 위해 객체 지향적으로 설계된 시뮬레이터를 제안한다. 다중 프로세서 기반 실시간 스케줄링의 특징을 반영한 설계 원칙에 따라 디자인 패턴을 적용하여 시뮬레이터의 재사용성과 확장성을 높였다.

• Journal of Advanced Navigation Technology
• /
• v.22 no.5
• /
• pp.367-374
• /
• 2018

A trajectory-based scheduling system is proposed for air traffic management using next generation aviation data communication link. Based on the service concept of 4-dimensional trajectory data link (4DTRAD) using air traffic serveices (ATS) datalink Baseline 2, a procedure for trajectory-based operation of an en-route flight is established and described in detail. To mitigate air traffic controllers' workload which might be caused by various and complicated data utilization, a prototype of the scheduling system, which predicts the aircraft trajectory based on the flight intents received by air traffic service system and provides advisory information for air traffic control, was developed. The simulation environment for trajectory based operation was built to validate the scheduling functionality of the prototype.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.530-540
• /
• 2015

Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

• Journal of Platform Technology
• /
• v.9 no.4
• /
• pp.51-59
• /
• 2021

In this paper, we propose a location-based service that the user's location is known by connection history to WI-FI AP installed in a facility known its location previously. The location-based service proposed in this paper manages job processing states of technicians who inspect and maintain the facility like elevator by using worker's location and arrival time information. The job scheduling management method proposed in this paper is based on previously scheduled arrival time and actual arrival time to a target facility. And we experimentally implemented the inspection and maintenance system of an elevator to show the feasibility of job schedule management based on location and arrival time information acquired from Wi-Fi AP connection history. Our experimental implementation shows that our proposed method is usefulness in the field of the inspection and maintenance of a facility.

• Journal of Platform Technology
• /
• v.10 no.1
• /
• pp.11-19
• /
• 2022

In this paper, we propose a location-based service that the user's location is known by connection history to WI-FI AP installed in a facility known its location previously. The location-based service proposed in this paper manages job processing states of technicians who inspect and maintain the facility like elevator by using worker's location and arrival time information. The job scheduling management method proposed in this paper is based on previously scheduled arrival time and actual arrival time to a target facility. And we experimentally implemented the inspection and maintenance system of an elevator to show the feasibility of job schedule management based on location and arrival time information acquired from Wi-Fi AP connection history. Our experimental implementation shows that our proposed method is usefulness in the field of the inspection and maintenance of a facility.

• Journal of Satellite, Information and Communications
• /
• v.12 no.3
• /
• pp.8-14
• /
• 2017

In 4G mobile communication, data services of mobile communication began to be provided in earnest. As a result, services such as the internet and multimedia including the video have become the main contents in the recent wireless traffic. Accordingly, research on 5G mobile communication with higher transmission rate has been actively carried out. 5G mobile communication is expected to be based on 4G for compatibility with existing terminals. Therefore, the simulation of this paper is based on 4G and we propose a new user scheduling scheme based on the Max throughput scheduling algorithm to improve system performance. This paper derives the frequency efficiency and fairness to compare the existing user scheduling algorithm with the proposed user scheduling algorithm. The proposed scheme shows better frequency efficiency and fairness than Max throughput in all situations. This paper contributes to the research for improving the system performance of 5G mobile communication technology, and I hope that it will help some of the ongoing standardization work.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.1-17
• /
• 2011

The performance of DHCS depends on the algorithm which schedules input DAG. However, as the task scheduling problem in DHCS is an NP-complete problem, heuristic approach has to be made. Task scheduling algorithm consists of task prioritizing phase and processor allocation phase, and most of studies are considering both phases together. In this paper, we focus on task prioritizing phase and propose a WPD algorithm which is optimized for task duplication based processor allocation method. For an evaluation of the proposed WPD algorithm, we combined WPD algorithm with processor allocation phase of HMPID, HCPFD, HCT algorithms, which are using task duplication based processor allocation method. The results show that WPD algorithm makes a better use of task duplication than conventional task prioritizing methods and provides 9.58% better performance than HCPFD algorithm, 1.31% than HCT algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.708-714
• /
• 2014

Wireless sensor networks (WSNs) generally consist of densely deployed sensor nodes that depend on batteries for energy. Having a large number of densely deployed sensor nodes causes energy waste and high redundancy in sensor data transmissions. The problems of power limitation and high redundancy in sensing coverage can be solved by appropriate scheduling of node activity among sensor nodes. In this paper, we propose a cellular automata based node scheduling algorithm for prolonging network lifetime with a balance of energy savings among nodes while achieving high coverage quality. Based on a cellular automata framework, we propose a new mathematical model for the node scheduling algorithm. The proposed algorithm uses local interaction based on environmental state signaling for making scheduling decisions. We analyze the system behavior and derive steady states of the proposed system. Simulation results show that the proposed algorithm outperforms existing protocols by providing energy balance with significant energy savings while maintaining sensing coverage quality.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.33-39
• /
• 2014

How to transfer spatial data from server to client in wireless broadcasting environment is shown as following: A server arranges data information that client wants and transfers data by one-dimensional array for broadcasting cycle. Client listens data transferred by the server and returns resulted value only to server. Recently number of users using location-based services is increasing alongside number of objects, and data volume is changing into large amount. Large volume of data in wireless broadcasting environment may increase query time of client. Therefore, we propose Client based Data Scheduling (CDS) for efficient data scheduling in wireless broadcasting environment. CDS divides map and then calculates total sum of objects for each grid by considering number of objects and data size within divided grids. It carries out data scheduling by applying hot-cold method considering total data size of objects for each grid and number of client. It's proved that CDS reduces average query processing time for client compared to existing method.