• Title/Summary/Keyword: Machine availability

Search Result 167, Processing Time 0.029 seconds

Improving Availability of Embedded Systems Using Memory Virtualization

  • Son, Sunghoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.5
    • /
    • pp.11-19
    • /
    • 2022
  • In this paper, we propose a fault tolerant embedded system using memory redundancy on the full-virtualization based virtual machine monitor. The proposed virtual machine monitor first virtualizes main memory of embedded system utilizing efficient shadow page table scheme so that the embedded system runs as a virtual machine on the virtual machine monitor. The virtual machine monitor makes the backup of the embedded system run as another virtual machine by copying memory contents of the embedded system into memory space of backup system according to predefined schedules. When an error occurs in the target virtual machine, the corresponding standby virtual machine takes the role of target virtual machine and continues its operation. Performance evaluation studies show that such backups and switches of virtual machines are performed with minor performance degradation.

Optimal Provisioning Quantity Determination of Consumable Concurrent Spare Part under the Availability Limitation (운용가용도 제약하에서의 소모성 동시조달부품의 최적구매량 결정)

  • 오근태;김명수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.48
    • /
    • pp.113-122
    • /
    • 1998
  • In this paper we consider the CSP requirements determination problem of new equipment(machine) system. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the consumable parts to derive the associated CSP requirement determination model in mathematical expression. Based on these analyses, a mathematical model is derived for making an optimal CSP requirement determination subject to tile constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the cost minimization problem that should satisfy the operational availability limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure is derived.

  • PDF

Optimal Provisioning Quantity Determination of Concurrent Spare Parts including Consumable Items and Repairable Items under the Availability Limitation (운용가용도 제약하에서 소모성부품과 수리순환부품이 혼재된 동시조달부품의 최적구매량 결정)

  • 오근태;김명수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.59
    • /
    • pp.53-67
    • /
    • 2000
  • In this paper we consider the CSP requirements determination problem of new equipment(machine) system. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the consumable parts and the repairable parts to derive the associated CSP requirement determination model in mathematical expression. Based on these analyses, a mathematical model Is derived for making an optimal CSP requirement determination subject to the constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process and the repair time has an exponential distribution. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the cost minimization problem that should satisfy the operational availability limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure Is derived.

  • PDF

Heuristic Algorithm for the Single-machine Scheduling with Periodic Maintenance (주기정비를 고려한 단일기계 일정계획을 위한 휴리스틱 알고리즘 설계)

  • Lee, Sang-Heon;Lee, In-Gu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.3
    • /
    • pp.318-327
    • /
    • 2008
  • This paper considers a single-machine scheduling problem with availability constraints. In many realistic situations, machines may not be always available due to various reasons such as maintenance, breakdown and repair. However, most literature on scheduling assume that the machines are available at all times. This paper deals with a single-machine scheduling problem with periodic maintenance. If the maintenance decision is made jointly with the job scheduling, the system will be more effective. The objective is to minimize the total completion time of jobs. This problem is proved to be NP-hard in the strong sense. The proposed breaking heuristic(BH) algorithm rule is established by some theorems and conditions. Our computational results show that the BH algorithm is much more efficient than existing heuristic.

A Model for Man-Machine System Evaluation (II) (인간 - 기계시스템의 평가모델 (II))

  • 이상도;하정진;정중희;이동춘
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.9 no.13
    • /
    • pp.17-22
    • /
    • 1986
  • Man-machine system is an integrated total system which is linked by functions of man and machine, and the value of the system is determined by its compatability. And it is able to evaluate the system value on the aspects of utility, availability, and cost benefit. The authors previously represented the methodology of system utility using transfer functions, and this paper successively discusses the reliability of man-machine system. The reliability estimation and evaluation methodologies are briefly mentioned, and some examples are shown in this paper.

  • PDF

Fuzzy Logic-driven Virtual Machine Resource Evaluation Method for Cloud Provisioning Service (클라우드 프로비저닝 서비스를 위한 퍼지 로직 기반의 자원 평가 방법)

  • Kim, Jae-Kwon;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.1
    • /
    • pp.77-86
    • /
    • 2013
  • Cloud computing is one of the distributed computing environments and utilizes several computing resources. Cloud environment uses a virtual machine to process a requested job. To balance a workload and process a job rapidly, cloud environment uses a provisioning technique and assigns a task with a status of virtual machine. However, a scheduling method for cloud computing requires a definition of virtual machine availabilities, which have an obscure meaning. In this paper, we propose Fuzzy logic driven Virtual machine Provisioning scheduling using Resource Evaluation(FVPRE). FVPRE analyzes a state of every virtual machine and actualizes a value of resource availability. Thus FVPRE provides an efficient provisioning scheduling with a precise evaluation of resource availability. FVPRE shows a high throughput and utilization for job processing on cloud environments.

Fault Diagnosis in a Virtual Machine using CORBA (CORBA를 이용한 가상기계에서의 고장진단에 관한 연구)

  • 서정완;강무진;정순철;김성환
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.109-114
    • /
    • 1997
  • As CNC machine tool is one of core elements of manufacturing system, it is much important that it remains without troubleshoots. As a virtual machine is a recent alternative using IT for optimal utilization of CNC machine tool, it is a computer model that represents a CNC machine tool. But a virtual machine is still conceptual. So, in this paper, it is proposed that a virtual machine be a realistic model in the fault diagnosis module. For this purpose, the fault diagnosis system of machine tool using CORBA and fault diagnosis expert system has been implemented. Using this system, we have expections to diagnose exactly and prompty without the restriction of time or location, to reduce MTTR(Mean Time To Repair) and finally to increase the availability of manufacturing system.

  • PDF

Sentiment Analysis to Classify Scams in Crowdfunding

  • shafqat, Wafa;byun, Yung-cheol
    • Soft Computing and Machine Intelligence
    • /
    • v.1 no.1
    • /
    • pp.24-30
    • /
    • 2021
  • The accelerated growth of the internet and the enormous amount of data availability has become the primary reason for machine learning applications for data analysis and, more specifically, pattern recognition and decision making. In this paper, we focused on the crowdfunding site Kickstarter and collected the comments in order to apply neural networks to classify the projects based on the sentiments of backers. The power of customer reviews and sentiment analysis has motivated us to apply this technique in crowdfunding to find timely indications and identify suspicious activities and mitigate the risk of money loss.

Provisioning Quantity Determination of Consumable Concurrent Spare Part with Objective Availability Limitation under Cannibalization Allowed (부품재활용이 허용될 때 목표운용가용도 조건을 갖는 소모성 동시조달부품의 구매량 결정)

  • Oh, Geun-Tae;Kim, Myeong-Su
    • Journal of Applied Reliability
    • /
    • v.4 no.2
    • /
    • pp.91-104
    • /
    • 2004
  • In this paper we consider the concurrent spare part(CSP) requirements problem of new equipment system. When a part fails, the part is replaced and the repair of failed part is impossible and cannibalization is allowed. We assume that the failure of a part knows a Poisson process. The operational availability concept in CSP is defined, and derive a formula to calculate the operational availability using expected machine operating time during CSP period. A mathematical model is derived for making an CSP requirement determination subject to the constraint of satisfying any given operational availability limitation and an heuristic solution search procedure is derived. An illustrative example is shown to explain the solution procedure.

  • 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