• Title/Summary/Keyword: distributed applications

Search Result 1,258, Processing Time 0.03 seconds

A Distributed Low-cost Dynamic Multicast Routing Algorithm with Delay Constraints (지연시간을 고려한 최소비용의 동적 멀티캐스트 라우팅 알고리즘)

  • Sin, Min-U;Im, Hyeong-Seok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.4
    • /
    • pp.180-187
    • /
    • 2002
  • Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

MicroPost: The Design of an Efficient Event Notification Architecture for Distributed Social Applications (MicroPost: 분산형 소셜 애플리케이션을 위한 효율적인 이벤트 통지 아키텍처의 설계)

  • Bae, Joon-Hyun;Kim, Sang-Wook
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.232-239
    • /
    • 2009
  • Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

  • PDF

A Study on the Development of an Distributed Tabletop System Game Using EBITA Framework (EBITA 프레임워크를 활용한 분산 테이블탑 시스템용 게임 개발에 관한 연구)

  • Kim, Min-Young;Cho, Yong-Joo
    • Journal of Korea Game Society
    • /
    • v.9 no.3
    • /
    • pp.129-138
    • /
    • 2009
  • In this research, a new tabletop system is developed to provide a high resolution display by using multiple displays and computers connected through networks, based on a master/slave architecture. This distributed tabletop system is built to be scalable by just adding slave computers and monitors without modifying any software. Moreover, a EBITA (Environment for Building Interactive Tangible Applications) framework is developed to support constructing interactive games running on this scalable tabletop platforms. EBITA framework consists of the tangible interface module based on the infrared camera tracking system, and the modules that allow easy development of the graphical programs on a distributed environment. This paper describes the tangible interface based on the camera tracking system and EBITA framework. It also introduces a game built with the EBITA framework.

  • PDF

MAHA-FS : A Distributed File System for High Performance Metadata Processing and Random IO (MAHA-FS : 고성능 메타데이터 처리 및 랜덤 입출력을 위한 분산 파일 시스템)

  • Kim, Young Chang;Kim, Dong Oh;Kim, Hong Yeon;Kim, Young Kyun;Choi, Wan
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.91-96
    • /
    • 2013
  • The application field of supercomputing systems are changing to support into the field for both a large-volume data processing and high-performance computing at the same time such as bio-applications. These applications require high-performance distributed file system for storage management and efficient high-speed processing of large amounts of data that occurs. In this paper, we introduce MAHA-FS for supercomputing systems for processing large amounts of data and high-performance computing, providing excellent metadata operation performance and IO performance. It is shown through performance analysis that MAHA-FS provides excellent performance in terms of the metadata processing and random IO processing.

FedGCD: Federated Learning Algorithm with GNN based Community Detection for Heterogeneous Data

  • Wooseok Shin;Jitae Shin
    • Journal of Internet Computing and Services
    • /
    • v.24 no.6
    • /
    • pp.1-11
    • /
    • 2023
  • Federated learning (FL) is a ground breaking machine learning paradigm that allow smultiple participants to collaboratively train models in a cloud environment, all while maintaining the privacy of their raw data. This approach is in valuable in applications involving sensitive or geographically distributed data. However, one of the challenges in FL is dealing with heterogeneous and non-independent and identically distributed (non-IID) data across participants, which can result in suboptimal model performance compared to traditionalmachine learning methods. To tackle this, we introduce FedGCD, a novel FL algorithm that employs Graph Neural Network (GNN)-based community detection to enhance model convergence in federated settings. In our experiments, FedGCD consistently outperformed existing FL algorithms in various scenarios: for instance, in a non-IID environment, it achieved an accuracy of 0.9113, a precision of 0.8798,and an F1-Score of 0.8972. In a semi-IID setting, it demonstrated the highest accuracy at 0.9315 and an impressive F1-Score of 0.9312. We also introduce a new metric, nonIIDness, to quantitatively measure the degree of data heterogeneity. Our results indicate that FedGCD not only addresses the challenges of data heterogeneity and non-IIDness but also sets new benchmarks for FL algorithms. The community detection approach adopted in FedGCD has broader implications, suggesting that it could be adapted for other distributed machine learning scenarios, thereby improving model performance and convergence across a range of applications.

Combustion Diagnostics Method Using Diode Laser Absorption Spectroscopy (다이오드 레이저를 이용한 연소진단기법)

  • Cha, Hak-Joo;Kim, Min-Soo;Shin, Myung-Chul;Kim, Se-Won;Kim, Hyuck-Joo;Han, Jae-Won
    • 한국연소학회:학술대회논문집
    • /
    • 2003.05a
    • /
    • pp.75-83
    • /
    • 2003
  • Diode laser absorption system is advantageous of their non-invasive nature, fast response time, high sensitivity and real-time measurement capability. Furthermore, recent advances in room-temperature, near-IR and visible diode laser sources for telecommunication, optical data storage applications are enabling combustion diagnostics system based on diode laser absorption spectroscopy. So, combined with fiber-optics and high sensitive detection strategies, compact and portable sensor system are now appearing for a variety of applications. The objective of this research is to take advantage of distributed feed-back diode laser and develope new gas sensing system. It experimentally found out that the wavelength, power characteristics as a function of injection current and temperature. In addition to direct absorption and wavelength modulation spectroscopy have been demonstrated in these experiments and have a bright prospect to this diode laser system.

  • PDF

Multicast Support in DiffServ Using Mobile Agents

  • El Hachimi, Mohamed;Abouaissa, Abdelhafid;Lorenz, Pascal
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.13-21
    • /
    • 2005
  • Many multicast applications, such as video-on-demand and video conferencing, desire quality of service (QoS) support from an underlying network. The differentiated services (DiffServ) approach will bring benefits for theses applications. However, difficulties arise while integrating native IP multicasting with DiffServ, such as multicast group states in the core routers and a heterogeneous QoS requirement within the same multicast group. In addition, a missing per-flow reservation in DiffServ and a dynamic join/leave in the group introduce heavier and uncontrollable traffic in a network. In this paper, we propose a distributed and stateless admission control in the edge routers. We also use a mobile agents-based approach for dynamic resource availability checking. In this approach, mobile agents act in a parallel and distributed fashion and cooperate with each other in order to construct the multicast tree satisfying the QoS requirements.

  • PDF

헬스케어시스템을 위한 역할 기반의 신뢰협상 모델

  • Jo, Hyeon-Suk;Lee, Hyeong
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2007.05a
    • /
    • pp.84-102
    • /
    • 2007
  • Security is crucial for the successful deployment of large distributed systems. Many of these systems provide services to people across different administrative domains. The traditional identity-based access control mechanisms are un scalable and difficult to manage. Unlike the closed systems, open systems provide services to people from different security domains. Healthcare systems need to be highly available in order for the patients to get a timely treatment. The health care information should be available to authorized users both inside the administrative domain and outside the domain, such as pharmacies and insurance companies. In this paper, we first analyzed the necessities and advantages of importing attribute-based trust-management models into open distributed systems. Then we reviewed traditional access-control models and presented the basic elements of the new trust-management model.

  • PDF

Modelling and implementation scheme of a multi directory for multiple applications (다중 응용을 위한 멀티 디렉토리 모델링 및 구현 방안)

  • 김영준;임재홍
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1356-1364
    • /
    • 1997
  • This paper presents a modelling and implementation scheme of a multi directory which provides location and supplementary information of multiple applications in distributed environments. An extrended directory schema and extended DIT(Directory Information Tree) model is proposed for the multi directory. For implementation scheme, an implementation example adapted for the DFR(Document Filing and Retrieval) is shown. In addition, a configuration model for interworking between the DFR and the multi directory, an association mechanisms between two application's operations are also described. In a distributed environment, the interworking between the DFR and a multi directory implemented by using QUIPU 8.0 of ISODE(ISO Development Environment) directory system is tested. Based on the result of this paper, an extended model ofthe directory system is proposed for providing search operation of various application' objects.

  • PDF

High-Performance Korean Morphological Analyzer Using the MapReduce Framework on the GPU

  • Cho, Shi-Won;Lee, Dong-Wook
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.4
    • /
    • pp.573-579
    • /
    • 2011
  • To meet the scalability and performance requirements of data analyses, which often involve voluminous data, efficient parallel or concurrent algorithms and frameworks are essential. We present a high-performance Korean morphological analyzer which employs the MapReduce framework on the graphics processing unit (GPU). MapReduce is a programming framework introduced by Google to aid the development of web search applications on a large number of central processing units (CPUs). GPUs are designed as a special-purpose co-processor. Their programming interfaces are typically formulated for graphics applications. Compared to CPUs, GPUs have greater computation power and memory bandwidth; however, GPUs are more difficult to program because of the design of their architectures. The performance of the Korean morphological analyzer using the MapReduce framework on the GPU is evaluated in comparison with the CPU-based model. The proposed Korean Morphological analyzer shows promising scalable performance on distributed computing with the GPU.