• Title/Summary/Keyword: output scheduling

Search Result 137, Processing Time 0.021 seconds

Low Complexity Multiuser Scheduling in Time-Varying MIMO Broadcast Channels

  • Lee, Seung-Hwan;Lee, Jun-Ho
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.2
    • /
    • pp.71-75
    • /
    • 2011
  • The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.

A Study on Efficient Scheduling Scheme for QoS in ATM Switch (ATM 스위치에서의 QOS 을 위한 효율적인 스케쥴링 기법에 관한 연구)

  • 이상태;김남희
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.75-78
    • /
    • 1998
  • In this paper, we propose a new cell discarding and scheduling scheme which reduce cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements and reduce average delay rate for the traffic that is sensitive in cell delay in output buffer of the ATM switch. Throughout the computer simulation, the existing scheduling scheme and proposed scheme are compared with respect to cell loss rate and average delay time.

  • PDF

A buffer readout scheduling for ABR traffic control (ABR 트랙픽 제어를 위한 버퍼 readout 스케쥴링)

  • 구창회;이재호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.11
    • /
    • pp.25-33
    • /
    • 1997
  • The end-to-end rate-based control mechanism is used for the flow control of the ABR service to allow much more flexibility in ATM switching system. To accommodate the ABR service effciently many algorithms such as EFCI, EPRCA, ERICA, and CAPC2 have been proposed for the switch algorithm. ABR cells and related RM cells are received at the ATM switch fabric transparently without any processing. And then cells received from the traffic source are queued in the ABR buffer of switching system. The ABR buffer usually has some thresholds for easy congestion control signal transmission. Whatever we use, therefore, these can be many ABR traffic control algorithms to implement the ABR transfer capability. The genertion of congestion indicate signal for ABR control algorithms is determined by ABR buffer satus. And ABR buffer status is determined by ABR cells transfer ratio in ATM switch fabrics. In this paper, we presented the functional structures for control of the ABR traffic capability, proposed the readout scheduling, cell slot allocation of output link and the buffer allocation model for effective ABR traffic guranteeing with considering CBR/VBR traffics in ATM switch. Since the proposed readout scheduling scheme can provide more avaliable space to ABR buffer than existing readout scheduling scheme, generation rate of a SEND signal, that is, BCN signal in destination node can be increased for ABR call connection. Therefore, the proposed scheme, in this paper, can be appropriate as algorithm for effective ABR traffic service on output link of ATM switching node.

  • PDF

Power based scheduling for Collaborative MIMO system (Collaborative MIMO 시스템을 위한 전력기반 스케줄링 방식)

  • Kim, Young-Joon;Lee, Jung-Seung;Baik, Doo-Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12A
    • /
    • pp.1209-1216
    • /
    • 2008
  • In order to maximize spectrum efficiency and data rate MIMO(Multiple Input Multiple Output) is adopted to wireless system. OFDM-based WiMAX and LTE accommodate MIMO as mandatory technology. STC(Space Time Coding) and SM(Spatial Multiplexing) are used in downlink while in uplink C-MIMO(Collaborative MIMO) is used to improve data throughput. In this paper conventional pairing schemes, RPS(Random Pairing Scheduling) and DPS(Determinant Pairing Scheduling) are analyzed. From the analysis the performance of DPS algorithm is better than that of RPS because DPS measures orthogonal factor between paired users. However, there are potential problems such as hardware complexity and performance. To overcome the issues Power-Based Scheduling(PBS) algorithm is proposed for C-MIMO. PBS can provide higher performance compared to RPS and dramatically reduce hardware complexity compared to DPS

An expert system for intelligent scheduling in flexible manufacturing cell (유연생산셀의 지능형 스케쥴링을 위한 전문가 시스템)

  • 전병선;박승규;이노성;안인석;서기성;이동헌;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.1111-1116
    • /
    • 1993
  • In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

  • PDF

Data Avaliability Scheduling for Synthesis Beyond Basic Block Scope

  • Kim, Jongsoo
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.1
    • /
    • pp.1-7
    • /
    • 1998
  • High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

  • PDF

Dynamic Scheduling of FMS Using a Fuzzy Logic Approach to Minimize Mean Flow Time

  • Srinoi, Pramot;Shayan, Ebrahim;Ghotb, Fatemeh
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.1
    • /
    • pp.99-107
    • /
    • 2008
  • This paper is concerned with scheduling in Flexible Manufacturing Systems (FMS) using a Fuzzy Logic (FL) approach. Four fuzzy input variables: machine allocated processing time, machine priority, machine available time and transportation priority are defined. The job priority is the output fuzzy variable, showing the priority status of a job to be selected for the next operation on a machine. The model will first select the machines and then assign operations based on a multi-criteria scheduling scheme. System/machine utilization, minimizing mean flow time and balancing machine usage will be covered. Experimental and comparative tests indicate the superiority of this fuzzy based scheduling model over the existing approaches.

Inverted Pendulum 제어를 위한 새로운 하이브리드 퍼지게인스케쥴링 제어기의 설계

  • 정병태;박재삼
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1997.03a
    • /
    • pp.235-246
    • /
    • 1997
  • Hybrid fuzzy gain scheduling controller is composed of a PD control and a fuzzy control for taking the advantage of each scheme. The key structure of the hybrid fuzzy gain scheduling control scheme is so called a switch which calculates weighting values between the fuzzy controller and the PD controller. However, due to the requirement of the switch , the hybrid fuzzy gain scheduling control scheme needs extra fuzzy logic processing, thus the structure is complicated. and requires more calculation time. To eliminate the drawbacks, a new hybrid fuzzy gain scheduling control scheme is proposed in this paper. In the proposed scheme, the membership function, for calculating of weithting value, and the input and output membership functions are combined. Thus the proposed hybrid scheme does not require switch for calculation of weighting value, and as a result, the calculation time is faster and the structure is more simple than the existing hybrid controller. Computer simulation results for an inverted pendulum model under Pole-Placement PID controller, fuzzy gain scheduling controller,existing hybrid controller , and proposed hybrid controller are compared to demonstrate the good property of the proposed hybrid controller.

QoS-Guaranteed Multiuser Scheduling in MIMO Broadcast Channels

  • Lee, Seung-Hwan;Thompson, John S.;Kim, Jin-Up
    • ETRI Journal
    • /
    • v.31 no.5
    • /
    • pp.481-488
    • /
    • 2009
  • This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an antenna trade-off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade-off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade-off scheme combined with QF scheduling can improve the probability of QoS-guaranteed transmission when supporting different QoS groups.

Hardware-Aware Rate Monotonic Scheduling Algorithm for Embedded Multimedia Systems

  • Park, Jae-Beom;Yoo, Joon-Hyuk
    • ETRI Journal
    • /
    • v.32 no.5
    • /
    • pp.657-664
    • /
    • 2010
  • Many embedded multimedia systems employ special hardware blocks to co-process with the main processor. Even though an efficient handling of such hardware blocks is critical on the overall performance of real-time multimedia systems, traditional real-time scheduling techniques cannot afford to guarantee a high quality of multimedia playbacks with neither delay nor jerking. This paper presents a hardware-aware rate monotonic scheduling (HA-RMS) algorithm to manage hardware tasks efficiently and handle special hardware blocks in the embedded multimedia system. The HA-RMS prioritizes the hardware tasks over software tasks not only to increase the hardware utilization of the system but also to reduce the output jitter of multimedia applications, which results in reducing the overall response time.