• Title/Summary/Keyword: scheduling policy

Search Result 203, Processing Time 0.024 seconds

Channel Scheduling Policies for Batching in VOD System (VOD 시스템에서 일괄전송을 위한 채널 스케줄링 기법)

  • Park, Ho-Gyun;Yu, Hwang-Bin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.385-395
    • /
    • 1999
  • Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

  • PDF

An Improved DBP Window Policy in the Input Buffer Switch Using Non-FIFO Memory Structure (Non-FIFO 메모리 구조를 사용한 입력버퍼형 스위치에서 개선된 DBP 윈도우 기법)

  • Kim, Hoon;Park, Sung-Hun;Park, Kwang-Chae
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06e
    • /
    • pp.223-226
    • /
    • 1998
  • In the Input Buffer Switch using the intial stage FIFO memory structure, It has pointed the Throughput limitation to the percent of 58.6 due to HOL(Head of Line) blocking in the DBP(Dedicated Buffer with Pointer) method, During that time, To overcome these problems, The prior papers have proposed the complicated Arbitration algorithms and Non-FIFO memory structures. and These showed the improved Throughput. But, Now, To design high speed ATM Switch which need to the tens of Giga bit/s or the tens of Tera bit/s. It has more difficulty in proceeding the priority of majority and the complicated Cell Scheduling, because of the problem in operating the control speed of the ratio of N to scanning each port and scheduling the Cell. In this paper, To overcome these problems, We could show more the improved performance than the existing DBP Window policy to design high speed ATM Switch.

  • PDF

A transcode scheduling technique to reduce early-stage delay time in playing multimedia in mobile terminals (이동 단말기에서 멀티미디어 연출시 최초 재생 지연시간을 줄이기 위한 트랜스코드 스케줄링 기법)

  • Hong, Maria;Yoon, Joon-Sung;Lim, Young-Hwan
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.695-704
    • /
    • 2003
  • This paper proposes a new scheduling technique to play multimedia data streams in mobile terminals. The paper explores the characteristics of multimedia data streams , firstly. On basis of these characteristics, selection of specific data stream can be possible as well as transcoding protest. Our approach aims at reducing the early-stage delay time more effectively since it makes possible to select and transcodes some specific streams by employing a selection policy rather than transcoding all streams in the playing process Thus, this paper suggests a stream selection policy for the transcoding based on EPOB (End Point of Over Bandwidth). It aims to lower the required bandwidth of multimedia streams than the network bandwidth level and also to minimize early-stage delay time for multimedia streams, which is to be played in mobile terminals.

A Traffic Adaptive MAC Scheduling for Bluetooth with Maximized throughput and Guaranteed fairness

  • Kim Tae suk;Choi Sung-Gi;Kim Sehun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.418-425
    • /
    • 2002
  • Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

  • PDF

Cost-benefits Based Resource Management Scheduling Model using Hierarchical Load Balancing Policy in Cloud Computing Environment (클라우드 컴퓨팅 환경에서 계층형 부하 분산정책을 이용한 비용이익 기반 자원관리 스케줄링 모델)

  • Jo, Dong-Wook;Kim, Jae-Kwon;Kim, Tae-Young;Oh, Hyun-Chang;Lee, Suk-Woo;Lee, Jong-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.129-132
    • /
    • 2012
  • 클라우드 환경을 구성하는 자원을 능동적으로 사용 하기 위해서는 부하분산 정책이 필요하며 효율적으로 작업을 할당하고 공유할 수 있는 자원 관리 스케줄링이 필요하다. 또한 자원의 경제성을 유념하여 클라우드 서비스 제공자의 이익 창출과 자원 활용도의 개선을 실현해야하고 서비스 사용자의 만족도를 향상시켜야 한다. 본 논문에서는 계층형 부하분산 정책을 이용한 비용이익 기반 자원관리 스케줄링 모델(Cost-benefits Based Resource Management Scheduling Model using Hierarchical Load Balancing Policy)을 제안한다. 제안하는 모델은 계층형 부하분산 정책을 적용하여 자원을 통합, 관리함으로서 개선된 유지보수성을 제공하며, 서비스 제공자의 비용이익을 고려하여 각 자원들마다의 자원협상 메커니즘과 비용이익을 우선으로 하는 가격 결정 알고리즘을 제공하여 합리적인 자원 할당이 가능하다.

A Study on the IT Infrastructure of Korean Apparel Industry (국내 의류업계의 IT 인프라 구조에 관한 연구)

  • Choi, In-Ryu
    • The Research Journal of the Costume Culture
    • /
    • v.17 no.3
    • /
    • pp.512-522
    • /
    • 2009
  • The purpose of this study is to analyze IT infrastructure of Korean apparel industry in order to enhance business effectiveness and customer's satisfaction in information society with global networks. For this study, the questionnaires were distributed to 57 apparel industries in Korea. The data were analyzed by factor analysis, descriptive statistics, Cronbach's alpha coefficient, multi regression analysis. The results of this study are as follow: First, Considering the apparel industry, construction of information system is essential for assistance of information policy and utilization of information. Understanding of e-business policy affects profits of suppliers. Second, Apparel industry with higher information policy has higher productivity with flexibility. Third, Apparel industry which has close relationship with suppliers has better customer support. Flexible scheduling and production line are important factors for quick response of customer's order and need.

  • PDF

Joint Optimal Production-Delivery Policy for Multiple Products with a Single Production Facility

  • Kim Taebok;Hong Yushin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.537-541
    • /
    • 2003
  • The synchronization of production-delivery artivities is one of crucial factors to get competitive collaboration benefits between the manufacturer and the retailor(s). There were several researches to study on He optimal delivery policy to minimize the total cost of integrated system of both manufacturer and retailor(s). In this research, we investigate the joint optimal shipment policy in case that a manufacturer produces multiple products sharing a single production facility in the manufacturer side and retailor(s) deploys JIT delivery pattern with equal-size shipment policy. We formulate this problem as a form of 'Common Cycle Approach' in classical ELSP (Economic Lot Scheduling Problem) and provide simple optimal solution procedure.

  • PDF

The Social Effects of Higher Education Policy in South Korea: The Rise of the "Pig Mum" phenomenon

  • Lee, Eugene;Calonge, David Santandreu;Hultberg, Patrik
    • Journal of Contemporary Eastern Asia
    • /
    • v.18 no.1
    • /
    • pp.70-93
    • /
    • 2019
  • The contemporary educational system in South Korea is built on high-stakes standardised tests, a manifestation of the national project of social reconstruction and reform. One recent outcome is the emergence of an unfamiliar yet ubiquitous phenomenon: the "pig mum"; a Korean parent who is fully involved in organising, scheduling and managing the educational process from primary to secondary school for a group of children in a neighbourhood. Based on a quasimixed method utilizing a survey of a group of students and parents, this pilot study explores the "pig mum" phenomenon and its linkage to education policy. The authors conclude that the current educational policy fails to achieve the ideals it professes to value. This creates deep and negative societal norms that endanger a growing generation of students by creating a parallel private education market environment where "pig mums" thrive.

An Adaptive Batching Scheduling Policy for Efficient User Services (효율적인 사용자 서비스를 위한 적응적 배칭 스케줄링 정책)

  • Choe, Seong-Uk;Kim, Jong-Gyeong;Park, Seung-Gyu;Choe, Gyeong-Hui;Kim, Dong-Yun;Choe, Deok-Gyu
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.2
    • /
    • pp.44-53
    • /
    • 2000
  • The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an adaptive batch scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme selects dynamically multiple videos in given intervals based on the service patterns which reflect the popularity distribution(Zipf-distribution) and resource utilizations. Experimental results of simulations show that the proposed scheme improves about 20-30 percentage of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

  • PDF

Multi-Programmed Simulation of a Shared Memory Multiprocessor System (공유메모리 다중프로세서 시스템의 다중 프로그래밍 모의실험 기법)

  • 최효진;전주식
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.3_4
    • /
    • pp.194-204
    • /
    • 2003
  • The performance of a shared memory multiprocessor system is dependent on the system software such as scheduling policy as well as hardware system. Most of existing simulators, however, do not support simulation for multi-programmed environment because they can execute only a single benchmark application at a time. We propose a multi-programmed simulation method on a program-driven simulator, which enables the concurrent executions of multiple parallel workloads contending for limited system resources. Using the proposed method, system developers can measure and analyze detailed effects of resource conflicts among the concurrent applications as well as the effects of scheduling policies on a program-driven simulator. As a result, the proposed multi-programmed simulation provides more accurate and realistic performance projection to design a multiprocessor system.