• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.49-54
• /
• 2005

This Paper Presents a non-blocking deadlock detection scheme with immediate cycle detection in multiprocessing systems. We assume an expedient state and a special case where each type of resource has one unit and each request is limited to one resource unit at a time. Unlike the previous deadlock detection schemes, this new method takes O(1) time for detecting a cycle and O(n+m) time for blocking or handling resource release where n and m are the number of processes and that of resources in the system. The deadlock detection latency is thus minimized and is constant regardless of n and m. However, in a multiprocessing system, the operating system can handle the blocking or release on-the-fly running on a separate processor, thus not interfering with user process execution. To some applications where deadlock is concerned, a predictable and zero-latency deadlock detection scheme could be very useful.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.2
• /
• pp.289-299
• /
• 2024

Blockchains are not efficient for real-time processing because the growing number of transactions and users delays many computations and network communications. This study proposes a cloud proxy server, so that legitimate users can use blockchain as well as reduce network latency. To proceed with a blockchain transaction, the blockchain copy server verifies all transaction-related data, but the cloud proxy server verifies legitimate users with a simple zero-knowledge proof algorithm, enabling efficient blockchain real-time processing. The cloud proxy server can support blockchain anonymity, security, and scalability that can verify legitimate users with the proposed zero-knowledge proof by receiving the registered key pair of the blockchain user. In the proposed research analysis, blockchain-based cloud proxy server reduces network latency compared to previous studies and key processing on cloud proxy servers reduces the cost of key computation compared to previous studies.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.4
• /
• pp.735-746
• /
• 2024

The rapid advancement of computer technology has necessitated a safer user environment, prompting the adoption of the zero trust model, which verifies all internal and external network activities. This paper proposes an efficient network traffic data-based dynamic access control method leveraging Software-Defined Perimeter (SDP) capabilities to implement zero trust and address latency issues. According to the performance evaluation results, the detection performance of the proposed scheme is similar to that of conventional schemes, but the dataset size was reduced by 62.47%. Additionally, by proposing an adaptive zero trust verification approach, the dataset size and verification time were reduced by 83.9% and 9.1%, respectively, while maintaining similar detection performance to conventional methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• 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.

• Journal of the Optical Society of Korea
• /
• v.20 no.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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.126-128
• /
• 2012

클라우드 모바일 웹 브라우저는 고성능의 클라우드 서버가 웹페이지를 재가공하고 압축하여 제공함으로써, 모바일 기기의 작업 부하를 줄이고 웹페이지의 로딩 시간을 단축한다. 클라우드 모바일 웹 브라우저의 오프로딩 기술은 네트워크 환경에 따라 웹페이지의 로딩 시간이 크게 좌우되기 때문에 보다 빠르고 효율적으로 웹 브라우징을 제공하기 위해서 프리로딩 기술이 제안되었다. 프리로딩 기술은 엄격한 사용자 분석을 통해 사용자가 요청할 것으로 예상되는 웹페이지를 미리 캐싱해두고, 사용자에게 제로 레이턴시로 웹 브라우징을 제공한다.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.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.

• Journal of architectural history
• /
• v.15 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.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.