• 제목/요약/키워드: Zero-latency

검색결과 14건 처리시간 0.023초

다중처리 시스템의 병렬성 증대를 위한 사이클의 비 지연 발견 기법 (A Zero-latency Cycle Detection Scheme for Enhanced Parallelism in Multiprocessing Systems)

  • 김주균
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제32권2호
    • /
    • pp.49-54
    • /
    • 2005
  • 본 논문에서는 즉시 할당 상태와 함께 단일 자원, 단일 요청의 가정 하에서 다중처리 시스템에서 사이클을 발생 즉시 발견함으로써 지연 없는 교차상태의 발견 방법을 소개한다. 기존의 방법과는 달리 제시된 방법은 n과 m으로 프로세스와 자원의 수론 나타낼 때 사이클의 발견에 O(1), 대기나 자원의 반납시에 O(n.m)의 시간을 요한다. 따라서 n과 m의 크기에 상관없이 교착상태를 발생 즉시 알 수 있으며, 이점이 다중처리 시스템의 특성과 잘 조화될 수 있음을 보였다. 교착상태와 연관된 응용환경에서 이러한 발견의 예측성과 비 지연성은 매우 유용할 것이다.

블록체인 기반 클라우드 프락시 서버의 키 효율성 연구 (Key Efficiency Evaluation of Blockchain Based Cloud Proxy Server)

  • 성순화
    • 정보보호학회논문지
    • /
    • 제34권2호
    • /
    • pp.289-299
    • /
    • 2024
  • 블록체인은 증가하는 트랜잭션 수와 사용자 수로 인해 많은 계산과 네트워크 통신을 지연시켜 실시간 처리에 효율적이지 않다. 이를 해결하기 위하여, 본 연구는 클라우드 프락시 서버를 제안하므로 적법한 사용자가 블록체인을 사용할 뿐만 아니라 네트워크 지연 시간을 단축할 수 있다. 블록체인 트랜잭션 진행을 위해, 블록체인 복사 서버에서는 트랜잭션 관련 모든 데이터를 검증하지만 클라우드 프락시 서버는 간단한 영지식 증명 알고리즘으로 적법한 사용자를 검증하므로 효율적인 블록체인 실시간 처리가 가능하다. 클라우드 프락시 서버는 블록체인 사용자의 키 쌍을 등록 받아 제안한 영지식 증명으로 적법한 사용자를 검증할 수 있는 블록체인 익명성, 보안성, 확장성을 지원할 수 있다. 제안 연구 분석에서 블록체인 기반 클라우드 프락시 서버는 이전 연구들과 비교하여 네트워크 지연 시간을 단축시키고, 클라우드 프락시 서버의 키 프로세싱은 이전 연구들보다 키 계산 비용을 감소시킨다.

소프트웨어 정의 경계를 이용한 네트워크 트래픽 기반 동적 접근 제어 (Network Traffic-Based Access Control Using Software-Defined Perimeter)

  • 김서이;이일구
    • 정보보호학회논문지
    • /
    • 제34권4호
    • /
    • pp.735-746
    • /
    • 2024
  • 컴퓨터 기술의 급속한 발전은 더 안전한 사용자 환경이 필요하게 되어, 모든 내부 및 외부 네트워크 활동을 검증하는 제로 트러스트 모델의 도입을 촉진했다. 본 논문은 제로 트러스트의 구현 및 지연 문제를 해결하기 위해 소프트웨어 정의 경계 기능을 활용한 효율적인 네트워크 트래픽 데이터 기반 동적 접근 제어 방법을 제안한다. 성능 평가 결과에 따르면 제안한 방법의 탐지 성능은 기존 방식과 유사하게 나타났지만 데이터 셋의 크기는 약 70% 감소했다. 그리고 적응형 제로 트러스트 검증 방식을 제안하여 데이터 셋 크기와 검증 시간을 각각 약 83%, 10% 줄이면서 종래의 방식과 유사한 탐지 성능을 유지했다.

Zero-Knowledge Realization of Software-Defined Gateway in Fog Computing

  • Lin, Te-Yuan;Fuh, Chiou-Shann
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권12호
    • /
    • pp.5654-5668
    • /
    • 2018
  • Driven by security and real-time demands of Internet of Things (IoT), the timing of fog computing and edge computing have gradually come into place. Gateways bear more nearby computing, storage, analysis and as an intelligent broker of the whole computing lifecycle in between local devices and the remote cloud. In fog computing, the edge broker requires X-aware capabilities that combines software programmability, stream processing, hardware optimization and various connectivity to deal with such as security, data abstraction, network latency, service classification and workload allocation strategy. The prosperous of Field Programmable Gate Array (FPGA) pushes the possibility of gateway capabilities further landed. In this paper, we propose a software-defined gateway (SDG) scheme for fog computing paradigm termed as Fog Computing Zero-Knowledge Gateway that strengthens data protection and resilience merits designed for industrial internet of things or highly privacy concerned hybrid cloud scenarios. It is a proxy for fog nodes and able to integrate with existing commodity gateways. The contribution is that it converts Privacy-Enhancing Technologies rules into provable statements without knowing original sensitive data and guarantees privacy rules applied to the sensitive data before being propagated while preventing potential leakage threats. Some logical functions can be offloaded to any programmable micro-controller embedded to achieve higher computing efficiency.

모바일 3D 그래픽 프로세서의 지오메트리 연산을 위한 부동 소수점 연산기 구현 (A design of Floating Point Arithmetic Unit for Geometry Operation of Mobile 3D Graphic Processor)

  • 이지명;이찬호
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2005년도 추계종합학술대회
    • /
    • pp.711-714
    • /
    • 2005
  • We propose floating point arithmetic units for geometry operation of mobile 3D graphic processor. The proposed arithmetic units conform to the single precision format of IEEE standard 754-1985 that is a standard of floating point arithmetic. The rounding algorithm applies the nearest toward zero form. The proposed adder/subtraction unit and multiplier have one clock cycle latency, and the inversion unit has three clock cycle latency. We estimate the required numbers of arithmetic operation for Viewing transformation. The first stage of geometry operation is composed with translation, rotation and scaling operation. The translation operation requires three addition and the rotation operation needs three addition and six multiplication. The scaling operation requires three multiplication. The viewing transformation is performed in 15 clock cycles. If the adder and the multiplier have their own in/out ports, the viewing transformation can be done in 9 clock cycles. The error margin of proposed arithmetic units is smaller than $10^{-5}$ that is the request in the OpenGL standard. The proposed arithmetic units carry out operations in 100MHz clock frequency.

  • PDF

A Novel Optical High-Availability Seamless Redundancy (OHSR) Design Based on Beam Splitting / Combining Techniques

  • Altaha, Ibraheem Raed;Kim, Sung Chul;Rhee, Jong Myung
    • Journal of the Optical Society of Korea
    • /
    • 제20권6호
    • /
    • pp.678-685
    • /
    • 2016
  • The standard high-availability seamless redundancy (HSR) protocol utilizes duplicated frame copies of each sent frame for zero fail over time. This means that even in cases of a node or link failure, the destination node will receive at least one copy of the sent frame, resulting in no network downtime. However, the standard HSR is mostly based on the electrical signal connection inside the node, which leads to the production of considerable latency at each node due to frame processing. Therefore, in a large scale HSR ring network, the accumulated latencies become significant and can often restrict the mission-critical real-time application of HSR. In this paper, we present a novel design for optical HSR (OHSR) that uses beam splitting/combining techniques. The proposed OHSR passes the frames directly to adjacent nodes without frame processing at each node, thereby theoretically generating no latency in any node. Various simulations for network samples, made to validate the OHSR design and its performance, show that the OHSR outperforms the standard HSR.

클라우드 모바일 웹 브라우저 상에서 제로 레이턴시 응답을 위한 웹페이지 프리로딩 기술의 개발 (The Development of Webpage Pre-loading Technology for Zero Latency Response on Cloud Mobile Web Browser)

  • 권오철;오치영;이창건
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
    • /
    • pp.126-128
    • /
    • 2012
  • 클라우드 모바일 웹 브라우저는 고성능의 클라우드 서버가 웹페이지를 재가공하고 압축하여 제공함으로써, 모바일 기기의 작업 부하를 줄이고 웹페이지의 로딩 시간을 단축한다. 클라우드 모바일 웹 브라우저의 오프로딩 기술은 네트워크 환경에 따라 웹페이지의 로딩 시간이 크게 좌우되기 때문에 보다 빠르고 효율적으로 웹 브라우징을 제공하기 위해서 프리로딩 기술이 제안되었다. 프리로딩 기술은 엄격한 사용자 분석을 통해 사용자가 요청할 것으로 예상되는 웹페이지를 미리 캐싱해두고, 사용자에게 제로 레이턴시로 웹 브라우징을 제공한다.

Integer-Pel Motion Estimation for HEVC on Compute Unified Device Architecture (CUDA)

  • Lee, Dongkyu;Sim, Donggyu;Oh, Seoung-Jun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제3권6호
    • /
    • pp.397-403
    • /
    • 2014
  • A new video compression standard called High Efficiency Video Coding (HEVC) has recently been released onto the market. HEVC provides higher coding performance compared to previous standards, but at the cost of a significant increase in encoding complexity, particularly in motion estimation (ME). At the same time, the computing capabilities of Graphics Processing Units (GPUs) have become more powerful. This paper proposes a parallel integer-pel ME (IME) algorithm for HEVC on GPU using the Compute Unified Device Architecture (CUDA). In the proposed IME, concurrent parallel reduction (CPR) is introduced. CPR performs several parallel reduction (PR) operations concurrently to solve two problems in conventional PR; low thread utilization and high thread synchronization latency. The proposed encoder reduces the portion of IME in the encoder to almost zero with a 2.3% increase in bitrate. In terms of IME, the proposed IME is up to 172.6 times faster than the IME in the HEVC reference model.

미스 반 데어 로에 건축공간의 잠복성 (Latency in the Architectural Space of Mies van der Rohe)

  • 정만영;최은국
    • 건축역사연구
    • /
    • 제15권3호
    • /
    • pp.119-135
    • /
    • 2006
  • This study based on the hypothesis which the spatial qualities in the Mies's early works are not extinct but potentially immanent in his latter works. In Mies's early works, destruction of outline, centrifugal extension of fluid space, and asymmetry are distinctly showed. These qualities probably revert to the indefiniteness of space. In Mies's latter works, however, these dynamic qualities are disappeared. Geometrically precise outline and exact grid structure represent universal space derived from zero-degree pure box. These qualities probably revert to tile definiteness of space, characterized by the unmovable emptiness. Although Mies works vary in external form, his expression technique of space reveals continually both the qualify of definitive and indefinitive space. For example, in the Museum for a Small City(1942) unbuilt project. elements defined by the perspective are fixed and static, but elements defined by the collages are floated and dynamic. The former reigns over the realized buildings of Mies, while the latter seems to be latent in terms of Schein which transcends reality. If we can penetrate this point, it's possible to read the other side of Mies' architectural works, distinct from both the canonized interpretation and the excessive criticism. Point is that later works of Mies must be understood as interplay of universal space appeared as phenomenon and flowing elements latent in. Architectural space of Mies keeps a distance with actual space through latent manner of being while preserves the empirical actuality It provides us with an occasion which appears only in an instant, in which even the ordinary things reveal its poetics.

  • PDF

A Novel Scheme for Seamless Hand-off in WMNs

  • Vo, Hung Quoc;Kim, Dae-Sun;Hong, Choong-Seon;Lee, Sung-Won;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권4호
    • /
    • pp.399-422
    • /
    • 2009
  • Although current wireless mesh network (WMN) applications experience a perceptually uninterrupted hand-off, their throughput after the hand-off event may be significantly degraded due to the low available bandwidth of the mobile client's new master. In this paper, we propose a novel mobility management scheme for 802.11-based WMNs that enables both seamless hand-off for transparent communications, and bandwidth awareness for stable application performance after the hand-off process. To facilitate this, we (i) present a new buffer moment in support of the fast Layer-2 hand-off mechanism to cut the packet loss incurred in the hand-off process to zero and (ii) design a dynamic admission control to grant joining accepts to mesh clients. We evaluate the benefits and drawbacks of the proposal for both UDP and TCP traffic, as well as the fairness of the proposal. Our results show that the new scheme can not only minimize hand-off latency, but also maintain the current application rates of roaming users by choosing an appropriate new master for joining.