• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.117-135
• /
• 2016

Performance enhancement is one of the most important issues in high performance distributed computing systems. In such computing systems, online users submit their jobs anytime and anywhere to a set of dynamic resources. Jobs arrival and processes execution times are stochastic. The performance of a distributed computing system can be improved by using an effective load balancing strategy to redistribute the user tasks among computing resources for efficient utilization. This paper presents a multi-class load balancing strategy that balances different classes of user tasks on multiple heterogeneous computing nodes to minimize the per-class mean response time. For a wide range of system parameters, the performance of the proposed multi-class load balancing strategy is compared with that of the random distribution load balancing, and uniform distribution load balancing strategies using simulation. The results show that, the proposed strategy outperforms the other two studied strategies in terms of average task response time, and average computing nodes utilization.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.81-87
• /
• 2010

This paper proposes a G-BLAST(BLAST using Grid Computing) system, an integrated software package for BLAST searches operated in heterogeneous distributed environment. G-BLAST employed 'database splicing' method to improve the performance of BLAST searches using exists computing resources. G-BLAST is a basic local alignment search tool of DNA Sequence using grid computing in heterogeneous distributed environment. The G-BLAST improved the existing BLAST search performance in gene sequence analysis. Also G-BLAST implemented the pipeline and data management method for users to easily manage and analyze the BLAST search results. The proposed G-BLAST system has been confirmed the speed and efficiency of BLAST search performance in heterogeneous distributed computing.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.49-56
• /
• 1999

Distributed object Computing, owing to the development of distributed computing, has improved the performance of distributed processing conducted between homogeneous and heterogeneous systems in network. However, it has failed to solve fundamental problems such as network overload and enormous requests demands by servers and clients. In this paper, we propose to design and implement an Object Migration system that uses the java language to tackle the mentioned problems. As the first step of the implementation of the system, we justify the characteristics of t도 mobile object model that keeps codes and states of an object. Implemented Object Migration System would accept objects being migrated to a specific node and support the virtual place in which objects could be executed automatically. Therefore, the Object Migration system we suggest could not only solve problems imposed to traditional distributed computing but also offer transparency of object migration between homogeneous and heterogeneous systems.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5446-5463
• /
• 2019

Parallel computing system components should be harmonized, and this harmonization is kept existent using synchronization time. Synchronization time affects the system in two ways. First, if we have too little synchronization time, some tasks face the problem of harmonization, as they need appropriate time to update and synchronize with the system. Second, if we allocate a large amount of time, stall system created. Random allocation of synchronization time for parallel systems slows down not only the booting time of the system but also the execution time of each application involved in the system. This paper presents a simulator used to test and allocate appropriate synchronization time for distributed and parallel heterogeneous systems. The simulator creates the parallel and heterogeneous system to be evaluated, and lets the user vary the synchronization time to optimize the booting time. NS3-cGEM5 simulator in this paper is formed by HLA-RTI federation integration of the two independent architecture and network simulators - NS3 and cGEM5. Therefore, nodes created on these simulators need synchronizations for harmonized system performance. We tested and allocated the appropriate synchronization time for our sample parallel system composed of one x86 server and three ARM clients.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.368-371
• /
• 2000

The distributed object computing is possible to distributed computing on same or heterogeneous machine environment with growth of distributed computing and object-oriented technology. The typical of model, CORBA is int solved the interoperability in heterogeneous machine environment over the network But, the CORBA has a problem that the server is can't rely on request of client occurs network overhead by extinction of network A plan was on the rise to solve the problem that is combination of mobile agent and distributed computing technology.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.86-95
• /
• 2009

Efficient DAG scheduling is critical for achieving high performance in heterogeneous computing environments. Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph(DAG) onto a set of heterogeneous machines is known to be an NP-complete problem. In this paper we propose a new list scheduling algorithm, called the Heterogeneous Rank-Path Scheduling(HRPS) algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing system. The primary goal of HRPS is to minimize the schedule length of applications. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling algorithm such as CPOP, HCPT and FLB in term of the schedule length. The comparison studies show that HRPS significantly outperform CPOP, HCPT and FLB in schedule length.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2001.11a
• /
• pp.335-354
• /
• 2001

.Next Generation Multimedia Streaming Technology Massive Scale Support $\rightarrow$ Clustered Solution Adaptive to Heterogeneous Network daptive to Heterogeneous Terminal Capability Presentation Technique .SMART Server Architecture .HERMES File System .Clustered Solution . High Speed Storage Interconnect .' Content Partitioning . Load Management . Support for Heterogeniety . Adaptive End to End Streaming Transport: Unicast vs. Multicast '. Scalable Encoding

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.1
• /
• pp.61-70
• /
• 2000

The design and development of a Web-based Workflow Management System (WfMS) is described in this paper. WfMSs are employed by many organizations to manage their business processes efficiently. The goal of this research is to provide an effective management of design processes in a distributed and heterogeneous environment-an environment in which workflow participants are geographically dispersed and use different computing platforms. We identify the requirements of WfMSs for the distributed and heterogeneous environment. We present an approach to applying the Web technology to was. The developed system is composed of three main modules: Worflow Engine, Web-based clients, and Process Designer. The workflow engine is implemented in pure Java for portability to heterogeneous platforms. furthermore, the client interfaces are all programmed using applets, and thus they can be readily accessed through the Internet/intranet. The Process Designer provides a build-time function of generating process specifications. Some important functions of the developed system are explained in this paper. A prototype system has been developed and applied to design processes. The system allows effective cooperation among designers who may be geographically separated.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.4
• /
• pp.165-172
• /
• 2023

Heterogeneous computing is a technology that utilizes different types of processors to perform parallel processing. It maximizes task processing and energy efficiency by leveraging various computing resources such as CPUs, GPUs, and FPGAs. On the other hand, edge computing has developed with IoT and 5G technologies. It is a distributed computing that utilizes computing resources close to clients, thereby offloading the central server. It has evolved to intelligent edge computing combined with artificial intelligence. Intelligent edge computing enables total data processing, such as context awareness, prediction, control, and simple processing for the data collected on the edge. If heterogeneous computing can be successfully applied in the edge, it is expected to maximize job processing efficiency while minimizing dependence on the central server. In this paper, experiments were conducted to verify the feasibility of various parallel programming models on high-end and low-end edge devices by using benchmark applications. We analyzed the performance of five parallel programming models on the Raspberry Pi 4 and Jetson Orin Nano as low-end and high-end devices, respectively. In the experiment, OpenACC showed the best performance on the low-end edge device and OpenSYCL on the high-end device due to the stability and optimization of system libraries.