• Title/Summary/Keyword: synchronization mechanism

Search Result 166, Processing Time 0.03 seconds

Performance Evaluation and Optimization of Dual-Port SDRAM Architecture for Mobile Embedded Systems (모바일 내장형 시스템을 위한 듀얼-포트SDRAM의 성능 평가 및 최적화)

  • Yang, Hoe-Seok;Kim, Sung-Chan;Park, Hae-Woo;Kim, Jin-Woo;Ha, Soon-Hoi
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.542-546
    • /
    • 2008
  • Recently dual-port SDRAM (DPSDRAM) architecture tailored for dual-processor based mobile embedded systems has been announced where a single memory chip plays the role of the local memories and the shared memory for both processors. In order to maintain memory consistency from simultaneous accesses of both ports, every access to the shared memory should be protected by a synchronization mechanism, which can result in substantial access latency. We propose two optimization techniques by exploiting the communication patterns of target applications: lock-priority scheme and static-copy scheme. Further, by dividing the shared bank into multiple blocks, we allow simultaneous accesses to different blocks thus achieve considerable performance gain. Experiments on a virtual prototyping system show a promising result - we could achieve about 20-50% performance gain compared to the base DPSDRAM architecture.

One-Pass Identification Processing Password (한 단계로 신원확인을 위한 패스워드)

  • Kim Yong-Hun;Cho Beom-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.3
    • /
    • pp.627-632
    • /
    • 2005
  • Almost all network systems provide an authentication mechanism based on user ID and password. In such system, it is easy to obtain the user password using a sniffer program with illegal eavesdropping. The one-time password and challenge-response method are useful authentication schemes that protect the user passwords against eavesdropping. In client/ server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. It is the stability that is based on Square Root problem, and we would like to suggest OPI(One Pass Identification), enhancing the stability for all of the well-known attacks by now including Free-playing attack, off-line Literal attack, Server and so on. OPI does not need to create the special key to read the password. OPI is very excellent in identifying the approved person within a very short time.

Design and Implementation of Networked Virtual Reality Applications and An Efficient Synchronization Mechanism Dynamically Adapting to the Network State (네트워크 가상현실 응용의 설계 및 구현과 가변적인 네트웍 상태를 고려하는 동기화 기법)

  • Choi, Sung;You, Jun-Ho
    • Proceedings of the KAIS Fall Conference
    • /
    • 2006.05a
    • /
    • pp.517-521
    • /
    • 2006
  • 네트워크 가상현실 시스템은 먼 거리에 떨어진 사용자들 사이에 일관성 있는 가상 세계를 제공하며, 군사, 오락, 건축 등 여러 부분에 응용되고 있다. 본 논문에서는 그 동안 고성능 그래픽 워크스테이션 환경에서 중심적으로 연구되어 왔던 네트워크 가상현실 시스템을 가장 보편적인 플랫폼인 네트워크 환경에서 구현할 때 생기는 3차원 그래픽 처리 성능의 문제 등과 같은 이에 대한 해결책들을 제시하고 미로 환경과 지형 환경에 근거한 가상 세계를 응용 실험 대상으로 삼아 성능을 분석하였다. 실시간으로 상호 작용하는 어플리케이션은 성능을 유지하면서 모든 참가자들에게 동일한 뷰를 보여주는 것이 중요하다. 동일한 뷰를 제공하기 위해 참가자들이 전송하는 이벤트마다 재생 지연 시간을 설정하고, 수신한 이벤트에 대해서는 예정 재생 시각까지 버퍼에 저장하여 모든 참가자들이 동시에 이벤트를 실행하도록 하는 기법이 제안되어 왔다. 그러나 네트워크 트래픽이 동적으로 변하므로 네트워크 상에서 발생하는 전송 지연 시간도 동적으로 변화한다. 그러므로 고정된 재생 지연 시간을 사용할 경우, 네트워크 트래픽 감소에 따라 상호 작용 성능을 향상시킬 수 있는 기회를 상실하게 되고, 네트워크 트래픽 증가에 따라 이벤트 손실률이 크게 증가하게 되어 참가자들 간에 일치하지 않는 뷰를 초래하게 된다. 네트워크 트래픽이 적어서 전송 지연 시간이 짧을 경우 짧은 재생 지연 시간을 적용하여 상호작용 성능을 높여주고, 트래픽이 많은 경우에는 재생 지연 시간을 늘림으로써 상호 작용 성능을 해치지 않는 범위에서 이벤트 손실률을 줄인다. 실험을 통하여 제안하는 기법의 성능을 평가하였으며 그 결과 본 동기화 기법이 고부하(heavily loaded) 네트워크 상태가 지속되는 동안 기존 기법에 비해 참가자들에게 일치된 뷰를 제공할 수 있고, 저부하(lightly loaded) 네트워크 상태에서는 상호 작용 성능을 향상시킬 수 있다는 것을 확인하였다.

  • PDF

A Mobile P2P Semantic Information Retrieval System with Effective Updates

  • Liu, Chuan-Ming;Chen, Cheng-Hsien;Chen, Yen-Lin;Wang, Jeng-Haur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1807-1824
    • /
    • 2015
  • As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

A Method to Manage Local Storage Capacity Using Data Locality Mechanism (데이터 지역성 메커니즘을 이용한 지역 스토리지 용량 관리 방법)

  • Kim, Baul;Ku, Mino;Min, Dugki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.324-327
    • /
    • 2013
  • Recently, due to evolving cloud computing technology, we can easily and transparently utilize both local computing resource and remote computing resource in real life. Especially, enhancing smart device technologies and network infrastructures promote an increase of needs to share files between local smart devices and cloud storages. However, since smart devices have a limited storage space, storing files on cloud storage causes a starvation problem of local storage. It means that users can face a storage-lack problem even a cloud storage service provide a huge file storing space. In this research, we propose a method to manage files between smart devices and cloud storages. Our approach calculate file usage pattern based on recently used date, and then this approach determines local files being migrated. As a result, our approach is sufficient for handling data synchronization between big data storage farm and local thin client which contains limited storage space.

  • PDF

Joint Space Trajectory Planning on RTOS (실시간 운영체제에서 관절 공간 궤적 생성)

  • Yang, Gil-Jin;Choi, Byoung-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.1
    • /
    • pp.52-57
    • /
    • 2014
  • This paper presents an implementation of a smooth path planning method considering physical limits on a real time operating system for a two-wheel mobile robot. A Bezier curve is utilized to make a smooth path considering a robot's position and direction angle through the defined path. A convolution operator is used to generate the center velocity trajectory to travel the distance of the planned path while satisfying the physical limits. The joint space velocity is computed to drive the two-wheel mobile robot from the center velocity. Trajectory planning, velocity command according to the planned trajectory, and monitoring of encoder data are implemented with a multi-tasking system. And the synchronization of tasks is performed with a real-time mechanism of Event Flag. A real time system with multi-tasks is implemented and the result is compared with a non-real-time system in terms of path tracking to the designed path. The result shows the usefulness of a real-time multi-tasking system to the control system which requires real-time features.

Data Consistency-Control Scheme Using a Rollback-Recovery Mechanism for Storage Class Memory (스토리지 클래스 메모리를 위한 롤백-복구 방식의 데이터 일관성 유지 기법)

  • Lee, Hyun Ku;Kim, Junghoon;Kang, Dong Hyun;Eom, Young Ik
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.7-14
    • /
    • 2015
  • Storage Class Memory(SCM) has been considered as a next-generation storage device because it has positive advantages to be used both as a memory and storage. However, there are significant problems of data consistency in recently proposed file systems for SCM such as insufficient data consistency or excessive data consistency-control overhead. This paper proposes a novel data consistency-control scheme, which changes the write mode for log data depending on the modified data ratio in a block, using a rollback-recovery scheme instead of the Write Ahead Logging (WAL) scheme. The proposed scheme reduces the log data size and the synchronization cost for data consistency. In order to evaluate the proposed scheme, we implemented our scheme on a Linux 3.10.2-based system and measured its performance. The experimental results show that our scheme enhances the write throughput by 9 times on average when compared to the legacy data consistency control scheme.

The Implementation of Real Time Communication Simulation using TMO in Distributed Network systems (분산네트워크시스템에서 TMO를 이용한 실시간 통신 시뮬레이션 구현)

  • Kim, Gwang-Jun;Seo, Jong-Joo;Kang, Ki-Woong;Yoon, Chan-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.5
    • /
    • pp.897-905
    • /
    • 2007
  • In this paper, we present a new framework and synchronization mechanism to effectively support developing real-time communication service by using a real-time object model named TMO (Time-Triggered Message-Triggered Object). Also, we describes the application environment as the DHS(distributed high-precision simulation) to guarantee real-time service message with TMO structure in distributed network systems. The TMO scheme is aimed for enabling a great reduction of the designer's effort in guaranteeing timely real-time communication service capabilities of among distributed multi-nodes systems. Our real-time framework provide the consistent construction and configuration of tine-triggered processing components across heterogeneous distributed object environment more easily. It has been formulated from the beginning with the objective of enabling design-time guaranteeing of timely action. In the real time simulation techniques based on TMO object modeling, we have observed several advantages to the TMO structuring scheme. TMO object modeling has a strong traceability between requirement specification and design.

Surface-shape Processing Characteristics and Conditions during Trajectory-driven Fine-particle injection Processing (궤적 구동 미세입자 분사가공 시 표면 형상 가공 특성 및 가공 조건)

  • Lee, Hyoung-Tae;Hwang, Chul-Woong;Lee, Sea-Han;Wang, Duck Hyun
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.20 no.10
    • /
    • pp.19-26
    • /
    • 2021
  • In fine-particle injection processing, hard fine particles, such as silicon carbide or aluminum oxide, are injected - using high-pressure air, and a small amount of material is removed by applying an impact to the workpiece by spraying at high speeds. In this study, a two-axis stage device capable of sequence control was developed to spray various shapes, such as circles and squares, on the surface during the micro-particle jetting process to understand the surface-shape micro-particle-processing characteristics. In the experimental device, two stepper motors were used for the linear movement of the two degree-of-freedom mechanism. The signal output from the microcontroller is - converted into a signal with a current sufficient to drive the stepper motor. The stepper motor rotates precisely in synchronization with the pulse-signal input from the outside, eliminating the need for a separate rotation-angle sensor. The major factors of the processing conditions are fine particles (silicon carbide, aluminum oxide), injection pressure, nozzle diameter, feed rate, and number of injection cycles. They were identified using the ANOVA technique on the design of the experimental method. Based on this, the surface roughness of the spraying surface, surface depth of the spraying surface, and radius of the corner of the spraying surface were measured, and depending on the characteristics, the required spraying conditions were studied.

Network Slice Selection Function on M-CORD (M-CORD 기반의 네트워크 슬라이스 선택 기능)

  • Rivera, Javier Diaz;Khan, Talha Ahmed;Asif, Mehmood;Song, Wang-Cheol
    • KNOM Review
    • /
    • v.21 no.2
    • /
    • pp.35-45
    • /
    • 2018
  • As Network Slicing functionality gets applied to mobile networking, a mechanism that enables the selection of network slices becomes indispensable. Following the 3GPP Technical Specification for the 5G Architecture, the inclusion of the Network Slice Selection Function (NSSF) in order to leverage the process of slice selection is apparent. However, actual implementation of this network function needs to deal with the dynamic changes of network instances, due to this, a platform that supports the orchestration of Virtual Network Functions (VNF) is required. Our proposed solution include the use of the Central Office Rearchitected as a Data Center (CORD) platform, with the specified profile for mobile networks (M-CORD) that integrates a service orchestrator (XOS) alongside solutions oriented to Software Defined Networking (SDN), Network Function Virtualization (VNF) and virtual machine management through OpenStack, in order to provide the right ecosystem where our implementation of NSSF can obtain slice information dynamically by relying on synchronization between back-end services and network function instances.