• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.89-94
• /
• 2016

Recently, cluster computing environments have been in a process of change toward virtualized cluster environments. The change of the cluster environment has great impact on the performance of large volume distributed processing. Therefore, many domestic and international IT companies have invested heavily in research on cluster environments. In this paper, we show how the hypervisor affects the performance of distributed processing of a large volume of data. We present a performance comparison of MapReduce processing in two virtualized cluster environments, one built using the Xen hypervisor and the other built using the container-based Docker. Our results show that Docker is faster than Xen.

• Journal of Information Management
• /
• v.31 no.4
• /
• pp.71-87
• /
• 2000

Recently, researches of mobile agent systems have done actively to enhance usability of heterogenenous environment linked via network and to solve problems of existing distributed-object computing. Though these research and development many studies have done to be applicated to many areas that are existing distributed systems as well as E-commerce, network maintenance, and information retrieval etc. This paper reviews some related issues to agent studies, comprehensive studies to enhance telecommunication functionality among agents, and future and application fields of agent.

• Asia pacific journal of information systems
• /
• v.8 no.3
• /
• pp.21-36
• /
• 1998

Group collaborative systems are recently emerging to support a group of users engaged in common tasks such as group decision making, engineering design, or collaborative writing. Simultaneously, as communications networks and distributed database systems become core underlying architecture of the organization, the need of collaborative systems are gaining more attentions from industry. In such collaborative systems, as the shared objects may evolve constantly or change for operational purposes, providing the users with synchronized and consistent views of the shared object and maintaining the consistency between shared object and replicated objects are important to improve the overall productivity. This paper provides an change management framework for the group collaborative systems to facilitate managing dependency relationships between shared objects and dependents, and coordinating change and propagation activities in distributed computing environments. Specifically, the framework adopts an object-oriented database paradigm and presents several object constructs capturing dependency management and change notification mechanisms. And the proposed framework accommodates both persistent dependents such as replicated data and transient dependents such as various user views in a single formalism. A prototype system is developed on a commercial object-oriented database management system called OBJECTSTORE using the C++ programming language.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

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

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.815-820
• /
• 2001

This paper presents a distributed mobile architecture aimed to support the mobility of mobile station. The proposed architecture considers three significant objects；mobile station (MS), mobile agent (MA) which logically represents mobile station in the wireline network, and trace agent (TA) to represent application server (AS) providing application service to mobile station. The mobile agent is made closely coupled with the mobile station while the trace agent is made closely coupled with the application server. During the handoff process, a flow control mechanism is considered to correct packet loss and out-of-sequence packets problem. The result of analytic additional time delay due to handoff processing is presented and simulation was performed to check the additional time delay as well as the correctness of handoff algorithm.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.825-834
• /
• 2021

Based on its simplicity and user-friendly characteristics, OpenMP has become the standard model for programming on shared-memory architectures. Checkpointing-aided parallel execution (CAPE) is an approach that utilizes the discontinuous incremental checkpointing technique (DICKPT) to translate and execute OpenMP programs on distributed-memory architectures automatically. Currently, CAPE implements the OpenMP execution model by utilizing the DICKPT to distribute parallel jobs and their data to slave machines, and then collects the results after executing these distributed jobs. Although this model has been proven to be effective in terms of performance and compatibility with OpenMP on distributed-memory systems, it cannot fully exploit the capabilities of multicore processors. This paper presents a novel execution model for CAPE that utilizes two levels of parallelism. In the proposed model, we add another level of parallelism in the form of multithreaded processes on slave machines with the goal of better exploiting their multicore CPUs. Initial experimental results presented near the end of this paper demonstrate that this model provides significantly enhanced CAPE performance.

• International Journal of Computer Science & Network Security
• /
• v.24 no.7
• /
• pp.177-185
• /
• 2024

Web science, a general discipline of learning is presently at high demand of expertise with ideas to develop software-based WebApps and MobileApps to facilitate user or customer demand e.g. shopping etc. electronically with the access at their smartphones benefitting the business enterprise as well. A worldwide-computerized reservation network is used as a single point of access for reserving airline seats, hotel rooms, rental cars, and other travel related items directly or via web-based travel agents or via online reservation sites with the advent of social-web, e-commerce, e-business, from anywhere-on-earth (AoE). This results in the accumulation of large and diverse distributed databases known as big data. This paper describes a novel intelligent web-based electronic booking framework for e-business with distributed computing and data mining support with the detail of e-business system flow for e-Booking application architecture design using the approaches for distributed computing and data mining tools support. Further, the importance of business intelligence and data analytics with issues and challenges are also discussed.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.31-38
• /
• 2016

The interface between servers and clients and system management in the cloud computing environment is different from the existing computing environment. The technology for information protection. Management and user authentication has become an important issue. For providing a more convenient service to users, SSO technology is applied to this cloud computing service. In the SSO service environment, system access using a single key facilitates access to several servers at the same time. This SSO authentication service technology is vulnerable to security of several systems, once the key is exposed. In this paper, we propose a technology to solve problems, which might be caused by single key authentication in SSO-based cloud computing access. This is a distributed agent authentication technology using a multiple SSO agent to reinforce user authentication using a single key in the SSO service environment. For user authentication reinforcement, phased access is applied and trackable log information is used when there is a security problem in system to provide a safe cloud computing service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1002-1015
• /
• 2018

The advent of Internet of Things (IoT) and the evident inadequacy of Cloud networks concerning management of numerous end nodes have brought about a shift of paradigm giving birth to Fog computing. Fog computing is an extension of Cloud computing that extends Cloud resources at the edge of the network, closer to the user. Cloud computing has become one of the essential needs of people over the Internet but with the emerging concept of IoT, traditional Clouds seem inadequate. IoT entails extremely low latency and for that, the Cloud servers that are distant and unknown to the user appear to be unsuitable. With the help of Fog computing, the Fog devices installed would be closer to the user that will provide an immediate storage for the frequently needed data. This paper discusses data migration between different storage types especially between Cloud devices and then presents a mechanism to migrate data between Cloud and Fog Layer. We call this mechanism Adaptive Deadline-Aware Scheme (ADAS) for Data migration between Cloud and Fog. We will demonstrate that we can access and process latency sensitive "hot" data through the proposed ADAS more efficiently than with a traditional Cloud setup.