• 제목/요약/키워드: Network Scheduling Method

검색결과 282건 처리시간 0.027초

선형 공정계획 모델의 작업 관계성 적용 방법 (Application of Work Relationships for Linear Scheduling Model)

  • 류한국
    • 한국건축시공학회:학술대회논문집
    • /
    • 한국건축시공학회 2010년도 춘계 학술논문 발표대회 1부
    • /
    • pp.131-133
    • /
    • 2010
  • As linear scheduling method has been used since 1929, Empire State Building linear schedule, it is being applied in various fields such as construction and manufacturing. When addressing concurrent critical path occurring on linear schedule of construction, the empirical researches stress the resource management which should be applied for optimizing work flow, flexible work productivity and continuos resource allocation. However, work relationships has been usually overlooked for making the linear schedule from existing network schedule. Therefore, this research analyze the previous researches related to linear scheduling model and then propose the method that can be applied for adopting the relationships of network schedule to the linear schedule.

  • PDF

네트워크 기반 이산 시간 제어 시스템의 최대 허용 지연 한계 및 실시간 스케줄링 기법에 관한 연구 (Maximum Allowable Delay Bounds and Real-time Scheduling Method of Networked Discrete-time Control Systems)

  • 김동성;최동혁
    • 제어로봇시스템학회논문지
    • /
    • 제12권7호
    • /
    • pp.719-727
    • /
    • 2006
  • This paper proposes a new method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems and event-based scheduling method. The proposed method is formulated in terms of linear matrix inequalities and can give a much less conservative delay bound than the existing methods. A network scheduling method is presented based on the delay obtained through the proposed method, and it can adjust the sampling period to allocate same utilization to each control loop. The presented method can handle three types of data (sporadic, emergency data, periodic data and non real-time message) and guarantees real-time transmission of periodic and sporadic emergency data using modified EDF scheduling method.

MIMO-aided Efficient Communication Resource Scheduling Scheme in VDES

  • Sung, Juhyoung;Cho, Sungyoon;Jeon, Wongi;Park, Kyungwon;Ahn, Sang Jung;Kwon, Kiwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권8호
    • /
    • pp.2736-2750
    • /
    • 2022
  • As demands for the maritime communications increase, a variety of functions and information are required to exchange via elements of maritime systems, which leads communication traffic increases in maritime frequency bands, especially in VHF (Very High Frequency) band. Thus, effective resource management is crucial to the future maritime communication systems not only to the typical terrestrial communication systems. VHF data exchange system (VDES) enables to utilize more flexible configuration according to the communication condition. This paper focuses on the VDES communication system among VDES terminals such as shore stations, ship stations and aids to navigation (AtoN) to address efficient resource allocation. We propose a resource management method considering a MIMO (Multiple Input Multiple Output) technique in VDES, which has been widely used for modern terrestrial wireless networks but not for marine environments by scheduling the essential communication resources. We introduce the general channel model in marine environment and give two metrics, spectral and the energy efficiencies to examine our resource scheduling algorithm. Based on the simulation results and analysis, the proposed method provides a possibility to enhance spectral and energy efficiencies. Additionally, we present a trade-off relationship between spectral and energy efficiencies. Furthermore, we examine the resource efficiencies related to the imperfect channel estimation.

A Resource Scheduling for Supply Chain Model

  • 양병화
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2004년도 추계학술대회 및 정기총회
    • /
    • pp.527-530
    • /
    • 2004
  • This paper presents an optimization formulation for resource scheduling in Critical Resource Diagramming (CRD) of production scheduling networks. A CRD network schedules units of resources against points of needs in a production network rather than the conventional approach of scheduling tasks against resource availability. This resource scheduling approach provides more effective tracking of utilization of production resources as they are assigned or 'moved' from one point of need to another. Using CRD, criticality indices can be developed for resource types in a way similar to the criticality of activities in Critical Path Method (CPM). In our supply chain model, upstreams may choose either normal operation or expedited operation in resource scheduling. Their decisions affect downstream's resource scheduling. The suggested optimization formulation models resources as CRD elements in a production two-stage supply to minimize the total operation cost

  • PDF

링망을 이용한 병렬 멀티캐스트 패킷스위치에서의 멀티캐스트 셀 스케줄링에 관한 연구 (The study on Multicast Cell Scheduling for Parallel Multicast packet switch with Ring Network)

  • 김진천
    • 한국정보통신학회논문지
    • /
    • 제4권5호
    • /
    • pp.1037-1050
    • /
    • 2000
  • 오늘날의 통신서비스들은 음성이나 데이터 서비스와 같은 전통적인 서비스뿐만 아니라 비디오 서비스와 같은 대량의 데이터를 전송해야만 하는 멀티미디어 서비스를 포함한다. 이러한 요구를 수용하기 위해서 BISDN(Broadband Integated Services Digital Network)이 개발되었고 이의 기반 기술로 ATM이 채택되었다. 다양한 멀티미디어 응용들 중에서 VOD(Video On Demand), 화상회의등은 데이터를 동시에 여러 목적지로 보내는 멀티캐스트 특성이 있다. 그러므로 멀티캐스트 능력은 멀티미디어 통신에서 매우 중요하다. 본 논문에서는 링망을 이용한 병렬 멀티캐스트 패킷스위치(Parallel Multicast Packet Switch with Ring Network: PMRN)에서의 분리된 HOL을 이용한 멀티캐스트 셀 스케줄링 기법을 제안한다. 이 기법은 입력버퍼의 앞단 에 멀티캐스트 셀과 유니캐스트 셀을 위한 분리된 HOL을 두고 non-FIFO방식을 사용함으로서 입력버퍼 내에서 전송 가능한 멀티캐스트 셀과 유니캐스트 셀을 동시에 스케줄링할 수 있도록 하여 입력버퍼 내에서의 지연을 감소시키고 링망과 일대일 연결 네트워크의 이용율을 높이며 스위치의 처리율을 높일 수 있다.

  • PDF

Enhanced resource scheduling in Grid considering overload of different attributes

  • Hao, Yongsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1071-1090
    • /
    • 2016
  • Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

LTE Packet Scheduling with Bandwidth Type Consideration

  • Alotaibi, Sultan
    • International Journal of Computer Science & Network Security
    • /
    • 제22권4호
    • /
    • pp.351-357
    • /
    • 2022
  • LTE (Long-Term Evolution, sometimes known as 4G LTE) is a wireless high-speed data communication technology for mobile phones and data terminals. The Packet Scheduler (PS) is an important component in improving network performance. Physical Resource Blocks (PRBs) are assigned to associated User Equipment by the packet scheduler (UEs). The primary contribution of this study is a comparison of the eNodeB throughput between a suggested method and the Round Robin (RR) Algorithm. The RR Algorithm distributes PRBs among all associated UEs without taking channel circumstances into account. In this research, we present a new scheduling method that takes into account the number of PRBs and associated UEs and produces higher throughput than the RR algorithm.

제약식 프로그래밍을 이용한 일방향 전송 무선 메쉬 네트워크에서의 최적 링크 스케쥴링 (The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming)

  • 김학진
    • Journal of Information Technology Applications and Management
    • /
    • 제23권2호
    • /
    • pp.61-80
    • /
    • 2016
  • The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

Grant Scheduling Method to Improve the Channel Efficiency of Ethernet Passive Optical Network

  • Lee Yutae;Chung Hae
    • 한국통신학회논문지
    • /
    • 제30권4B호
    • /
    • pp.186-191
    • /
    • 2005
  • To provide fairness among different ONUs in EPON, the upstream channel remains idle for some time after OLT receives the buffer status from all ONUs every cycle, which decreases the utilization and increases the delay. To solve this deficiency, we present a new grant scheduling method. The method consists of dividing ONUs into several sets where OLT can schedule ONUs in one set while others will be transmitting their traffic. This method will better utilize the bandwidth of EPON. The numerical results show that the larger the number of ONU sets is the smaller the minimum overhead becomes.