• Title/Summary/Keyword: distributed

Search Result 22,721, Processing Time 0.041 seconds

Development of a Distributed Road Traffic Simulation System

  • Keawmanee, T.;Seubpradit, K.;Tandayya, P.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1324-1326
    • /
    • 2002
  • This paper concerns the development of distributed interactive simulation of a road traffic system. The simulation involved models of multiple and distributed road vehicles running on different locations. The simulation system represented a traffic system as if the distributed simulation models were in the same environment. The development of the distributed road traffic simulation was based on High Level Architecture (HLA), a state-of-the-art IEEE standard for the distributed and real-time simulation. Other work concerned modeling and simulating the road vehicles and building the map database for the virtual distributed shared environment. The information used in the simulation system was only in X-axis and Y-axis as the insignificant data in the Z-axis was omitted to simplify the simulation. However, the traffic system has visualized a 3-D coordinate system. The road vehicle models were able to avoid collision. The next direction of a vehicle can be chosen from the provided choices of further paths.

  • PDF

Performance of Distributed Database System built on Multicore Systems

  • Kim, Kangseok
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.47-53
    • /
    • 2017
  • Recently, huge datasets have been generating rapidly in a variety of fields. Then, there is an urgent need for technologies that will allow efficient and effective processing of huge datasets. Therefore the problems of partitioning a huge dataset effectively and alleviating the processing overhead of the partitioned data efficiently have been a critical factor for scalability and performance in distributed database system. In our work we utilized multicore servers to provide scalable service to our distributed system. The partitioning of database over multicore servers have emerged from a need for new architectural design of distributed database system from scalability and performance concerns in today's data deluge. The system allows uniform access through a web service interface to concurrently distributed databases over multicore servers, using SQMD (Single Query Multiple Database) mechanism based on publish/subscribe paradigm. We will present performance results with the distributed database system built on multicore server, which is time intensive with traditional architectures. We will also discuss future works.

Discovery Temporal Association Rules in Distributed Database (분산데이터베이스 환경하의 시간연관규칙 적용)

  • Yan Zhao;Kim, Long;Sungbo Seo;Ryu, Keun-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.115-117
    • /
    • 2004
  • Recently, mining far association rules in distributed database environments is a central problem in knowledge discovery area. While the data are located in different share-nothing machines, and each data site grows by time. Mining global frequent itemsets is hard and not efficient in large number of distributed sewen. In many distributed databases. time component(which is usually attached to transactions in database), contains meaningful time-related rules. In this paper, we design a new DTA(distributed temporal association) algorithm that combines temporal concepts inside distributed association rules. The algorithm confirms the time interval for applying association rules in distributed databases. The experiment results show that DTA can generate interesting correlation frequent itemsets related with time periods.

  • PDF

Design of a ParamHub for Machine Learning in a Distributed Cloud Environment

  • Su-Yeon Kim;Seok-Jae Moon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.2
    • /
    • pp.161-168
    • /
    • 2024
  • As the size of big data models grows, distributed training is emerging as an essential element for large-scale machine learning tasks. In this paper, we propose ParamHub for distributed data training. During the training process, this agent utilizes the provided data to adjust various conditions of the model's parameters, such as the model structure, learning algorithm, hyperparameters, and bias, aiming to minimize the error between the model's predictions and the actual values. Furthermore, it operates autonomously, collecting and updating data in a distributed environment, thereby reducing the burden of load balancing that occurs in a centralized system. And Through communication between agents, resource management and learning processes can be coordinated, enabling efficient management of distributed data and resources. This approach enhances the scalability and stability of distributed machine learning systems while providing flexibility to be applied in various learning environments.

Middleware Architecture for Open Control Systems in the Distributed Computing Environment

  • Lee, Wongoo;Park, Jaehyun
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.3 no.3
    • /
    • pp.190-195
    • /
    • 2001
  • The advance of computer, network, and Internet technology enables the control systems to process the massive data in the distributed computing environments. To implement and maintain the software in distributed environment, the component-based methodology is widely used. This paper proposes the middleware architecture for the distributed computer control system. With the proposed middleware services, it is relatively easy to maintain compatibility between products and to implement a portable control application. To achieve the compatibility between heterogeneous systems, the proposed architecture provides the communication protocols based on the XML with lightweight event-based service.

  • PDF

Distributed/parallel Algorithm Simulator (분산 및 병렬 알고리즘 시뮬레이터)

  • ;R.S.Ramakrishna
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.777-779
    • /
    • 1999
  • A new distributed/parallel algorithm simulator, DASim(Distributed Algorithm Simulator), is proposed in this paper. The idea is to ease the task of design, analysis and implementation of distributed algorithms. A small high level language has been proposed for the purpose. Through this non-language specific high level language, the users are spared from the tedious details about how to program distributed or parallel algorithms. Further, visualization of these algorithms are pretty helpful to understand behaviors of these algorithms.

  • PDF

Standard Status on ITU-T Distributed Ledger Technology (ITU-T에서 분산원장기술 표준화 동향)

  • Kwon, D.S.;Park, J.D.
    • Electronics and Telecommunications Trends
    • /
    • v.35 no.2
    • /
    • pp.50-68
    • /
    • 2020
  • Distributed Ledger Technology (DLT) refers to a process and related technologies that enable a person to safely suggest, verify, and record state changes (usually updates) to synchronize ledgers distributed across network nodes. DLTs are becoming increasingly important as data management requirements evolve. Therefore, they need to understand the current state of standards (such as distributed storage and access technologies) to address future requirements. This paper provides ITU-T FG-DLT standard activities, such as standardization ization trends, use cases, reference architectures, platform evaluation criteria and future prospects.

Distributed Web-based Simulation with Server Application Approach using Callback Mechanism

  • Shim, Won-Bo
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.04a
    • /
    • pp.152-157
    • /
    • 1999
  • In this paper, we introduce the concept of web-based simulation and some reviews on the distributed simulation on the World Wide Web (WWW) and classify the features of current web-based simulation under the distributed way. And then we suggest the structure of distributed web-based simulation which can achieve parallel simulation and reduce simulation run time and show how the callback mechanism works to enable the distributions of jobs to clients with push service in Remote Method Invocation (RMI). Finally we present a prototype of distributed web-based simulation.

  • PDF

Development for a Simple Client-based Distributed Web Caching System

  • Park, Jong-Ho;Chong, Kil-To
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2131-2136
    • /
    • 2003
  • Since the number of user-requests increases dramatically on the Internet, the servers and networks can be swamped unexpectedly without any prior notice. Therefore, the end-users are waiting or refused for the responses of the contents from the originating servers. To solve this problem, it has been considered that a distributed web caching system efficiently utilizes structural elements of the network. Because a distributed web caching system uses the caches that are close to end-users on the network, it transmits the contents to users faster than the original network system. This paper proposes a simple client-based distributed web caching system(2HRCS) that client can directly perform object allocation and load balancing without an additional DNS for load balancing in CARP (Cache Array Routing Protocol) and GHS (Global Hosting System) that are the recent distributed web caching system protocol. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system. The system has clients with consistent hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to consistent hashing system. Because this system can keep performance of the existing system and reduce costs, it has the advantage of constructing medium or small scale CDN (Contents Delivery Network).

  • PDF

A STUDY ON THE EFFICIENCY OF AERODYNAMIC DESIGN OPTIMIZATION USING DISTRIBUTED COMPUTATION (분산컴퓨팅 환경에서 공력 설계최적화의 효율성 연구)

  • Kim Y.-J.;Jung H.-J.;Kim T.-S.;Joh C.-Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.163-167
    • /
    • 2005
  • A research to evaluate efficiency of design optimization was performed for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition rather than a simultaneous distributed-analyses process using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoil and to evaluate their efficiencies. One dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in distributed computing environment. The SAO was found quite suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the fittest for distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model are annoying and time-consuming so that they often impair the automatic capability of design optimization and also deteriorate efficiency from the practical point of view.

  • PDF