• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.488-493
• /
• 2015

An AddSIM(Adaptive distributed and parallel Simulation environment for Interoperable and reusable Models) is an integrated engagement simulation environment with high-resolution weapon system models for estimation and analysis of their performance and effectiveness. AddSIM can simultaneously handle the continuous dynamical system models based on continuous time, and command, control(C2) and network system models based on a discrete event. To accommodate legacies based on DEVS(Discrete Event System Specification) modeling, DEVS legacies must first be converted into AddSIM models. This paper describes how to implement DEVS models on AddSIM. In this study a method of mapping from hierarchical DEVS models to AddSIM players was developed: The hierarchical DEVS model should be flattened into a one layered model and four DEVS functions of the model, external transition, internal transition, output and time advance, should be mapped into functions of the AddSIM player.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.899-912
• /
• 2000

PVM provides users with a single image of high performance parallel computing machine by collecting machines distributed over a network. Low communication overhead is essential to effectively run applications on PVM based platforms. In the original PVM, three times of memory copies are required for a PVM task to send a message to a remote task, which results in performance degradation. We propose a zero-copy model using global shared memory that can be accessed by PVM tasks, PVM daemon, and network interface card(NIC). In the scheme, a task packs data into global shared memory, and notify daemon that the data is ready to be sent, then daemon routes the data to a remote task to which it is sent with no virtual data copy overhead. Experimental result reveals that the message round trip time between two machines is reduced significantly in the proposed zero-copy scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.496-505
• /
• 2000

Clusters of workstations (COW) are becoming an attractive option for parallel scientific computing, a field formerly reserved to the MPPs, because their cost-performance ratio is usuallybetter than that of comparable MPPS, and their hardware and software can be easily enhanced to thelatest generations. In this paper we present the design and implementation of our runtime library forclusters of workstations, called "Collective I/O Clustering". The library provides a friendlyprogramming model for the I/O of irregular applications on clusters of workstations, being completelyintegrated with the underlying communication and I/O system. In the collective I/O clustering, two I/Oconfigurations are possible. In the first I/O configuration, all processors allocated can act as I/Oservers as well as compute nodes. In the second I/O configuration, only a subset of processors canact as I/O servers, The compression and software caching facilities have been incorporated into thecollective 1/0 clustering to optimize the communication and I/O costs. All the performance results wereobtained on the IBM-SP machine, located at Argonne National Labs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.67-72
• /
• 2004

This paper proposes a method improving the convergence speed of optimal solution for parallel genetic algorithm in the network based client-server model. Unlike the existing methods of obtaining global elite only by evaluating local elites in server, the proposed method obtains it by evaluating local elites and improving its fitness by applying genetic algorithm during idle time of the server. By using the improved chromosome in server for the client's genetic algorithm processing, the convergence speed of the optimal solution is increased. The improvement of fitness at the server during the interval of chromosome migration is (equation omitted)(F$_{max}$(g)-F$_{max}$(g-1)), whole F$_{max}$(g) is a max fitness of the g-th generation and G is the number of improved generation by the server. As the number of clients increases and G decreases, the improvement of fitness goes down. However the improvement of fitness is better than existing methods..

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.75-83
• /
• 2007

Multithreaded model is an effective parallel system in that it can reduce the long memory reference latency time and solve the synchronization problems. When compiling the non-strict functional programs for the multithreaded parallel machine, the most important thing is to find an set of sequentially executable instructions and to partitions them into threads. The existing partitioning algorithm partitions the condition of conditional expression, true expression and false expression into the basic blocks and apply local partitioning to these basic blocks. We can do the better partitioning if we modify the definition of the thread and allow the branching within the thread. The branching within the thread do not reduce the parallelism, do not increase the number of synchronization and do not violate the basic rule of the thread partitioning. On the contrary, it can lengthen the thread and reduce the number of synchronization. In the paper, we enhance the method of the partition of threads by combining the three basic blocks into one of two blocks.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.87-93
• /
• 2002

A complex network and a parallel computer are made up of interconnected switching units. The role of a switching unit is to set up a connection between an input port and an output port, according to the routing information. We proposed our switching network with a remodeled architecture is a newly modified Banyan network with eight input and output ports. We have analysed the maximum throughput of the revised switch. Our analyses have shown that under the uniform random traffic load, the FIFO discipline is limited to 70%, The switching system consists of an input control unit, a switch unit and an output control unit. Therefore the result of the analyses shows that the results of the networking simulation with the new switch are feasible and if we adopt the new architecture of the revised model of the Banyan switch, the hardware complexity can be reduced. The FIFO discipline has increased by about 11% when we compare the switching system with the input buffer system. We have designed and verified the switching system in VHDL using Max＋plusII. We also designed our test environment including micro computers, the base station, and the proposed architecture. We proposed a new architecture of the Banyan switch for BISDN networks and parallel computers.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.3
• /
• pp.21-31
• /
• 2018

We introduces a system that enables fast and effective visualization of natural disaster data such as typhoons, tsunamis, floods, and flooding to help make informed decisions in disaster situations. Data containing disaster information consists of a few hundred megabytes to many tens and hundreds of gigabytes, which can not be handled by a PC. This system was implemented in the form of a client-server based service to generate and output results from high-performance servers. The server in a built-in, high-performance cluster handles client requests and sends the result of visualization to the client. Clients can receive the results in any form of images, videos, or 3D graphic model by specifying a desired time frame, effectively viewing the results with a user-friendly GUI.

• Journal of the Korean Geotechnical Society
• /
• v.32 no.1
• /
• pp.5-18
• /
• 2016

In this study, we grasped the resistance state of the back ground which had a notable influence on computing the lateral resistance of the laterally loaded pile group in the homogeneous ground by the model test. Resistance state was grasped as the depth of rotation-point, wedge failure angle, and wedge wing angle. The model experiment is performed by varying the width, spacing and number of piles and the relative density of sand in this study. According to the observation of the rear ground surface deformation of the piles in lateral load, rotation point ratio, wedge failure angle, and wedge wing angle of the front row were similar to those of the middle row; however, those of the back row were relatively smaller. The rotation point ratio, wedge failure angle and wedge wing angle of the piles in parallel were the same as those of a single pile. Based on the model test results, equations for estimation of the rotation-point, wedge failure angle, and wedge wing angle are proposed.

• Journal of Internet Computing and Services
• /
• v.23 no.4
• /
• pp.73-85
• /
• 2022

In the era of the 4th industrial revolution, where automation and connectivity are maximized with artificial intelligence, the importance of data collection and utilization for model update is increasing. In order to create a model using artificial intelligence technology, it is usually necessary to gather data in one place so that it can be updated, but this can infringe users' privacy. In this paper, we introduce federated learning, a distributed machine learning method that can update models in cooperation without directly sharing distributed stored data, and introduce a study to optimize distributed consensus among participants without an existing server. In addition, we propose a pattern and group-based distributed consensus optimization algorithm that uses an algorithm for generating patterns and groups based on the Kirkman Triple System, and performs parallel updates and communication. This algorithm guarantees more privacy than the existing distributed consensus optimization algorithm and reduces the communication time until the model converges.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2910-2925
• /
• 2017

Inadequate and inappropriate intake of food is known to cause various health issues and diseases. Due to lack of concise information about healthy diet, people have to rely on medicines instead of taking preventive measures in food intake. Due to diversity in food components and large number of dietary sources, it is challenging to perform real-time selection of diet patterns that must fulfill one's nutrition needs. Particularly, selection of proper diet is critical for patients suffering from various diseases. In this article, we highlight the issue of selection of proper diet that must fulfill patients' nutrition requirements. To address this issue, we present a cloud based food recommendation system, called Diet-Right, for dietary recommendations based on users' pathological reports. The model uses ant colony algorithm to generate optimal food list and recommends suitable foods according to the values of pathological reports. Diet-Right can play a vital role in controlling various diseases. The experimental results show that compared to single node execution, the convergence time of parallel execution on cloud is approximately 12 times lower. Moreover, adequate accuracy is attainable by increasing the number of ants.