• Title/Summary/Keyword: scheduling management

Search Result 1,280, Processing Time 0.027 seconds

SLNR-based User Scheduling in Multi-cell networks: from Multi-antenna to Large-Scale Antenna System

  • Li, Yanchun;Zhu, Guangxi;Chen, Hua;Jo, Minho;Liu, Yingzhuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.945-964
    • /
    • 2014
  • In this paper, we investigate the performance of Signal to Leakage and Noise Radio (SLNR) based user scheduling in uplink of multi-cell with large-scale antenna system. Large antenna array is desired to improve the performance in future system by providing better beamforming capability. However, some studies have found that the signal channel is 'hardened' (becomes invariant) when the antenna number goes extremely large, which implies that the signal channel aware user scheduling may have no gain at all. With the mathematic tool of order statistics, we analyzed the signal and interference terms of SLNR in a homogeneous multicell network. The derived distribution function of signal and interference shows that the leakage channel's variance is much more influential than the signal channel's variance in large-scale antenna regime. So even though the signal channel is hardened, the SLNR-based scheduling can achieve remarkable multiuser diversity (MUD) gain due to the fluctuation of the uplink leakage channel. By providing the final SINR distribution, we verify that the SLNR-based scheduling can leverage MUD in a better way than the signal channel based scheduling. The Monte Carlo simulations show that the throughput gain of SLNR-based scheduling over signal channel based scheduling is significant.

Preventing Communication Disruption in the Urban Environment Using RRPS (RSU Request Priority Scheduling) (도심환경에서 통신 단절 예방을 위한 RRPS(RSU Request Priority Scheduling)설계)

  • Park, Seok-Gyu;Ahn, Heui-Hak;Jeuong, Yi-Na
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.584-590
    • /
    • 2016
  • This paper proposed "Priority Scheduling and MultiPath Routing Protocol (RRPS) for preventing communication disruption in the urban environment" to minimize the disconnection or disruption of V2I and V2V communication in the urban environment where communication is frequently disconnected according to density. The flow of the RRPS is explained as follows. RSU Request Priority Scheduling (RRPS) is used to apply the priority of the request message prior to reaching the end line by using the Start Line and End Line, which are the management areas of the RSU). This paper also proposed MPRP (Multi Path Routing Protocol) design to set up the multipath to the destination. As a result, the proposed RRPS improves the processing efficiency of V2I by applying priority scheduling to the message of the vehicle requesting the information in the RSU, and can prevent the communication disconnection. Thereby, it is improved the transmission success probability.

Stochastic Radar Beam Scheduling Using Simulated Annealing (Simulated Annealing을 이용한 추계적 레이더 빔 스케줄링 알고리즘)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo;Jang, Dae-Sung;Choi, Han-Lim
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.2
    • /
    • pp.196-206
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

A Use-Case Based Object-Oriented Project Scheduling Technique (Use-Case 기반 객체지향 프로젝트 스케줄링 기법)

  • 허진선;최시원;김수동
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.293-307
    • /
    • 2003
  • Object-oriented development has been generalized, but object-oriented project planning and scheduling techniques have not been studied enough. Furthermore, it is difficult to apply the conventional software management techniques to object-oriented projects. Especially, the large scaled projects are increasing, but the project planing techniques for these large scaled projects have not been proposed enough. In this paper, we propose systematic techniques for OO based project scheduling. We suggest a 7 step-process for deriving the OO project schedule from the use-case diagram which is describing the functional requirements of the system. The proposed process includes identifying use-cases, drawing preliminary chart through interdependency analysis, identifying characteristics of each use case, determining the number of iteration, assigning use-cases to iteration, considering available resource and constraints, drawing revised PERT chart. Each step has the explanation of the input, output, and the guidelines needed to perform the step. The project scheduling technique proposed in this paper ran be used effectively in the planning phase which the purpose is to plan a development schedule to yield the high quality software in minimum time.

Scheduling of Workflows under Resource Allocation Constraints using CTR (CTR을 이용한 자윈 할당 제약조건 하에서 워크플로우의 스케줄링)

  • Koh Jae-Jin;An Hyoung-Keun;Lee Dan-Young
    • The KIPS Transactions:PartD
    • /
    • v.13D no.2 s.105
    • /
    • pp.191-198
    • /
    • 2006
  • Many enterprises have introduced workflow to enhance work efficiency and support effective work processes in their various work environments. Recently, Business Process Management(BPM), an extension of workflow, is spotlighted in enterprise software markets Although woklflow plays an important role in Business Process Managements, researches in workflow are mostly concentrated on temporal constraints which finds exact execution sequences for complicated jobs. On that reason, majority of workflow scheduling has concentrated on modeling of various resources which should be handled and the interest for workflow scheduling under constraints related to resources is rather unsatisfactory In this paper we presents the Transformation Template based on Concurrent Transaction Logic(CTR) which is suitable for scheduling workflows with resource allocation constraints, and the logical framework. The Transformation Template consists of a Workflow Transformation Template and a Constraint Transaction Template. Especially the Transformation Template can be conveniently used to logically represent new workflows under the existing resource allocation constraints.

An Integrated Scheduling Approach for Real-Time Web Servers (실시간 웹서버 시스템을 위한 통합 스케줄링 방안)

  • Kang, Bong-Jik;Jung, Suk-Yong;Lee, Hyun-Suk;Choe, Gyeong-Hui;Jeong, Gi-Hyeon;Yu, Hae-Yeong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.6
    • /
    • pp.36-46
    • /
    • 2002
  • This paper proposes an integrated scheduling mechanism for embedded system with real-time web server to meet the characteristics of real time task. The proposed scheduling mechanism may solve the so-called priority inversion problem in scheduling between urgent web requests and tasks with low priorities. The priority inversion problem happens because of operating two independent schedulers, web scheduler and operating system scheduler in a system without considering the requirements of each other. In the proposed mechanism, two schedulers are integrated in an operating system and the integrated scheduler schedules tasks for urgent web requests with real time characteristics and other application tasks together. Since all tasks are scheduled by one unified scheduler that knows the characteristics of tasks, the tasks are scheduled with their absolute priorities and thus the priority inversion problem can be eliminated. The performance is measured on a prototype embedded system with the proposed algorithm.

A Case Study on Application of Dispatching Rule-Based Advanced Planning and Scheduling (APS) System (디스패칭 룰 기반의 Advanced Planning and Scheduling (APS) 시스템 활용 사례연구)

  • Lee, Jae-yong;Shin, Moonsoo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.78-86
    • /
    • 2015
  • Up-to-date business environment for manufacturers is very complex and rapidly changing. In other words, companies are facing a variety of changes, such as diversifying customer requirements, shortening product life cycles, and switching to small quantity batch production. In this situation, the companies are introducing the concept of JIT (just-in-time) to solve the problem of on-time production and on-time delivery for survival. Though many companies have introduced ERP (enterprise resource planning) systems and MRP (material requirement planning) systems, the performance of these systems seems to fall short of expectations. In this paper, the case study on introducing an APS (advanced planning and scheduling) system based on dispatching rules to a machining company and on finding a method to establish an efficient production schedule is presented. The case company has trouble creating an effective production plan and schedule, even though it is equipped with an MRP-based ERP system. The APS system is applied to CNC (computer numerical control) machines, which are key machines of the case company. The overall progress of this research is as follows. First, we collect and analyze the master data on individual products and processes of the case company in order to build a production scheduling model. Second, we perform a pre-allocation simulation based on dispatching rules in order to calculate the priority of each order. Third, we perform a set of production simulations applying the priority value in order to evaluate production lead time and tardiness of pre-defined dispatching rules. Finally, we select the optimal dispatching rule suitable for work situation of the case company. As a result, an improved production schedule leads to an increase in production and reduced production lead time.

Energy-Aware Scheduling Technique to Exploit Operational Characteristic of Embedded Applications (임베디드 응용프로그램의 동작 특성을 이용한 에너지 인식 스케쥴링 기법)

  • Han, Chang-Hycok;Yoo, Joon-Hyuk
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.1
    • /
    • pp.1-8
    • /
    • 2011
  • Efficient power management plays a crucial role to strengthen competitiveness in the market of portable mobile commodities. This paper presents a proactive power management technique, called by Energy-Aware Scheduling policY (EASY), to exploit the sleep time information of running applications. Different from previous power management approaches focusing on power conservation in standby mode, the proposed scheme characterizes each application program's operational characteristic in active mode by observing how long the task stays in sleep state of CPU scheduler. Based on the measured sleep time, the proposed EASY speculates an adequate CPU clock frequency according to the current CPU workload and scales the frequency directly to the predicted one. Experimental results show that the proposed scheme reduces the power consumption by 10-30% on average compared to traditional DPM approach, with a minimal impact on the performance overhead.

A Study on State Dependent RED and Dynamic Scheduling Scheme for Real-time Internet Service (실시간 인터넷 서비스를 위한 상태 의존 RED 및 동적 스케줄링 기법에 관한 연구)

  • 유인태;홍인기;서덕영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.823-833
    • /
    • 2003
  • To satisfy the requirements of the real-time Internet services, queue management and scheduling schemes should be enhanced to accommodate the delay and jitter characteristic of them. Although the existing queue management schemes can address the congestion problems of TCP flows, they have some problems in supporting real-time services. That is, they show performance degradation when burst traffics are continuously going into the system after the queue is occupied at a predefined threshold level. In addition, under the congestion state, they show large jitter, which is not a desirable phenomenon for real-time transmissions. To resolve these problems, we propose a SDRED (State Dependent Random Early Detection) and dynamic scheduling scheme that can improve delay and jitter performances by adjusting RED parameters such as ma $x_{th}$ and $w_{q}$ according to the queue status. The SDRED is designed to adapt to the current traffic situation by adjusting the max,$_{th}$ and $w_{q}$ to four different levels. From the simulation results, we show that the SDRED decreases packet delays in a queue and has more stable jitter characteristics than the existing RED, BLUE, ARED and DSRED schemes.mes.mes.

Development of Scheduling System for Trajectory Based Air Traffic Management (궤적 기반의 항공 교통 관리를 위한 스케줄링 시스템 개발)

  • Oh, Eun-Mi;Eun, Yeonju;Kim, Hyounkyoung;Jeon, Daekeun
    • 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.