• Title/Summary/Keyword: Scheduling System

Search Result 2,159, Processing Time 0.03 seconds

Effective Dynamic Broadcast Method in Hybrid Broadcast Environment (하이브리드 브로드캐스트 환경에서 효과적인 동적 브로드캐스팅 기법)

  • Choi, Jae-Hoon;Lee, Jin-Seung;Kang, Jae-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.2
    • /
    • pp.103-110
    • /
    • 2009
  • We are witnessing rapid increase of the number of wireless devices available today such as cell phones, PDAs, Wibro enabled devices. Because of the inherent limitation of the bandwidth available for wireless channels, broadcast systems have attracted the attention of the research community. The main problem in this area is to develop an efficient broadcast program. In this paper, we propose a dynamic broadcast method that overcomes the limitations of static broadcast programs. It optimizes the scheduling based on the probabilistic model of user requests. We show that dynamic broadcast system can indeed improve the quality of service using user requests. This paper extends our previous work in [1] to include more thorough explanation of the proposed methodology and diverse performance evaluation models.

Antenna Selection Algorithm for Energy Consumption Minimization in Massive Antenna System (다중안테나 시스템에서 전력 최소화를 위한 안테나 선택 알고리즘)

  • Shin, Kyung-Seop
    • Journal of Convergence for Information Technology
    • /
    • v.12 no.3
    • /
    • pp.280-285
    • /
    • 2022
  • In order to ensure maximum capacity at a given frequency resource, the number of antennas must be increased. The increase in antennas means that such guaranteed channel resources can be used as an increase in channel capacity by aquiring another channel resource. In order to aggregate antennas in such a situation where there are a plurality of antennas, a problem of miniaturizing and integrating antennas must be accompanied. In this situation, in order to efficiently allocate channel resources and antenna resources in limited device resources, the problem of antenna selection and user scheduling was considered and solved together. By numerical simulation results, the proposed algorithm was proven to effectively reduce 34 % power consumption in averagewith increase in antennas.

AI Scheduler using AWS and Raspberry Pi (AWS와 라즈베리 파이를 활용한 AI 스케줄러에 대한 연구)

  • Jeon, Ji-won;Lim, Chae-yean;Jung, Byung-ho;Lee, Sung-Jin;Moon, Sang-ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.370-372
    • /
    • 2021
  • According to the Clinical Research Center for Dementia, 840,000 Koreans aged 65 or older had dementia patients, with a prevalence rate of 10.39%. The prevalence rate is one in 10 elderly people, but difficult for families to take care of them all day. Judged that possible to manage the conditions and schedules of elderly people living alone by utilizing AI speaker system where schedule management is stored. This paper implements modules for AI schedulers in patients with dementia. Configured to link AWS, a remote IOT, inside the raspberry pi, and to output the schedule to speakers using a calendar from Google API. Through this study, judged that ease of scheduling will help manage and schedule dementia patients.

  • PDF

Ring Operator Threaded-Scheduling for Improving Continuous Query Processing over Data Streams (데이터 스트림 환경에서 질의 처리 성능 향상을 위한 링 연산자 쓰레드 스케줄링 기법)

  • Young-Ki Kim;Soong-Sun Shin;Weon-Il Chung;Sung-Ha Baek;Dong-Wook Lee;Hae-Young Bae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.296-299
    • /
    • 2008
  • 최근 데이터 스트림을 관리하기 위해 DSMS(Data Stream Management System)가 계속적으로 연구 되고 있다. 하지만 데이터 스트림은 방대한 양의 데이터를 처리하기 위하여 실시간성을 갖는 빠른 데이터 처리가 요구되며, 이러한 특성 때문에 데이터 처리의 효율성 증대를 위하여 메모리 관리가 중요하다. 기존 메모리 관리에 대한 연구는 쓰레드 스케줄링을 통한 관리 기법이 연구되었다. 하지만 기존의 연산자 쓰레드 스케줄링과 그래프 쓰레드 스케줄링은 쓰레드 관리의 유연성이 떨어지기 때문에 불규칙적인 데이터 스트림 환경에서는 부적합하다. 또한 하이브리드 멀티 쓰레드 스케줄링 기법은 두 가지 기법의 장점을 결합하였으나 가상 연산자의 일회성 사용으로 쓰레드 관리의 어려움 이 있다. 따라서 본 논문은 공유와 재사용이 가능한 링 연산자를 이용한 링 연산자 쓰레드 스케줄 링 기법을 제안한다. 본 기법은 링 연산자를 통해 새로 입력된 질의의 동일한 연산자 구성은 생성 되어 있는 링 연산자를 공유하거나 재사용하여 불필요한 자원 소모와 자원 할당의 과부하를 줄임으로써 기존 기법에 비해 쓰레드 할당의 수를 감소 시켜 대량의 질의 처리 시 속도를 증가 시켰다.

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.

Identifying Factors Affecting Labor Productivity for Residential Fire Protection System Installation (공동주택 소방설비공사의 노무생산성 영향요인 분석)

  • Oh, Jae-Hoon;Kim, Dae Young;Kim, Jae Sik;Huh, Young-Ki
    • Journal of the Korea Institute of Building Construction
    • /
    • v.17 no.4
    • /
    • pp.377-384
    • /
    • 2017
  • It is generally acknowledged that subcontractors mostly allocate their resources to project relying on their previous experiences, instead of data-based judgement. Installing residential fire protection systems, typically performed by subcontractors, is labor-intensive job and its schedule is frequently changed as the contractor master schedule is often revised. Nevertheless, it is still important for subcontractors to make much effort to improve labor productivity through a thorough planning for scheduling and resource allocation. The purpose of this study is to identify significant factors that affect labor productivity for residential fire protection system installation. For this purpose, 50 potential factors that may affect productivity were identified based on literature reviews and expert interviews. These factors were further explored using correlation analysis and ANOVA test. The results showed that the labor productivity is significant impacted by various project characteristics.

Design and Implementation of An I/O System for Irregular Application under Parallel System Environments (병렬 시스템 환경하에서 비정형 응용 프로그램을 위한 입출력 시스템의 설계 및 구현)

  • No, Jae-Chun;Park, Seong-Sun;;Gwon, O-Yeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1318-1332
    • /
    • 1999
  • 본 논문에서는 입출력 응용을 위해 collective I/O 기법을 기반으로 한 실행시간 시스템의 설계, 구현 그리고 그 성능평가를 기술한다. 여기서는 모든 프로세서가 동시에 I/O 요구에 따라 스케쥴링하며 I/O를 수행하는 collective I/O 방안과 프로세서들이 여러 그룹으로 묶이어, 다음 그룹이 데이터를 재배열하는 통신을 수행하는 동안 오직 한 그룹만이 동시에 I/O를 수행하는 pipelined collective I/O 등의 두 가지 설계방안을 살펴본다. Pipelined collective I/O의 전체 과정은 I/O 노드 충돌을 동적으로 줄이기 위해 파이프라인된다. 이상의 설계 부분에서는 동적으로 충돌 관리를 위한 지원을 제공한다. 본 논문에서는 다른 노드의 메모리 영역에 이미 존재하는 데이터를 재 사용하여 I/O 비용을 줄이기 위해 collective I/O 방안에서의 소프트웨어 캐슁 방안과 두 가지 모형에서의 chunking과 온라인 압축방안을 기술한다. 그리고 이상에서 기술한 방안들이 입출력을 위해 높은 성능을 보임을 기술하는데, 이 성능결과는 Intel Paragon과 ASCI/Red teraflops 기계 상에서 실험한 것이다. 그 결과 응용 레벨에서의 bandwidth는 peak point가 55%까지 측정되었다.Abstract In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. In other words, the design provides support for dynamic contention management. Then we present a software caching method using collective I/O to reduce I/O cost by reusing data already present in the memory of other nodes. Finally, chunking and on-line compression mechanisms are included in both models. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine. Application level I/O bandwidth up to 55% of the peak is observed.he peak is observed.

Design and Implementation of Preemptive EDF Scheduling Algorithm in TinyOS (TinyOS에서의 선점적 EDF 스케줄링 알고리즘 설계 및 구현)

  • Yoo, Jong-Sun;Kim, Byung-Kon;Choi, Byoung-Kyu;Heu, Shin
    • The KIPS Transactions:PartA
    • /
    • v.18A no.6
    • /
    • pp.255-264
    • /
    • 2011
  • A sensor network is a special network that makes physical data sensed by sensor nodes and manages the data. The sensor network is a technology that can apply to many parts of field. It is very important to transmit the data to a user at real-time. The core of the sensor network is a sensor node and small operating system that works in the node. TinyOS developed by UC Berkeley is a sensor network operating system that used many parts of field. It is event-driven and component-based operating system. Basically, it uses non-preemptive scheduler. If an urgent task needs to be executed right away while another task is running, the urgent one must wait until another one is finished. Because of that property, it is hard to guarantee real-time requirement in TinyOS. According to recent study, Priority Level Scheduler, which can let one task preempt another task, was proposed in order to have fast response in TinyOS. It has restrictively 5 priorities, so a higher priority task can preempt a lower priority task. Therefore, this paper suggests Preemptive EDF(Earliest Deadline First) Scheduler that guarantees a real-time requirement and reduces average respond time of user tasks in TinyOS.

Design and Implementation of a Temporary Priority Swapping Protocol for Solving Priority Inversion Problems in MicroC/OS-II Real-time Operating System (MicroC/OS-II 실시간 운영체제에서의 우선순위 역전현상 해결을 위한 일시적 우선순위 교환 프로토콜 설계 및 구현)

  • Jeon, Young-Sik;Kim, Byung-Kon;Heu, Shin
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.463-472
    • /
    • 2009
  • Real-time operating systems must have satisfying various conditions such as effective scheduling policies, minimized interrupt delay, resolved priority inversion problems, and its applications to be completed within desired deadline. The real-time operating systems, therefore, should be designed and developed to be optimal for these requirements. MicroC/OS-II, a kind of Real-time operating systems, uses the basic priority inheritance with a mutex to solve priority inversion problems. For the implementation of mutex, the kernel in an operating system should provide supports for numerous tasks with same priority. However, MicroC/OS-II does not provide this support for the numerous tasks of same priority. To solve this problem, MicroC/OS-II cannot but using priority reservation, which leads to the waste of unnecessary resources. In this study, we have dealt with new design a protocol, so called TPSP(Temporary Priority Swap Protocol), by an effective solution for above-mentioned problem, eventually enabling embedded systems with constrained resources environments to run applications.

Efficient Execution Method for Business Process Management using TOC Concepts (제약이론을 활용한 업무프로세스의 효율적 실행 방법)

  • Rhee Seung-Hyun;Bae Hyerim;Won Hyungjun;Kim Hoontae;Kang Suk-Ho
    • The Journal of Society for e-Business Studies
    • /
    • v.10 no.1
    • /
    • pp.61-80
    • /
    • 2005
  • Business Process Management (BPM) System is a software system to support an efficient execution, control and management of business processes. The system automates complex business processes and manages them effectively to raise productivity. Traditional commercial systems mainly focus on automating processes and do not have methods for enhancing process performances and task performer's efficiency. Therefore, there is room for enhancement of task performers' productivities and efficiency of business processes. In this paper, we propose a new method of executing business processes more efficiently in that a whole process is scheduled considering the degree of participants' workload. The method allows managing the largest constraints among constituent resources of the process. This method is based on the DBR (Drum-Buffer-Rope) in TOC (Theory of Constraints) concepts. We first consider the differences between business process models and DBR application models, and then develop the modified drum, buffer and rope. This leads us to develop BP-DBR (Business Process-DBR) that can control the proper size of task performers' work list and arrival rate of process instances. Use of BP-DBR improves the efficiency of the whole process as well as participants' working condition. We then carry out a set of simulation experiments and compare the effectiveness of our approach with that of the scheduling techniques used in existing systems.

  • PDF