• Title/Summary/Keyword: 동기적 분산 시스템

Search Result 193, Processing Time 0.021 seconds

An Implementation of Federated Learning based on Blockchain (블록체인 기반의 연합학습 구현)

  • Park, June Beom;Park, Jong Sou
    • The Journal of Bigdata
    • /
    • v.5 no.1
    • /
    • pp.89-96
    • /
    • 2020
  • Deep learning using an artificial neural network has been recently researched and developed in various fields such as image recognition, big data and data analysis. However, federated learning has emerged to solve issues of data privacy invasion and problems that increase the cost and time required to learn. Federated learning presented learning techniques that would bring the benefits of distributed processing system while solving the problems of existing deep learning, but there were still problems with server-client system and motivations for providing learning data. So, we replaced the role of the server with a blockchain system in federated learning, and conducted research to solve the privacy and security problems that are associated with federated learning. In addition, we have implemented a blockchain-based system that motivates users by paying compensation for data provided by users, and requires less maintenance costs while maintaining the same accuracy as existing learning. In this paper, we present the experimental results to show the validity of the blockchain-based system, and compare the results of the existing federated learning with the blockchain-based federated learning. In addition, as a future study, we ended the thesis by presenting solutions to security problems and applicable business fields.

Distributed Hashing-based Fast Discovery Scheme for a Publish/Subscribe System with Densely Distributed Participants (참가자가 밀집된 환경에서의 게재/구독을 위한 분산 해쉬 기반의 고속 서비스 탐색 기법)

  • Ahn, Si-Nae;Kang, Kyungran;Cho, Young-Jong;Kim, Nowon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.12
    • /
    • pp.1134-1149
    • /
    • 2013
  • Pub/sub system enables data users to access any necessary data without knowledge of the data producer and synchronization with the data producer. It is widely used as the middleware technology for the data-centric services. DDS (Data Distribution Service) is a standard middleware supported by the OMG (Object Management Group), one of global standardization organizations. It is considered quite useful as a standard middleware for US military services. However, it is well-known that it takes considerably long time in searching the Participants and Endpoints in the system, especially when the system is booting up. In this paper, we propose a discovery scheme to reduce the latency when the participants and Endpoints are densely distributed in a small area. We propose to modify the standard DDS discovery process in three folds. First, we integrate the Endpoint discovery process with the Participant discovery process. Second, we reduce the number of connections per participant during the discovery process by adopting the concept of successors in Distributed Hashing scheme. Third, instead of UDP, the participants are connected through TCP to exploit the reliable delivery feature of TCP. We evaluated the performance of our scheme by comparing with the standard DDS discovery process. The evaluation results show that our scheme achieves quite lower discovery latency in case that the Participants and the Endpoints are densely distributed in a local network.

Architecture and Performance Analysis of An Event Notification Service (이벤트 알림 서비스의 구조와 성능분석)

  • Han Young-Tae;Min Dug-Ki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.3 s.35
    • /
    • pp.201-208
    • /
    • 2005
  • Event notification service is a event-based messaging middleware service needed for various vertical domains, such as, business applications, distributed system management, and web service integration. In this paper, we investigate the architecture of an event notification service that includes a subject-based event dissemination service and a flexible message communication service. The event dissemination service is in charge of transferring events asynchronously but speedy according to the subjects of events and their environmental knowledge. It also includes content-based message filtering. The message communication service provides a common communication infrastructure supporting variety types of messages and variety of protocols. Depending on application domains and situation, we can re-configurate the communication infrastructure in order to optimize the efficiency and usability. This paper shows the performance analysis of our event notification service with various types of message formats and protocols.

  • PDF

Extending a WebDAV Protocol to Efficiently Support the Management of User Properties (사용자 속성 관리의 효율적 지원을 위한 WebDAV 프로토콜의 확장)

  • Jung Hye-Young;Kim Dong-Ho;Ahn Geon-Tae;Lee Myung-Joon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.7 s.103
    • /
    • pp.1057-1066
    • /
    • 2005
  • WebDAV(Web-based Distributed Authoring and Versioning), a protocol which supports web-based distributed authoring and versioning, provides a standard infrastructure for asynchronous collaboration on various contents through the Internet. A WebDAV property management is a function to set and manage the main information of the resources as properties, and a user property, one kind of the WebDAV properties, has the ability to be freely defined by users. This free definition of user property makes it very useful to develop web-based applications like a collaboration system based on WebDAV However, with an existing WebDAV property management scheme, there is a limit to develop various applications. This paper describes a DavUP(WebDAV User property design Protocol) protocol which extended the original WebDAV and its uti-lization which efficiently supports management of WebDAV user properties. DavUP needs the definition of the collection structure and type definition properties for an application. To do this, we added a new header md appropriated WebDAV method functions to the WebDAV protocol. To show the usefulness of DavUP protocols, we extended our DAVinci WebDAV server to support DavUP Protocols and experimentally implemented a general Open Workspace, which provides effective functions to share and exchange open data among general users, on the DAVinci.

A Technique to Specify and Generate .NET Components in MDA/PSM for Pervasive Service (MDA/PSM상에서 퍼베이시브 서비스를 지원하는 닷넷 컴포넌트의 명세 및 생성 기법)

  • Kum, Deuk-Kyu;Kim, Soo-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.7
    • /
    • pp.635-645
    • /
    • 2007
  • Component technology has been widely accepted as an effective way for building software systems with reusable components, and Microsoft (MS) .NET is one of the recent representative component technologies. Model Driven Architecture (MDA) is a new development paradigm which generates software by transforming design models automatically and incrementally. Transformation of structural models in MDA has been successfully applied. However, transformation of dynamic models and pervasive services, such as transaction service, security service, synchronization service and object pooling are largely remains as an area for further research. The recent enterprise system has multi tier distributed architecture, and the functionality of early mentioned pervasive services is essential for this architecture. .NET platform can implement Component Object Model+ (COM+) component for supporting pervasive services by specify Attribute code. In this paper, we specify the functionalities of the COM+ component offering pervasive services, and then those functionalities are defined by UML profile. By using the profile, the Platform Specific Model (PSM) for .NET/C# is specified, and .NET components are automatically generated through our tool. The development productivity, extensibility, portability, and maintenance of software can be dramatically improved by using of the proposed methods.

Fault Tolerance for IEEE 1588 Based on Network Bonding (네트워크 본딩 기술을 기반한 IEEE 1588의 고장 허용 기술 연구)

  • Altaha, Mustafa;Rhee, Jong Myung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.331-339
    • /
    • 2018
  • The IEEE 1588, commonly known as a precision time protocol (PTP), is a standard for precise clock synchronization that maintains networked measurements and control systems. The best master clock (BMC) algorithm is currently used to establish the master-slave hierarchy for PTP. The BMC allows a slave clock to automatically take over the duties of the master when the slave is disconnected due to a link failure and loses its synchronization; the slave clock depends on a timer to compensate for the failure of the master. However, the BMC algorithm does not provide a fast recovery mechanism in the case of a master failure. In this paper, we propose a technique that combines the IEEE 1588 with network bonding to provide a faster recovery mechanism in the case of a master failure. This technique is implemented by utilizing a pre-existing library PTP daemon (Ptpd) in Linux system, with a specific profile of the IEEE 1588 and it's controlled through bonding modes. Network bonding is a process of combining or joining two or more network interfaces together into a single interface. Network bonding offers performance improvements and redundancy. If one link fails, the other link will work immediately. It can be used in situations where fault tolerance, redundancy, or load balancing networks are needed. The results show combining IEEE 1588 with network bonding enables an incredible shorter recovery time than simply just relying on the IEEE 1588 recovery method alone.

Implementation of A Networked Collaboration Engine for Virtual Architectural Bngineering Application (가상 건축 엔지니어링 응용을 위한 네트워크 공유작업 엔진의 구현)

  • Song, Gyeong-Jun;Go, Dong-Il;Kim, Jong-Seong;Maeng, Seong-Hyeon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.12
    • /
    • pp.642-652
    • /
    • 2001
  • Recently, the advent of World-Wide-Web(WWW) and the explosive popularity of the Internet gave birth to collaborative applications which were enabled by computers and networks as their primary media. The progress of 3D computer graphics enabled collaborative application with 3D virtual environments or distributed virtual environments. In this paper, we explain our implementation of the Share collaboration engine which is for collaboration applications based on a distributed virtual environment. We introduce Virtual Architectural Engineering 2000 (VAE2000) that is our pilot application implemented with the Share collaboration engine. The Share collaboration engine proposes a new Share network architecture for management of participants, and it provides some synchronization methods for 3D objects in virtual collaboration. VAE2000 is an experimental application that tries to prevent wastes of human, material and time resources in networked virtual collaboration.

  • PDF

Design and Implementation of Multiple View Image Synthesis Scheme based on RAM Disk for Real-Time 3D Browsing System (실시간 3D 브라우징 시스템을 위한 램 디스크 기반의 다시점 영상 합성 기법의 설계 및 구현)

  • Sim, Chun-Bo;Lim, Eun-Cheon
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.5
    • /
    • pp.13-23
    • /
    • 2009
  • One of the main purpose of multiple-view image processing technology is support realistic 3D image to device user by using multiple viewpoint display devices and compressed data restoration devices. This paper proposes a multiple view image synthesis scheme based on RAM disk which makes possible to browse 3D images generated by applying effective composing method to real time input stereo images. The proposed scheme first converts input images to binary image. We applies edge detection algorithm such as Sobel algorithm and Prewiit algorithm to find edges used to evaluate disparities from images of 4 multi-cameras. In addition, we make use of time interval between hardware trigger and software trigger to solve the synchronization problem which has stated ambiguously in related studies. We use a unique identifier on each snapshot of images for distributed environment. With respect of performance results, the proposed scheme takes 0.67 sec in each binary array. to transfer entire images which contains left and right side with disparity information for high quality 3D image browsing. We conclude that the proposed scheme is suitable for real time 3D applications.

Minute Signal Detection Algorithm for Air-pollution Measurement System with The NDIR Detector (NDIR 검출기를 이용하는 대기오염 측정시스템을 위한 미세신호 검출 알고리즘)

  • Choi, Hun;Kim, Hyon-Ho;Whang, Byoung-Han;Lim, Yong-Seok;Ryu, Geun-Taek;Bae, Hyeon-Deok
    • 전자공학회논문지 IE
    • /
    • v.45 no.3
    • /
    • pp.27-35
    • /
    • 2008
  • In this paper, we propose a minute signal detection algorithm for a development of optical analyzer, using the non-dispersive infrared method with multi gas filter correlation wheel, that can measure various environmental air-pollution materials (CO, SO2, NOx, etc.) in real-time. The MCT(mercury cadmium telluride) sensor can detect minute signals those show and absorption characteristic of each environmental pollution materials. In the proposed method, a corresponding data of each environmental pollution materials can be separated by an external trigger and threshold values in the measured continuous signals.

The Application and Integration of an Improvement Technique for Layers of NETCONF (NETCONF 계층에 대한 개선 기법 적용 및 통합)

  • Lee, YangMin;Lee, JaeKee
    • Journal of KIISE
    • /
    • v.43 no.2
    • /
    • pp.256-268
    • /
    • 2016
  • Modern networks consisting of various heterogeneous equipment are often installed in a distributed manner. Thus the NETCONF standard was established to manage networks centrally and efficiently. In this paper, we present a method that integrates each NETCONF layer into a single system based on the results of previous studies. In the RPC Layer, an asynchronous communication channel and parallel processes are possible using multi-threading. In the Operation Layer, operational efficiency is increased by using a data group with dependencies between the equipment configuration data and by improving the data structure, enabling efficiently processing of XML queries even with multiple managers. The data modeling techniques and grouping methods in the Content Layer are presented in detail for interoperability between the Operation Layer and the Content Layer. Finally, the GUI program was implemented and its implementation is reported. We performed an experiment comparing the improved NETCONF with the standard NETCONF to measure factors, such as query processing ratio, query processing speed, and CPU utilization. The improved NETCONF demonstrated excellent query processing ratio and query processing speed, whereas the standard NETCONF had excellent CPU utilization.