• Title/Summary/Keyword: Barrier Overhead

Search Result 8, Processing Time 0.025 seconds

Pantograph-catenary Dynamic Interaction for a Overhead Line Supported by Noise Barrier

  • Belloli, Marco;Collina, Andrea;Pizzigoni, Bruno
    • International Journal of Railway
    • /
    • v.5 no.2
    • /
    • pp.55-64
    • /
    • 2012
  • Subject of the paper is a particular configuration of overhead line, in which noise barrier structure is used as supports of the catenary instead of standard poles. This configuration is foreseen in case the noise barrier position is in conflict with the poles location. If the catenary is supported by the noise barrier, the motion that the latter undergo due to wave pressure associated to train transit is transmitted to the overhead line, so that potentially it influences the interaction between the catenary itself and the pantograph of the passing train. The paper focuses on the influence of such peculiar configuration on the quality of the current collection of high speed pantograph, for single and double current collection. The study has been carried out first with an experimental investigation on the pressure distribution on noise barrier, both in wind tunnel and with in-field tests. Subsequently a numerical analysis of the dynamics of the barrier subjected to the wave pressure due to train transit has been carried out, and the output of such analysis has been used as input data for the simulation of the pantograph-dynamic interaction at different speeds and with front or rear pantograph in operation. Consideration of structural modifications was then highlighted, in order to reduce the influence on the contact loss percentage.

Considering Barrier Overhead in Parallelizing AES-CCM (동기화 오버헤드를 고려한 AES-CCM의 병렬 처리)

  • Chung, Yong-Wha;Kim, Sang-Choon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.3
    • /
    • pp.3-9
    • /
    • 2011
  • In this paper, we propose workload partitioning methods in parallelizing AES-CCM which is proposed as the wireless encryption and message integrity standard IEEE 802.11i. In parallelizing AES-CCM having data dependency, synchronizations among processors are required, and multi-core processors have a very large range of synchronization performance. We propose and compare the performance of various workload partitioning methods by considering both the computational characteristics of AES-CCM and the synchronization overhead.

A Hardware Barrier Synchronization using Multi -drop Scheme in Parallel Computer Systems (병렬 컴퓨터 시스템에서의 Multi-drop 방식을 사용한 하드웨어 장벽 동기화)

  • Lee, June-Bum;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.485-495
    • /
    • 2000
  • The parallel computer system that uses parallel program on the application such as a large scale business or complex operation is required. One of crucial operation of parallel computer system is synchronization. A representative method of synchronization is barrier synchronization. A barrier forces all process to wait until all the process reach the barrier and then releases all of the processes. There are software schemes, hardware scheme, or combinations of these mechanism to achieve barrier synchronization which tends to use hardware scheme. Besides, barrier synchronization lets parallel computer system fast because it has fewer start-up overhead. In this paper, we propose a new switch module that can implement fast and fault-tolerant barrier synchronization in hardware scheme. A proposed barrier synchronization is operated not in full-switch-driven method but in processor-driven method. An effective barrier synchronization is executed with inexpensive hardware supports. Therefore, a new proposed hardware barrier synchronization is designed that it is operated in arbitrary network topology. In this paper, we only show comparison of barrier synchronization on Multistage Interconnection Network. This research results in 24.6-24.8% reduced average delay. Through this result, we can expect lower average delay in irregular network.

  • PDF

Value Analysis of Barrier-free Facilities at Subway Stations Using CVM with a Double Bounded Dichotomous Choice Question (이중양분선택형 질문법을 이용한 CVM에 의한 지하철 역사 Barrier-free 시설의 가치분석)

  • Jung, Hun-Young;Baik, Sang-Keun;Baek, Eun-Sang
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.5
    • /
    • pp.205-216
    • /
    • 2008
  • As the aged and physically disabled people are expected to increase in the next several years, traffic demand especially for the 'mobility handicapped people' will be stronger. According to this trend, our society needs the improvement of social overhead capital for the aged and the disabled. First of all, Barrier-free of public transport facilities is urgent case. The purpose of this study is to estimate value of the Barrier-free facilities at subway stations by using Contingent Valuation Method(CVM) with Double Bounded Dichotomous Choice Question and to analyze the factor which affects the WTP(Willingness To Pay) of subway users by using Survival Analysis. As a result of this study, 'Elevators' and 'Escalators' are higher than 'Handicapped Gate Machines' and 'Ramps for Wheelchair' in the aspect of the average willingness to pay. Therefore the government is recommended to install the Barrier-free facilities for going up and down such as 'Elevators' and 'Escalators', and then supply others for just using subway, and passing such as 'Handicapped Gate Machines' and 'Ramps for Wheelchair'. Also, the average willingness to pay of 'mobility handicapped people' is higher than that of 'normal people'. It indicates that 'mobility handicapped people' value each Barrier-free facility high compared to 'normal people'.

A Tool for On-the-fly Repairing of Atomicity Violation in GPU Program Execution

  • Lee, Keonpyo;Lee, Seongjin;Jun, Yong-Kee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.9
    • /
    • pp.1-12
    • /
    • 2021
  • In this paper, we propose a tool called ARCAV (Atomatic Recovery of CUDA Atomicity violation) to automatically repair atomicity violations in GPU (Graphics Processing Unit) program. ARCAV monitors information of every barrier and memory to make actual memory writes occur at the end of the barrier region or to make the program execute barrier region again. Existing methods do not repair atomicity violations but only detect the atomicity violations in GPU programs because GPU programs generally do not support lock and sleep instructions which are necessary for repairing the atomicity violations. Proposed ARCAV is designed for GPU execution model. ARCAV detects and repairs four patterns of atomicity violations which represent real-world cases. Moreover, ARCAV is independent of memory hierarchy and thread configuration. Our experiments show that the performance of ARCAV is stable regardless of the number of threads or blocks. The overhead of ARCAV is evaluated using four real-world kernels, and its slowdown is 2.1x, in average, of native execution time.

An Efficient Protocol for Causal Message Delivery in Distributed Mobile Systems (분산 이동 시스템에서 인과적 메시지 전달을 위한 효율적인 프로토콜)

  • 노성주;정광식;이화민;유헌창;황종선
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.2
    • /
    • pp.143-154
    • /
    • 2003
  • There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

Golf participation after rotator cuff repair: functional outcomes, rate of return and factors associated with return to play

  • Thomas R Williamson;Patrick G Robinson;Iain R Murray;Andrew D Murray;Julie M McBirnie;C Michael Robinson;Deborah J MacDonald;Nicholas D Clement
    • Clinics in Shoulder and Elbow
    • /
    • v.26 no.2
    • /
    • pp.109-116
    • /
    • 2023
  • Background: Golf is a popular sport involving overhead activity and engagement of the rotator cuff (RC). This study aimed to determine to what level golfers were able to return to golf following RC repair, the barriers to them returning to golf and factors associated with their failure to return to golf. Methods: Patients preoperatively identifying as golfers undergoing RC repair at the study centre from 2012 to 2020 were retrospectively followed up with to assess their golf-playing status, performance and frequency of play and functional and quality of life (QoL) outcomes. Results: Forty-seven golfers (40 men [85.1%] and 7 women [14.9%]) with a mean age of 56.8 years met the inclusion criteria, and 80.1% were followed up with at a mean of 27.1 months postoperatively. Twenty-nine patients (76.3%) had returned to golf with a mean handicap change of +1.0 (P=0.291). Golf frequency decreased from a mean of 1.8 rounds per week preinjury to 1.5 rounds per week postoperatively (P=0.052). The EuroQol 5-dimension 5-level (EQ-5D-5L) index and visual analog scale (EQ-VAS) score were significantly greater in those returning to golf (P=0.024 and P=0.002), although functional outcome measures were not significantly different. The primary barriers to return were ipsilateral shoulder dysfunction (78%) and loss of the habit of play (22%). Conclusions: Golfers were likely (76%) to return to golf following RC repair, including mostly to their premorbid performance level with little residual symptomatology. Return to golf was associated with a greater QoL. Persistent subjective shoulder dysfunction (78%) was the most common barrier to returning to golf.

Research on Science DMZ scalability for the high performance research data networking (연구데이터의 고성능 네트워킹을 위한 Science DMZ 확장성 연구)

  • Lee, Chankyun;Jang, Minseok;Noh, Minki;Seok, Woojin
    • KNOM Review
    • /
    • v.22 no.2
    • /
    • pp.22-28
    • /
    • 2019
  • A Science DeMilitarized Zone (DMZ) is an optimized network technology tailored to research data nature. The Science DMZ guarantees end-to-end network performance by forming a closed research network without redundant networking and security devices for the authorized researchers. Data Transfer Node (DTN) is an essential component for the high performance and security of the Science DMZ, since only transfer functions of research data are allowed to the DTN without any security- and performance-threatening functions such as commercial internet service. Current Science DMZ requires per-user DTN server installation which turns out a scalability limitation of the networks in terms of management overhead, entry barrier of the user, and networks-wise CAPEX. In order to relax the aforementioned scalability issues, this paper suggests a centralized DTN design where end users in a group can share the centralized DTN. We evaluate the effectiveness of the suggested sharable DTN design by comparing CAPEX against to that of current design with respect to the diverse network load and the state-of-the-art computing machine.