• Title/Summary/Keyword: user scheduling

Search Result 386, Processing Time 0.03 seconds

Scheduling Scheme for Cloud Computing based on Workflow Characteristics (클라우드 컴퓨팅에서 워크플로우의 특성을 고려한 스케줄링 기법)

  • Kim, Jeong-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.9
    • /
    • pp.1-8
    • /
    • 2012
  • Cloud computing has got great popularity in recent times because users can easily access its resources as well as service providers can use efficiently use its resources. By the way, cloud computing are composed of heterogeneous resources and workflows of user application have various characteristics. So, the main goal of this paper is to design new efficient workflow scheduling algorithm, which classifies workflows through their importance degree and allocates resources to each workflow based on QoS metrics such as responsibility, cost and load balancing. Simulation results show that the proposed scheme can improve the responsibility as well as availability of resource.

A Study on Developing a Scheduling System for a Die Manufacturing System Using ILOG (ILOG를 활용한 금형 생산시스템의 일정계획 시스템 개발에 관한 연구)

  • Jeong, Han-Il;Chung, Dae-Young;Kim, Ki-Dong;Park, Chan-Kwon;Park, Jin-Woo
    • IE interfaces
    • /
    • v.13 no.4
    • /
    • pp.564-571
    • /
    • 2000
  • Manufacturing companies are implementing a so-called customer-centered supply chain management to have a competitive advantage. In these efforts, collaboration not only within a company but also with suppliers, partners and customers is emphasized. The fast delivery, reducing the total lead-time from development to delivery, is pursued more than ever, though the quality and cost are still importantly regarded. Die manufacturing companies are not exception from these trends, because a die is a necessary tool for almost manufacturing industries. The planning and scheduling system plays an important role in supply chain management. In this study, we address a scheduling problem of a die manufacturing company. The problem is very complex due to many reasons including the uncertainty in environment and the complexity of constraints. Considering the importance of due-date satisfaction and human planners' roles, we designed the solution algorithm and the user interface respectively. In the implementation phase, modeling constructs and basic solution algorithms of ILOG solver and ILOG scheduler are used. In the paper, the problem and the algorithm are described with ILOG constructs, and the experience of use is also addressed.

  • PDF

A Peer Availability Period Prediction Strategy for Resource Allocation in Internet-based Distributed Computing Environment (인터넷 기반 분산컴퓨팅환경에서 자원할당을 위한 피어 가용길이 예상 기법)

  • Kim Jin-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.69-75
    • /
    • 2006
  • Internet-based distributed computing environment have been developed for advanced science and engineering by sharing large-scale resources. Therefore efficient scheduling algorithms for allocating user job to resources in the Internet-based distributed computing environment are required. Many scheduling algorithms have been proposed. but these algorithms are not suitable for the Internet-based Distributed computing environment. That is the previous scheduling algorithm does not consider peer self-control. In this paper, we propose a Peer Availability Period Prediction Strategy for Internet-based distributed computing environment and show that our Strategy has better performance than other Strategy through extensive simulation.

  • PDF

A Task Scheduling Strategy in Cloud Computing with Service Differentiation

  • Xue, Yuanzheng;Jin, Shunfu;Wang, Xiushuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5269-5286
    • /
    • 2018
  • Task scheduling is one of the key issues in improving system performance and optimizing resource management in cloud computing environment. In order to provide appropriate services for heterogeneous users, we propose a novel task scheduling strategy with service differentiation, in which the delay sensitive tasks are assigned to the rapid cloud with high-speed processing, whereas the fault sensitive tasks are assigned to the reliable cloud with service restoration. Considering that a user can receive service from either local SaaS (Software as a Service) servers or public IaaS (Infrastructure as a Service) cloud, we establish a hybrid queueing network based system model. With the assumption of Poisson arriving process, we analyze the system model in steady state. Moreover, we derive the performance measures in terms of average response time of the delay sensitive tasks and utilization of VMs (Virtual Machines) in reliable cloud. We provide experimental results to validate the proposed strategy and the system model. Furthermore, we investigate the Nash equilibrium behavior and the social optimization behavior of the delay sensitive tasks. Finally, we carry out an improved intelligent searching algorithm to obtain the optimal arrival rate of total tasks and present a pricing policy for the delay sensitive tasks.

Adaptive Radio Resource Allocation for a Mobile Packet Service in Multibeam Satellite Systems

  • Lim, Kwang-Jae;Kim, Soo-Young;Lee, Ho-Jin
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.43-52
    • /
    • 2005
  • In this paper, we introduce an adaptive radio resource allocation for IP-based mobile satellite services. We also present a synchronous multibeam CDMA satellite system using an orthogonal resource sharing mechanism among downlink beams for the adaptive packet transmission. The simulation results, using a Ka-band mobile satellite channel and various packet scheduling schemes, show that the proposed system and resource allocation scheme improves the beam throughput by more than two times over conventional systems. The simulation results also show that, in multibeam satellite systems, a system-level adaptation to a user's channel and interference conditions according to user locations and current packet traffic is more efficient in terms of throughput improvement than a user-level adaptation.

  • PDF

A Study on Transmission Methods for Multimedia Data (멀티미디어 데이터의 효율적인 전송기법에 관한 연구)

  • Oh, Jong-Oh;Park, Sei-Seung
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.9
    • /
    • pp.873-882
    • /
    • 2004
  • Multimedia database system can be improve data transferring efficiency by consulting catalogue database which is storing the object and serving multimedia meta-database and perform the pre-scheduling for data transferring and by delaying of transferring to reduce the responding timeand reordering the data by various method of transferring. By Introducing these techniques we can enhance the server resources utilizing, minimizing the users responding time and can decrease failure at the scheduling itself and easily search and transfer the information that the user wanted. Like this, the importance of multimedia information treating skill and efficient management are widely recognized and expected lots of research and development to form a butter efficient multimedia database syst

  • PDF

Downlink Wireless Adaptive Modulation and Coding Scheme (AMC)-based Priority Queuing Scheduling Algorithm for Multimedia Services

  • Park, Seung-Young;Kim, Dong-Hoi
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1622-1631
    • /
    • 2007
  • To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

  • PDF

A Study on Computer-Generated time Standard Calculations with Applications (작업표준시간산출(作業標準時間算出)의 전산화(電算化)와 적용사례(適用事例))

  • Yu, Byeong-Nam;Sin, Hyeon-Pyo
    • IE interfaces
    • /
    • v.1 no.1
    • /
    • pp.63-72
    • /
    • 1988
  • Since many small and medium sized enterprises in Korea have lack of funds to install a commercial computer packages for work standards and work scheduling. This study has been attempted to develop the computer-generated package to ease those problems. The system consisted of three major parts. The first part is a work measurement program applying W.F.(work factor) predetermined time standards for work standards. The second part is a work scheduling program which calculates each operator's machine and job allocation. The last part is a control program for the production outputs and the machine utilization monitoring. The system is programmed by dBASE III for the IBM-PC compatibles for the sake of user's conveniences.

  • PDF

Development of Web-based Automatic Demand Forecasting Module

  • Kang, Soo-Kil;Kang, Min-Gu;Park, Sun-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2490-2495
    • /
    • 2005
  • The scheduling of plant should be determined based on the product demands correctly forecasted by reasonable methods. However, because most existing forecasting packages need user's knowledge about forecasting, it has been hard for plant engineers without forecasting knowledge to apply forecasted demands to scheduling. Therefore, a forecasting module has been developed for plant engineers without forecasting knowledge. In this study, for the development of the forecasting module, an automatic method using the ARIMA model that is framed from the modified Box-Jenkins process is proposed. And a new method for safety inventory determination is proposed to reduce the penalty cost by forecasting errors. Finally, using the two proposed methods, the web-based automatic module has been developed.

  • PDF

Optimal Packet Scheduling in a Multiple Access Channel with Energy Harvesting Transmitters

  • Yang, Jing;Ulukus, Sennur
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.140-150
    • /
    • 2012
  • In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.