• 제목/요약/키워드: Scheduling System

검색결과 2,159건 처리시간 0.025초

메시지 패싱 시스템의 통신 특성을 고려한 개선된 태스크 스케줄링 기법 (Improved Task Scheduling Algorithm Considering the Successive Communication Features of Heterogeneous Message-passing System)

  • 노두호;김성천
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제31권5_6호
    • /
    • pp.347-352
    • /
    • 2004
  • 본 논문에서는 메시지 패싱 시스템에서의 태스크 스케줄링에 대해 다룬다. 병렬/분산 시스템의 어플리케이션의 태스크에 대한 적절한 스케줄링이 이루어지지 않는 경우, 병렬/분산 처리를 이용한 이득을 기대하기는 어렵기 때문에 이 주제에 대한 연구는 컴퓨터 아키텍처의 발달과 함께 지속되고 있으며, 많은 연구들이 태스크 스케줄링에 대한 다양한 기법들을 제안하고 있다. 기존의 연구들은 공유 메모리 시스템을 가정하여 이루어졌기 때문에, 메시지 패싱 시스템에 기존의 기법을 적용하기가 힘들다. 본 논문에서는 기존 연구의 모델과 메시지 패싱 시스템의 통신 모델의 차이점으로 발생하는 통신비용의 누적을 고려하여 리스트 스케줄링 기법에 기초한 개선된 우선 순위 함수와 새로운 프로세서 선택 기준을 제안한다. 이들 두 가지 제안을 적용한 태스크 스케줄링 기법은 통신비용의 누적을 고려하지 않아 발생하는 비효율적인 스케줄링을 개선한다.

시각물체 추적 시스템을 위한 멀티코어 프로세서 기반 태스크 스케줄링 방법 (A Task Scheduling Strategy in a Multi-core Processor for Visual Object Tracking Systems)

  • 이민채;장철훈;선우명호
    • 한국자동차공학회논문집
    • /
    • 제24권2호
    • /
    • pp.127-136
    • /
    • 2016
  • The camera based object detection systems should satisfy the recognition performance as well as real-time constraints. Particularly, in safety-critical systems such as Autonomous Emergency Braking (AEB), the real-time constraints significantly affects the system performance. Recently, multi-core processors and system-on-chip technologies are widely used to accelerate the object detection algorithm by distributing computational loads. However, due to the advanced hardware, the complexity of system architecture is increased even though additional hardwares improve the real-time performance. The increased complexity also cause difficulty in migration of existing algorithms and development of new algorithms. In this paper, to improve real-time performance and design complexity, a task scheduling strategy is proposed for visual object tracking systems. The real-time performance of the vision algorithm is increased by applying pipelining to task scheduling in a multi-core processor. Finally, the proposed task scheduling algorithm is applied to crosswalk detection and tracking system to prove the effectiveness of the proposed strategy.

Gain-Scheduling 기법을 이용한 크레인의 흔들림 제어에 관한 연구 (A Study on the Sway Control of a Crane Based on Gain-Scheduling Approach)

  • 김영복
    • 한국정밀공학회지
    • /
    • 제18권7호
    • /
    • pp.53-64
    • /
    • 2001
  • The gain-scheduling control technique is vary useful in the control problem incorporating time varying parameters which can be measured in real time. Based on these facts, in this paper the sway control problem of the pendulum motion of a container hanging on the trolly, which transports containers from a container ship to trucks, is considered. In the container crane control problem, suppressing the residual swing motion of the container at the end of acceleration, deceleration or the case of that the unexpected disturbance input exists is main issue. For this problem, in general, the trolley motion control strategy is introduced and applied. But, in this paper, we introduce and synthesize a new type of swing motion control system. In this control system, a small auxiliary mass is installed on the spreader. And the actuator reacts against the auxiliary mass, applying inertial control forces to the container to reduce the swing motion in the desired manner. In this paper, we assume that an plant parameter is varying and apply the gain-scheduling control technique design the anti-swing motion control system for the controlled plant. In this control system, the controller dynamics are adjusted in real-time according to time-varying plant parameters. And the simulation result shows that the proposed control strategy is shown to be useful to the case of time-varying system and, robust to disturbances like winds and initial sway motion.

  • PDF

On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels

  • Kim, Yoora
    • 한국통신학회논문지
    • /
    • 제41권8호
    • /
    • pp.924-927
    • /
    • 2016
  • In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

지능형 제어기법에 의한 생산 계획 설계 (Design of the intelligent control-based job scheduler)

  • 이창훈;서기성;정현호;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • pp.286-289
    • /
    • 1989
  • The purpose of this paper is to design a job scheduling algorithm utilizing intelligent control technique. Rulebase is built through the evaluation of rule-set scheduling. 24 scheduling rule-sets and meta-rules are employed. An appropriate scheduling rule-set is selected based on this rulebase and current manufacturing system status. Six criteria have been used to evaluate the performance of scheduling. The performance of sheduling is dependent on random breakdown of the major FMS components during simulation.

  • PDF

파이프라인형 데이타패스 합성을 위한 스케쥴링 기법 (A Scheduling Technique for Pipelined Datapath Synthesis)

  • 이근만;임인칠
    • 전자공학회논문지A
    • /
    • 제29A권4호
    • /
    • pp.74-82
    • /
    • 1992
  • This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

  • PDF

유연생산시스템의 일정계획에 관한 연구 (A Scheduling Model for FMS)

  • 이동춘;신현재
    • 품질경영학회지
    • /
    • 제20권1호
    • /
    • pp.136-146
    • /
    • 1992
  • Most of scheduling papers on FMS have been considered that the fabrication process, the machining process and the assembly process etc. are independent and the releasing, routing, dependent, batching, loading problem are treated separetely. In this paper, we discuss that the integrated scheduling problem which can be solved for efficient use. We combine two systems that each process system which in order to produce a product is treated dependently, the releasing and the routing problem are combined one system and we present the efficient flexible manufacturing system as including the alternate process.

  • PDF

반도체 FAB의 스케줄링 시뮬레이터 개발 (Scheduling Simulator for Semiconductor Fabrication Line)

  • 이영훈;조한민;박종관;이병기
    • 산업공학
    • /
    • 제12권3호
    • /
    • pp.437-447
    • /
    • 1999
  • Modeling and system development for the fabrication process in the semiconductor manufacturing is presented in this paper. Maximization of wafer production can be achieved by the wafer flow balance under high utilization of bottleneck machines. Relatively simpler model is developed for the fabrication line by considering main characteristics of logistics. Simulation system is developed to evaluate the line performance such as balance rate, utilization, WIP amount and wafer production. Scheduling rules and input rules are suggested, and tested on the simulation system. We have shown that there exists good combination of scheduling and input rules.

  • PDF

광마이크로셀 이동통신 시스템의 균등부하를 위한 셀단위 핸드오프 순서결정 (Minimization of Cell-based Handoff Delays to Balance the Load in Fiber Optic Micro-cellular Systems)

  • 이채영;장세헌
    • 한국경영과학회지
    • /
    • 제26권2호
    • /
    • pp.1-11
    • /
    • 2001
  • This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

  • PDF

인공 뉴럴 네트워크에 의한 FMS 일정관리 (FMS scheduling through artificial neural network)

  • 양정문;문기주;김정자
    • 산업경영시스템학회지
    • /
    • 제18권34호
    • /
    • pp.99-106
    • /
    • 1995
  • Recently, neural network is recognized as a new approach to solve jobshop scheduling problems in manufacturing system. Scheduling problem is known to be a difficult combinational explosive problem with domain-dependence variations in general. In addition, the needs to achieve a good performance in flexible manufacturing system increase the dimensions of decision complexity. Therefore, mathematical approach to solve realistic problems could be failed to find optimal or optimal-trending. In this paper a technique with neural network for jobs grouping by job-attributes and Gaussian machine network for generating to near-optimal sequence is presented.

  • PDF