• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.87-92
• /
• 2011

Server overload is directly proportional to requested image data size in a image processing. If request data are increase then system is overloaded in a image processing system. For the reduce of server bottle neck, we will be able to consider a distributed processing. Simple distributed processing system can solve server bottleneck and system overload but high cost system requirements. In this paper, Proposes a new distributed image processing system. Object activation technology are being grafted on to simple distributed processing system. It can optimize the user of system resources and can reuse idle system resources in network.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.795-803
• /
• 2000

This paper presents a shared data decomposition model for improving concurrency in multi-user, distributed software developments. In our model, the target software system is decomposed into the independent components based on project roles to be distributed over clients. The distributed components are decomposed into view objects and core objects to replicate only view objects in a distributed collaboration session. The core objects are kept in only one client and the locking is used to prevent inconsistencies. The grain size of a lock is a role instead of a class which is commonly used as the locking granularity in the existing systems. The experimental result shows that our model reduces response time by 12${\sim}$18% and gives good scalability.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.49-57
• /
• 2008

In this paper, we propose a novel hierarchical distributed intrusion detection system, named HNHDIDS(Home Network Hierarchical Distributed Intrusion Detection System), which is not only based on the structure of distributed intrusion detection system, but also fully consider the environment of secure home networks service. The proposed system is hierarchically composed of the one-class support vector machine(support vector data description) and local agents, in which it is designed for optimizing for the environment of secure home networks service. We support our findings with computer experiments and analysis.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.1
• /
• pp.19-24
• /
• 2021

In this paper, we study performance factor of machine learning in the distributed environment using Apache Spark and presents an efficient distributed processing method through experiments. This work firstly presents performance factor when performing machine learning in a distributed cluster by classifying cluster performance, data size, and configuration of spark engine. In addition, performance study of regression analysis using Spark MLlib running on the Hadoop cluster is performed while changing the configuration of the node and the Spark Executor. As a result of the experiment, it was confirmed that the effective number of executors was affected by the number of data blocks, but depending on the cluster size, the maximum and minimum values were limited by the number of cores and the number of worker nodes, respectively.

• Architectural research
• /
• v.7 no.2
• /
• pp.23-33
• /
• 2005

The use of computers in architectural professions has grown with the power of easy data management, increased sophistication of standalone applications, inexpensive hardware, improved speed of processing, use of standard library and tools for communication and collaboration. Recently, there has been a growing interest in distributed CAAD (Computer-Aided Architectural Design) integration due to the needs of direct collaboration among project participants in different locations, and Internet is becoming the optimal tool for collaboration among participants in architectural design and construction projects. The aim of this research is to provide a new paradigm for a CAAD system by combining research on integrated CAAD applications with recent collaboration technologies. To accomplish this research objective, interactive three-dimensional (3D) design tools and applications running on the Web have been developed for an Internet-based distributed CAAD application system, specifically designed to meet the requirements of the architectural design process. To this end, two different scopes of implementation are evaluated: first, global architecture and the functionality of a distributed CAAD system; and, second, the association of an architectural application to the system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.36
• /
• pp.143-152
• /
• 1995

This paper determines the allocation of computers and data files to minimize the sum of processing and communication costs which occur in processing jobs at each node. The problem of optimally configuring a distributed computer system belongs to the class of NP-Complete problems and the object function of this paper is nonlinear function and is hard to solve. This paper seeks the solution of distributed processing system by Tabu Search. Firstly, it presents the method of generating the starting solution proper to the distributed processing system. Secondly, it develops the method of searching neighborhood solutions. Finally, it determines the Tabu restriction appropriate to the distributed processing system. According to the experimental results, this algorithm solves a sized problems in reasonable time and is effective in the convergence of the solution. The algorithm developed in this paper is also applicable to the general allocation problems of the distributed processing system.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• Nuclear Engineering and Technology
• /
• v.54 no.10
• /
• pp.3587-3594
• /
• 2022

A distributed high-speed data acquisition and monitoring system for the RF negative ion source at Huazhong University of Science and Technology (HUST) is developed, which consists of data acquisition, data forwarding and data processing. Firstly, the data acquisition modules sample physical signals at high speed and upload the sampling data with corresponding absolute-time labels over UDP, which builds the time correlation among different signals. And a special data packet format is proposed for the data upload, which is convenient for packing or parsing a fixed-length packet, especially when the span of the time labels in a packet crosses an absolute second. The data forwarding modules then receive the UDP messages and distribute their data packets to the real-time display module and the data storage modules by PUB/SUB-pattern message queue of ZeroMQ. As for the data storage, a scheme combining the file server and MySQL database is adopted to increase the storage rate and facilitate the data query. The test results show that the loss rate of the data packets is within the range of 0-5% and the storage rate is higher than 20 Mbps, both acceptable for the HUST RF negative ion source.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.109-113
• /
• 2004

This paper is to investigate the efficiency of the process of data preparation for existing data mining tools, and present a design principle for a new efficient data preparation system . We compare the often used data mining tools based on the access method to local and remote databases, and on the exchange of information resources between different computers. The compared data mining tools are Answer Tree, Clementine, Enterprise Miner, and Weka. We propose a design principle for an efficient system for data preparation for data mining on the distributed networks.

• The Journal of the Korea Contents Association
• /
• v.12 no.1
• /
• pp.80-90
• /
• 2012

Medical data sampled through medical sensor nodes can provide services properly only when the data are not lost even during the fault of a home health gateway. The loss of medical data can be minimized if a sensor node, in which it is expected that there are the most saving spaces, is selected after medical sensor nodes tentatively conduct local save or communicate with each other during a fault when data cannot received. Furthermore, efficient saving techniques are necessary since the cycle for sampling information is different according to the type of medical data and a space for distributed saving is different for each apparatus. So, this research suggests an efficient distributed archiving protocol (DAP) for medical data sensor nodes, each of which has a diverse sampling cycle. In order to confirm the usefulness of DAP, DAP between sensor node and gateway was designed and materialized. An experiment was conducted using the materialized program and earned a high level of recovery rate (99.3%) and of accuracy rate, which confirms that sensor nodes can play their role during a temporary fault.