• Title/Summary/Keyword: Distributed Scheduling

Search Result 295, Processing Time 0.021 seconds

A Development of SCM Model in Chemical Industry Including Batch Mode Operations (회분식 공정이 포함된 화학산업에서의 공급사슬 관리 모델 개발)

  • Park, Jeung Min;Ha, Jin-Kuk;Lee, Euy Soo
    • Korean Chemical Engineering Research
    • /
    • v.46 no.2
    • /
    • pp.316-329
    • /
    • 2008
  • Recently the increased attention pays on the processing of multiple, relatively low quantity, high value-added products resulted in adoption of batch process in the chemical process industry such as pharmaceuticals, polymers, bio-chemicals and foods. As there are more possibilities of the improvement of operations in batch process than continuous processes, a lot of effort has been made to enhance the productivity and operability of batch processes. But the chemical process industry faces a range of uncertainties factors such as demands for products, prices of product, lead time for the supply of raw materials and in the production, and the distribution of product. And global competition has made it imperative for the process industries to manage their supply chains optimally. Supply chain management aims to integrate plants with their supplier and customers so that they can be managed as a single entity and coordinate all input/output flows (of materials, information) so that products are produced and distributed in the right quantities, to the right locations, and at the right time.The objective of this study is to solve the purchase, distribution, production planning and scheduling problem, which minimizes the total costs of production, inventory, and transportation under uncertainty. And development of SCM model in chemical industry including batch mode operations. Through that, the enterprise can respond to uncertainty. Also integrated process optimal planning and scheduling model for manufacturing supply chain. The result shows that, the advantage of supply chain integration are quality matters seen by customers and suppliers, order schedules, flexibility, cost reduction, and increase in sales and profits. Also, an integration of supply chain (production and distribution system) generates significant savings by trading off the costs associated with the whole, rather than minimizing supply chain costs separately.

Concurrency Control for Mobile Transactions consisted mainly of Update Operations in Broadcast Environments (방송 환경에서 갱신위주의 이동 트랜잭션을 위한 동시성 제어 방법)

  • Kim, Chi-Yeon;Jung, Min-A
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.4
    • /
    • pp.357-365
    • /
    • 2008
  • Broadcast is a efficient interactive method between a server and mobile clients via wireless channel and broadcast environments are incarnating as various applications. Most studies have been proposed in broadcast environments deal with read-only mobile transactions, many applications are emerging recently that need to manage the update transactions at mobile clients. So we propose a concurrency control for mobile transactions consisted mainly of update operations in broadcast environments. As an optimistic approach is applied for scheduling update transactions, repetitive aborts of update transactions are occur due to conflict between transactions. To solve this problem update transactions must have been executed with distributed manner, but unnecessary aborts are occur as well because of continuous restart. Thus, in this paper we propose a method that transactions are executed distributed manner and can avoid unnecessary aborts of update transactions. Proposed method has no unnecessary uplink and can save resources of mobile client.

  • PDF

Duplication Scheduling of Periodic Tasks Based on Precedence Constraints and Communication Costs in Distributed Real-Time Systems (분산 실시간 시스템에서 우선순위와 통신비용을 고려한 주기적 타스크들의 중복 스케줄링)

  • Park, Mi-Kyoung;Kim, Chang-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.4
    • /
    • pp.378-389
    • /
    • 1999
  • Parallel tasks in distributed real-time systems can be divided into several subtasks and be executed in parallel according to their real-time attributes. But, it is difficult to gain the optimal solution which is to allocate a tasks deadline into the subtasks deadline while minimizing the subtasks deadline miss. Tn this Paper, we propose the algorithm that allocates deadlines into each subtask, according to the attributes of each subtask(i.e. using communication time and execution time to periodic tasks). Also, we suggest a processor mapping algorithm that considers the communication time among the processors and the effective duplication algorithm which is allocated to the identical processor for the purpose of improving the communication time between the subtasks. We can obtain a result that reduces IPC(Inter-Processor Communication) time and uses the idle processor through applying effective real-time attributes to FUTD(Fully connected, Unbounded Task Duplication) algorithms. As a result, we can improve the average processor utilization.

  • PDF

A Method on the Realization of QoS Guarantee in the Grid Network (그리드 네트워크에서의 QoS 보장방법 구현)

  • Kim, Jung-Yun;Na, Won-Shin;Ryoo, In-Tae
    • Journal of Digital Contents Society
    • /
    • v.10 no.1
    • /
    • pp.169-175
    • /
    • 2009
  • Grid computing is an application to obtain the most efficient performance from computing resources in terms of cost and convenience. It is also considered as a good method to solve a problem that cannot be settled by conventional computing technologies such as clustering or is requiring supercomputing capability due to its complex and long-running task. In order to run grid computing effectively, it needs to connect high-performance computing resources in real-time which are distributed geographically. Answering to the needs of this grid application, researchers in several universities with Argonne National Laboratory in the USA (ANL) as the main axis have developed Globus. It is noticed, however, that the quality of service (QoS) is not guaranteed when certain jobs are exchanged through networks in the context of Globus. To tackle with this problem, the ANL has invented Globus Architecture for Reservation and Allocation (GARA). The researchers of this paper constructed a testbed for evaluating the ability to reserve resource in the GARA system and implemented the GARA code for it. We analyzed the applied results and discussed future research plans.

  • PDF

A Performance Analysis Based on Hadoop Application's Characteristics in Cloud Computing (클라우드 컴퓨팅에서 Hadoop 애플리케이션 특성에 따른 성능 분석)

  • Keum, Tae-Hoon;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.49-56
    • /
    • 2010
  • In this paper, we implement a Hadoop based cluster for cloud computing and evaluate the performance of this cluster based on application characteristics by executing RandomTextWriter, WordCount, and PI applications. A RandomTextWriter creates given amount of random words and stores them in the HDFS(Hadoop Distributed File System). A WordCount reads an input file and determines the frequency of a given word per block unit. PI application induces PI value using the Monte Carlo law. During simulation, we investigate the effect of data block size and the number of replications on the execution time of applications. Through simulation, we have confirmed that the execution time of RandomTextWriter was proportional to the number of replications. However, the execution time of WordCount and PI were not affected by the number of replications. Moreover, the execution time of WordCount was optimum when the block size was 64~256MB. Therefore, these results show that the performance of cloud computing system can be enhanced by using a scheduling scheme that considers application's characteristics.

A Distributed Spatial Indexing Technique based on Hilbert Curve and MBR for k-NN Query Processing in a Single Broadcast Channel Environment (단일방송채널환경에서 k-최근접질의 처리를 위한 힐버트 곡선과 최소영역 사각형 기반의 분산 공간 인덱싱 기법)

  • Yi, Jung-Hyung;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.37 no.4
    • /
    • pp.203-208
    • /
    • 2010
  • This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

Performance Improvement using Effective Task Size Calculation in Dynamic Load Balancing Systems (동적 부하 분산 시스템에서 효율적인 작업 크기 계산을 통한 성능 개선)

  • Choi, Min;Kim, Nam-Gi
    • The KIPS Transactions:PartA
    • /
    • v.14A no.6
    • /
    • pp.357-362
    • /
    • 2007
  • In distributed systems like cluster systems, in order to get more performance improvement, the initial task placement system precisely estimates and correctly assigns the resource requirement by the process. The resource-based initial job placement scheme needs the prediction of resource usage of a task in order to fit it to the most suitable hosts. However, the wrong prediction of resource usage causes serious performance degradation in dynamic load balancing systems. Therefore, in this paper, to resolve the problem due to the wrong prediction, we propose a new load metric. By the new load metric, the resource-based initial job placement scheme can work without priori knowledge about the type of process. Simulation results show that the dynamic load balancing system using the proposed approach achieves shorter execution times than the conventional approaches.

A Study on Power Trading Methods for in a Hydrogen Residential Model (수소주거모델의 전력 거래 참여 방안 고찰)

  • KISEOK JEONG;TAEYOUNG JYUNG
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.34 no.2
    • /
    • pp.91-99
    • /
    • 2023
  • Participation in power trading using surplus power is considered a business model active in the domestic energy trade market, but it is limited only if the legal requirements according to the type, capacity, and use of the facilities to be applied for are satisfied. The hydrogen residential demonstration model presented in this paper includes solar power, energy storage system (ESS), fuel cell, and water electrolysis facilities in electrical facilities for private use with low-voltage power receiving system. The concept of operations strategy for this model focuses on securing the energy self-sufficiency ratio of the entire system, securing economic feasibility through the optimal operation module installed in the energy management system (EMS), and securing the stability of the internal power balancing issue during the stand-alone mode. An electric facility configuration method of a hydrogen residential complex demonstrated to achieve this operational goal has a structure in which individual energy sources are electrically connected to the main bus, and ESS is also directly connected to the main bus instead of a renewable connection type to perform charging/discharging operation for energy balancing management in the complex. If surplus power exists after scheduling, participation in power trading through reverse transmission parallel operation can be considered to solve the energy balancing problem and ensure profitability. Consequentially, this paper reviews the legal regulations on participation in electric power trading using surplus power from hydrogen residential models that can produce and consume power, gas, and thermal energy including hybrid distributed power sources, and suggests action plans.

Distributed Coordination of Project Schedule Changes: An Agent-Based Compensatory Negotiation Approach (건설공사 공정변경의 분산조정 : 에이전트기반의 보상협의 방식)

  • Kim Kee-Soo
    • Korean Journal of Construction Engineering and Management
    • /
    • v.4 no.2 s.14
    • /
    • pp.74-81
    • /
    • 2003
  • In the construction industry, projects are becoming increasingly large and complex, involving multiple subcontractors. Traditional centralized coordination techniques used by the general contractors become less effective as subcontractors perform most wok and provide their own resources. When subcontractors cannot provide enough resources, they hinder their own performance as well as that of other subconractors and ultimately the entire project Thus, construction projects need a new distributed coordination approach wherein all of the concerned subcontractors can reschedule a project dynamically. To enable the distributed coordination framework of project schedule changes, the author developed an agent-based compensatory negotiation methodology, which allows intelligent software agents to simulate negotiations on behalf of their human subcontractors. In addition to this theoretical work, 1 designed and implemented a prototype to demonstrate the effectiveness of the framework. Thus, this research formalizes the necessary steps that would help construction project participants to increase the efficiency of their resource use, which in turn will enhance successful completions of whole projects.

A Network Performance Analysis System based on Network Monitoring for Analyzing Abnormal Traffic (비정상 트래픽 분석을 위한 네트워크 모니터링 기반의 네트워크 성능 분석 시스템)

  • Kim, So-Hung;Koo, Ja-Hwan;Kim, Sung Hae;Choi, Jang-Won;An, Sung-Jin
    • Convergence Security Journal
    • /
    • v.4 no.3
    • /
    • pp.1-8
    • /
    • 2004
  • Large distributed systems such as computational and data grids require that a substantial amount of monitoring data be collected for various tasks such as fault detection, performance analysis, performance tuning, performance prediction, security analysis and scheduling. to cope with this problem, they are needed network monitoring architecture which can collect various network characteristic and analyze network security state. In this paper, we suggest network performance and security analysis system based on network monitoring. The System suggest that users can see distance network state with tuning network parameters.

  • PDF