• Title/Summary/Keyword: 롤백

Search Result 30, Processing Time 0.023 seconds

Optimum Blank Design of Automobile Sub-Frame (우물정(井)자형 Sub-frame의 블랭크 설계)

  • Kim, Jong-Yop;Kim, Nak-Soo;Heo, Man-Seong
    • Transactions of Materials Processing
    • /
    • v.7 no.3
    • /
    • pp.260-273
    • /
    • 1998
  • A new blank design method is proposed to predict the optimum initial blank shape in the sheet metal forming process. The rollback method for blank shape design takes the difference between final deformed shaped and target contour shape into account. Based on the method a computer program composed of blank design module FE-analysis program and mesh generation module is developed. The rollback method is applied to square cup drawing process with the flange of unifiorm size around its periphery to confirm its validity. The optimum initial blank shape is obtained from an arbitrary square blank after three modification. Good agreements are recognized between the numerical results and the published results for initial blank shape and thickness strain distribution. The optimum blank shape for two parts of automobile sub-frame is designed, The thickness distribution and the level of punch load is improved. Also the method is applied to design the weld line in the tailor-welded blank. It is concluded that the rollback method is an effective and convenient method for an optimum blank shape design.

  • PDF

Design and Implementation of Reliable Distributed Programming Environment based on HORB (HORB에 기반한 신뢰성 있는 분산 프로그래밍 환경의 설계 및 구현)

  • Hyun, Mu-Yong;Kim, Shik;Kim, Myung-Jun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.2
    • /
    • pp.1-9
    • /
    • 2002
  • The use of Object-Oriented Distributed Programming(OODP) environment such as DCOM, DSOM, Java RMI, CORBA to implement distributed applications is becoming increasingly popular. However, absence of a fault-tolerance feature in these middleware platforms complicates the design and implementation of reliable distributed object-based applications, although they greatly enhance the quality and reusability of the distributed object-based applications. In this paper, we propose a fault-tolerant programming environment based on RMI, namely Evergreen, for the reliable distributed computing with checkpoints and rollback-recovery mechanism. Based on a series of experiments, we evaluate the performance of Evergreen and find its possibility of extension to fully support our optimal design goal.

Optimum Blank Design of Automobile Sub-Frame (우물정자형 Sub-frame의 블랭크 설계)

  • 김종엽;김낙수;허만성
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1998.03a
    • /
    • pp.185-195
    • /
    • 1998
  • A new blank design method is proposed to predict the optimum initial blank shape in the sheet metal forming process. The rollback method for blank shape design takes the difference between final deformed shape and target contour shape into account. Based on the method, a computer program composed of blank design module, FE-analysis program and mesh generation module is developed. The rollback method is applied to square cup drawing process with the flange of unifiorm size around its periphery to confirm its validity. The optimum initial blank shape is obtained from an arbitrary square blank after three modifications. Good agreements are recognized between the numerical results and the published results for initial blank shape and thickness strain distribution. The optimum blank shape for two parts of automobile sub-frame is designed. The thickness distribution and the level of punch load is improved. Also, the method is applied to design the weld line in the tailor-welded blank. It is concluded that the rollback method is an effective and convenient method for an optimum blank shape design.

  • PDF

Study on the Static/Dynamic Measurements and Structural Analysis Procedure of Wheel Loaders (휠로더의 정적/동적 실차 계측 및 강도 평가법에 대한 연구)

  • Choung, Joon-Mo;Kim, Gyu-Sung;Jang, Young-Sik;Choe, Ick-Hung;Heo, Min-Soo
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1303-1309
    • /
    • 2003
  • This paper presents the static and dynamic measurements for the strength and motion characteristics as well as the improved procedures to assess strength of wheel loaders. Two scenarios for static measurement were decided by which cylinder was actuating. The dynamic measurement was performed for two types of motion, that is, simple reciprocation of the working devices and actual working motion including traveling, digging and dumping. The measured items were stresses, cylinder pressures and strokes. Stress induced by bucket working showed higher level than that by boom working. The measured cylinder speeds were relatively superior to the design speeds. Working stress histories were thought to be closer to static rather than dynamic. A fully assembled FE model was prepared for structural analysis. In this paper, a more simple method was suggested to avoid nonlinearity caused by heave of rear frame under digging forces. Also how brake affected on structural behavior and digging force was examined closely in relation with tire pressure. It was confirmed that the overall stress level of wheel loader during turning traveling with loaded bucket was far lower than the yield stress of material.

  • PDF

A Time-Redundant Recovery Scheme of TMR failures Using Retry and Rollback Techniques (재실행과 Rollback 기법을 사용한 TMR 고장의 시간여분 복구 기법)

  • Kang, Myung-Seok;Son, Byoung-Hee;Kim, Hag-Bae
    • The KIPS Transactions:PartA
    • /
    • v.13A no.5 s.102
    • /
    • pp.421-428
    • /
    • 2006
  • This paper proposes an integrated recovery approach applying retry and rollback techniques to recover the TMR failure. Combining the time redundancy techniques with W system is apparently effective to recover the TMR failure(or masked error) primarily caused by transient faults. These policies need fewer reconfigurations at the cost of extra time required for the time redundant schemes. The optimal numbers of retry and rollback to minimize the mean execution time of tasks are derived for the proposed method through computing the likelihoods of all possible states of the failed system. The effectiveness of the proposed method is validated through examining certain numerical examples and simulations conducted with a variety of parameters governing environmental characteristics.

An Efficient Record-Replay Mechanism using Hardware Performance Counters and Debugging Facilities (하드웨어 성능 카운터와 디버깅 기능을 이용한 리코드-리플레이 방법)

  • Maeng, Ji-Chan;Ryu, Min-Soo
    • The KIPS Transactions:PartA
    • /
    • v.18A no.5
    • /
    • pp.177-180
    • /
    • 2011
  • In this paper, we present a record-replay technique based on interrupt logging and reproduction. Race conditions have been considered as the main source of nondeterminism in conventional record-replay approaches. However, interrupts are another source of nondeterministic computer system behavior, which must be reproduced at accurate time points, let alone the order of interrupt occurrence. We show that an interrupt-based replayer can be efficiently and effectively implemented by using hardware performance counters and debugging functionality. Experiments also show that the runtime overhead of the interrupt-based replayer is sufficiently low.

Cache Invalication Schemes for Time Constraint Applications in Mobile Ad hoc Networks (모바일 애드혹 네트워크에서 시간제약 응용을 위한 캐쉬 무효화 기법)

  • Jae-Ho Choi;Jae-Oh Oh;Myong-Soo Lee;SangKeun Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1276-1279
    • /
    • 2008
  • 최근 모바일 장치의 증가와 무선 네트워크 환경의 발전은 모바일 애드혹 네트워크에 대한 관심을 증가시키고 있다. 최근까지의 연구는 모바일 애드혹 네트워크에서 데이터 접근성(Accessibility) 향상을 위해 복제의 활용이 효율적임을 증명하고 있다. 복제 기법이 모바일 애드혹 네트워크에서 실제로 활용되기 위해서는 원본과 복제본 사이에 일관성(Consistency)이 확보되어야만 한다. 기존의 연구에서는 일관성 확보를 위해 원본을 가진 노드에게 확인하는 기법을 활용하고 있다. 그러나, 시간제약을 가지는 응용의 경우 원본을 가진 노드에게 확인하는 기법은 효율적이지 못하며, 때로는 심각한 문제를 일으킬 수도 있다. 본 논문에서는 시간제약응용을 위한 캐쉬 무효화 기법을 제안하고 있다. 제안하는 기법을 통해 기존의 일관성 확인 기법에서 일어나는 '롤백(Rollback)' 문제를 해결할 수 있었으며, 접근시간(Access time) 측면에서 성능향상을 얻을 수 있었다. 실험 결과는 본 논문의 접근시간 측면에서의 효율적임을 증명하여 준다.

IMMORTAL : Fault Tolerant Distributed Middleware System based on Remote Method Invocation (IMMORTAL : 원격 메쏘드 호출에 기반한 결함허용 분산 미들웨어 시스템)

  • Hyun, Mu-Yong;Kim, Shik;Kim, Myung-Jun;Yamakita, Jiro
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.562-572
    • /
    • 2002
  • Distributed object technologies have become popular in developing distributed systems. Although such middleware platforms as DSOM, DCOM, CORBA and Java RMI ease the development of distributed applications, they do not directly improve the reliability and the availability of these applications. Because the task of developing fault-tolerance techniques for distributed object paradigms is often complicated and error-prone, there is a great need for a development toolkit that enhances the reliability and the availability of distributed objects. In this paper, we propose a fault-tolerant distributed middleware system based on RMI, called IMMORTAL. We use a log-based rollback-recovery mechanism for supporting reliable distributed computing. Through a series of experiments, we observe that benchmark applications on the IMMORTAL tolerate hardware and software failures and evaluate its performance and scalability.

New Z-Cycle Detection Algorithm Using Communication Pattern Transformation for the Minimum Number of Forced Checkpoints (통신 유형 변형을 이용하여 검사점 생성 개수를 개선한 검사점 Z-Cycle 검출 기법)

  • Woo Namyoon;Yeom Heon Young;Park Taesoon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.12
    • /
    • pp.692-703
    • /
    • 2004
  • Communication induced checkpointing (CIC) is one of the checkpointing techniques to provide fault tolerance for distributed systems. Independent checkpoints that each distributed process produces without coordination are likely to be useless. Useless checkpoints, which cannot belong to any consistent global checkpoint sets, induce nondeterminant rollback. To prevent the useless checkpoints, CIC forces processes to take additional checkpoints at proper moment. The number of those forced checkpoints is the main source of failure-free overhead in CIC. In this paper, we present two new CIC protocols which satisfy 'No Z-Cycle (NZC)'property. The proposed protocols reduce the number of forced checkpoints compared to the existing protocols with the drawback of the increase in message delay. Our simulation results with the synthetic data show that the proposed protocols have lower failure-free overhead than the existing protocols. Additionally, we show that the classical 'index-based checkpointing' protocols are inefficient in constructing the consistent global cut in distributed executions.

Cache Invalidation Schemes based on Time Guarantee for Improving Access Time in Mobile Ad hoc Networks (모바일 애드혹 네트워크에서 캐쉬 접근 시간 향상을 위한 시간보증 기반의 캐쉬무효화 기법)

  • Choi, Jae-Ho;Oh, Jae-Oh;Lee, Myong-Soo;Lee, Sang-Keun
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.65-72
    • /
    • 2009
  • Due to the popularity of mobile devices and advances in wireless communication technologies, a mobile ad hoc network has received a lot of attention. In the existing data replication management research, the use of a replica has been shown to be an efficient technique for improving data accessibility. However, to use a replica in ad hoc networks, the data consistency between the original data and the replica should be guaranteed. In the traditional research, a mobile node should check an original data whether the data is updated or not. However, It may be costly or sometimes impossible to check the original data. In the case of the time constraint applications, the checking cost can cause more serious problem. In this paper, we propose the time-guarantee based cache invalidation schemes for time constraint applications and the threshold based compensation method to enhance the time-guarantee based scheme. The proposed schemes can remove the "rollback" problem. Simulation results show that our schemes outperform the previous ones in terms of access time with little loss of data currency.