• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.277-279
• /
• 2003

본 논문에서는 최악 수행시간이 알려진 주기 및 비주기 실시간 태스크 집합에 대한 수락제어 기법을 제안한다. 제안된 수락제어 기법은 주기 및 비주기 태스크가 혼합된 태스크 집합에 대해 이용율 요구(utilization demands)를 계산하여 태스크의 수락여부를 결정한다. 이용율 요구는 혼합 태스크 집합의 모든 태스크가 종료시한 내에 수행을 마치기 위한 프로세서의 이용율로 정의된다. 따라서 제안된 수락제어 기법은 수락된 모든 태스크의 종료시한을 보장한다. 제안된 이용율 요구 분석에 의한 수락제어 기법은 복잡한 스케줄링 가능성 분석이 필요하지 않아서 실시간 수락제어를 가능하게 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.531-533
• /
• 2000

실시간 시스템은 신뢰성이 중요하므로 실시간 시스템을 설계하는데 있어서 각 태스크의 기능적인 정확성의 검증은 물론 모든 태TM크에 대한 시간적인 요구사항들을 보장해야만 한다. 본 논문에서는 이러한 조건 즉, 실시간 시스템의 정확성과 시간성 보장을 위하여 기존의 객체 지향적 모델을 기반으로 하는 실시간 시스템을 위한 정형명세 언어인 TSC(Timed State Chart)에 자원(resource)의 개념을 추가한 TSCR(Timed State Chart with Resource)를 제안한다. TSCR을 통하여 실시간 시스템의 다양한 요구 사항을 명세하며, 태스크들의 시간성 보장을 위한 스케줄링 가능성 분석(schedulability analysis)을 할 수 있다. 실시간 시스템의 대표적인 예로 철도 건널목 제어 시스템을 TSCR를 이용하여 명세한다.

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

무선 네트워크의 급격한 성장으로 기존의 전자우편, 멀티미디어 등의 응용을 이동 컴퓨팅 환경에서 보다 효과적으로 지원해야 할 필요성이 증대되었다. 기존 유선 네트워크 환경에서 사용자의 독립적 서비스 보장과 요구 비율에 따른 자원의 공정한 배분을 위해서 Fair Queueing 기법이 제안되었다. 이 Fair Queueing 기법을 무선 네트워크에 적용하려는 연구가 진행되고 있으나 무선 미디어 자원의 빈약성과 사용자 이동에 따른 오류 발생 가능성 등으로 인해 아직까지 체계적인 기술은 미비한 형편이다. 본 논문에서는 기존 Fair Queueing 기법에서 각 세션의 가중치를 조절하여 무선 네트워크 환경에서 사용자의 다양한 서비스 품질(QoS; Queueing of Service)을 지원하고 오류 발생시 급격한 서비스 품질 저하를 방지하는 패킷 서비스 기법을 제시하고 그 성능을 분석한다.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.367-379
• /
• 1994

This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

• Design Convergence Study
• /
• v.15 no.2
• /
• pp.37-52
• /
• 2016

The purpose of this study is to suggest functional priority to increase probability to be adopted by single-person household by designating single-person household as potential early adopter of smart home service. Smart home service is spread slowly for its value. This study applied diffusion of innovations theory to solve this problem. Single-person household who has no other family member who can take care of household is chosen as potential early adopter. This study tried to find grounds of functional priorities through an online survey. The survey questionnaires were composed as following. First, representative attributes of single- person household were reviewed, then measuring questions according to the attributes were recomposed based upon preceding study. After that, concept and status of smart home service were reviewed. and smart home service functions to be measured in this study were selected through analysis based upon representative cases, then Measuring questionnaire were made were three factors which chosen by referring to preceding study about perceived attributes of innovations applied to selected functions. As a result of analyzed 62 responses, except excluded functions which has perceived any special value, set priorites with 9 functions. These functional priorities obtained from these studies will play a role as fundamental data to provide valuable service to single-person household and have a meaning as a starting point to increase rate of adoption for smart home service.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.240-246
• /
• 2008

It has able to be possible that expression and store visual image from analog to digital without picture quality damaged via improvement of video compression technology. And also, It is possible to broadcasting digital image via transmission of digital image on MPEG-2 standardization. For this reason, the broadcasting business owners have converted broadcasting service from analog to digital. But, local SO(System Operator) has a difficult point which secure HD(High Definition) broadcasting program. In this paper, we designed and implemented Scheduling System for MPEG-2 Digital Broadcasting which gather HD broadcasting program from major broadcasting business owners and broadcast them.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.45-55
• /
• 2010

While Long Term Evolution-Frequency Division Duplexing (LTE-FDD) is regarded as one of the strong candidates for "4G" wireless broadband access in FDD field, LTE-Time Division Duplexing (TDD) is emerging as one possible migration path for WiMAX-TDD in some cases as well as the migration path for Time Division-Synchronous Code Division Multiple Access (TD-SCDMA). In this paper, we analyze the feasibility of dual mode with LTE-TDD in two combinations: dual mode LTE-FDD/TDD and dual mode Worldwide Interoperability for Microwave Access (WiMAX)-TDD/LTE-TDD. Thanks to the commonality in numerology, terminology, and frame structure between LTE-FDD and LTE-TDD, dual mode LTE-FDD/TDD looks feasible in a cost-effective manner. Thanks to the commonality in scheduling algorithm, control mechanism, and supported spectrum bands, it is shown that dual mode WiMAX-TDD/LTE-TDD looks feasible as well. It should be also noted that the commonality in numerology and frame structure is critical for building a chip while the commonality in algorithms and control mechanisms is critical to make it work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1785-1796
• /
• 1998

This paper is concerned with the relationships between optimal number of wavelengths and tuning time in time division multiplexing(TDM) scheduling on wavelength division multiplexing(WDM) optical passive star networks. We assume that the traffic is nonuniform and each node has a tunable transmitter and a fixed receiver. Each node transmits spckets to all other nodes. Most of the earlier protocols on TDM based scheduling for WDM star networks [7, 8, etc.] use whold given wavelength chnnels. But in this paper, we investigate the optimal number of wavelengths that yidels minimum frame length when tuning time exists. It appears within the availble number of wavelengths that yields minimum frame length when tuning time exists. It appears within the available number of wavelengths. We analyze the relationships between optimal number of wavelengths and tuning time by experiments. We analyze the reationships between optimal number of wavelengths and tuning time by experiments. We also discuss on the possibility of reduction of frame length by increasing the number of nodes trans-mitters and receivers.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.65-74
• /
• 2003

Recently, It is required that multimedia data display on not only PC but also the Mobile device such as cellar phone, PDA. Mobile divieces has not sufficient of storage space or main memory and has slow network speed. So we can't process the multimedia data with the existing way on PC. This paper presents various methods for MultimediaPresentation which are able to display on the mobile device with the low-bandwidth and small storage. There Is an analysis that Is playable on the mobile device using presentation area devision method and replayable analysis method. If the display of multimedia presentation is impossible from this analysis, to apply prefetch techniques a using EPOB apoint and as User QoS of multimedia data through prefetch techniques have keep, do so that playable. Then, it is proposed to playable smooth multimedia presentation as that each of the presentations through prefetch Scheduling techniques point and quantity of data which are prefetch.