• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4648-4663
• /
• 2020

This paper proposes the Lempel-Ziv 4(LZ4) compression accelerator optimized for scale-out servers in data centers. In order to reduce CPU loads caused by compression, we propose an accelerator solution and implement the accelerator on an Field Programmable Gate Array(FPGA) as heterogeneous computing. The LZ4 compression hardware accelerator is a fully pipelined architecture and applies 16 dictionaries to enhance the parallelism for high throughput compressor. Our hardware accelerator is based on the 20-stage pipeline and dictionary architecture, highly customized to LZ4 compression algorithm and parallel hardware implementation. Proposing dictionary architecture allows achieving high throughput by comparing input sequences in multiple dictionaries simultaneously compared to a single dictionary. The experimental results provide the high throughput with intensively optimized in the FPGA. Additionally, we compare our implementation to CPU implementation results of LZ4 to provide insights on FPGA-based data centers. The proposed accelerator achieves the compression throughput of 639MB/s with fine parallelism to be deployed into scale-out servers. This approach enables the low power Intel Atom processor to realize the Hadoop storage along with the compression accelerator.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.9-15
• /
• 2022

This paper proposes a coordinated multi-point communication (CoMP) method with channel selection to improve performance of a macro user equipment (MUE) in a dense small-cell network environment in a building located within coverage of a macro base station (MBS). In the proposed CoMP method, in order to improve the performance of the MUE located in the building, A small-cell base station (SBS) selects a channel with lower interference to the neighboring MUE and transmits appropriate signals to the MUE requiring CoMP. Simulation results show that the proposed CoMP method improves the performance of the MUE by up to 164% and 51%, respectivley, compared to a random channel allocation based traditional SBS network and CoMP method.

• Nuclear Engineering and Technology
• /
• v.55 no.9
• /
• pp.3301-3312
• /
• 2023

This study incorporates a high-fidelity transient analysis solver based on multigroup CMFD in the MOC code STREAM. Transport modeling with heterogeneous geometries of the reactor core increases computational cost in terms of memory and time, whereas the multigroup CMFD reduces the computational cost. The reactor condition does not change at every time step, which is a vital point for the utilization of CMFD. CMFD correction factors are updated from the transport solution whenever the reactor core condition changes, and the simulation continues until the end. The transport solution is adjusted once CMFD achieves the solution. The flux-weighted method is used for rod decusping to update the partially inserted control rod cell material, which maintains the solution's stability. A smaller time-step size is needed to obtain an accurate solution, which increases the computational cost. The adaptive step-size control algorithm is robust for controlling the time step size. This algorithm is based on local errors and has the potential capability to accept or reject the solution. Several numerical problems are selected to analyze the performance and numerical accuracy of parallel computing, rod decusping, and adaptive time step control. Lastly, a typical pressurized LWR was chosen to study the rod-ejection accident.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.794-815
• /
• 2023

The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1103-1106
• /
• 2008

Data Grid is a kind of Grid computing provides the cooperative environment through the distributed data sharing, and can manage the massive data easily and efficiently. We designed and implemented Globus Toolkit4 (GT4) based database access and integration service (GDAIS). This service was implemented as Grid service for run on the GT4 which is Grid middleware. And it provides functions which are automatic registration of database in virtual organization, distributed query service, and the unified user interface. Also this system can use components which are provided from GT4. Therefore it can improve the efficiency to distribute and manage databases, can easily access and integrate of the distributed heterogeneous data in Grid environments.

• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.95-102
• /
• 2024

In distributed computing, accessible encryption strategy over Auditable data is a hot research field. Be that as it may, most existing system on encoded look and auditable over outsourced cloud information and disregard customized seek goal. Distributed storage space get to manage is imperative for the security of given information, where information security is executed just for the encoded content. It is a smaller amount secure in light of the fact that the Intruder has been endeavored to separate the scrambled records or Information. To determine this issue we have actualize (CBC) figure piece fastening. It is tied in with adding XOR each plaintext piece to the figure content square that was already delivered. We propose a novel heterogeneous structure to evaluate the issue of single-point execution bottleneck and give a more proficient access control plot with a reviewing component. In the interim, in our plan, a CA (Central Authority) is acquainted with create mystery keys for authenticity confirmed clients. Not at all like other multi specialist get to control plots, each of the experts in our plan deals with the entire trait set independently. Keywords: Cloud storage, Access control, Auditing, CBC.

• Journal of KIISE:Software and Applications
• /
• v.34 no.9
• /
• pp.817-827
• /
• 2007

In the age of ubiquitous environment, huge number of devices and computing services are provided to users. Personalized service, which is modeled according to the character of each and every individual is of particular need. In order to provide various dynamic services according to user's movement, service unit and operating mode should be able to operate automatically with minimum user intervention. In this paper, we discuss the steps of offering approximate service based on user's request in ubiquitous environment. First, we present our simulator designed for modeling the physical resource and computing object in smart space - the infrastructure in ubiquitous. Second, intelligent agents, which we developed based on a FIPA specification compliant multi-agent framework will be discussed. These intelligent agents are developed for achieving the service goal through cooperation between distributed agents. Third, we propose an automated service discovery and composition method in heterogeneous environment using semantic message communication between agents, according to the movement by the user interacting with the service available in the smart space. Fourth, we provide personalized service through agent monitoring anytime, anywhere from user's profile information stored on handhold device. Therefore, our research provides high quality service more than general automated service operation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.9-20
• /
• 2005

In this paper, we propose ubiTrack, a system which tracks users' location in indoor environments by employing infrared-based proximity method. Most of recently developed systems have focussed on performance and accuracy. For this reason, they adopted the idea of centralized management, which gathers all information in a main system to monitor users' location. However, these systems raise privacy concerns in ubiquitous computing environments where tons of sensors are seamlessly embedded into environments. In addition, centralized systems also need high computational power to support multiple users. The proposed ubiTrack is designed as a passive mobile architecture to relax privacy problems. Moreover, ubiTrack utilizes appropriate area as a unit to efficiently track users. To achieve this, ubiTrack overlaps each sensing area by utilizing the TDM (Time-Division Multiplexing) method. Additionally, ubiTrack exploits various filtering methods at each receiver and utilization module. The filtering methods minimize unexpected noise effect caused by external shock or intensity weakness of ID signal at the boundary of sensing area. ubiTrack can be applied not only to location-based applications but also to context-aware applications because of its associated module. This module is a part of middleware to support communication between heterogeneous applications or sensors in ubiquitous computing environments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.120-134
• /
• 2000

In this paper we present a Distributed Object oriented Virtual computing Environment, called DOVE which consists of autonomous distributed objects interacting with one another via method invocations based on a distributed object model. DOVE appears to a user logically as a single virtual computer for a set of heterogeneous hosts connected by a network as if objects in remote site reside in one virtual computer. By supporting efficient parallelism, heterogeneity, group communication, single global name service and fault-tolerance, it provides a transparent and easy-to-use programming environment for parallel applications. Efficient parallelism is supported by diverse remote method invocation, multiple method invocation for object group, multi-threaded architecture and synchronization schemes. Heterogeneity is achieved by automatic data arshalling and unmarshalling, and an easy-to-use and transparent programming environment is provided by stub and skeleton objects generated by DOVE IDL compiler, object life control and naming service of object manager. Autonomy of distributed objects, multi-layered architecture and decentralized approaches in hierarchical naming service and object management make DOVE more extensible and scalable. Also,fault tolerance is provided by fault detection in object using a timeout mechanism, and fault notification using asynchronous exception handling methods

• Geophysics and Geophysical Exploration
• /
• v.13 no.4
• /
• pp.315-322
• /
• 2010

The phase-screen and the split-step Fourier migrations, which are implemented in both the frequency-wavenumber and frequency-space domains by using one-way scalar wave equation, allow imaging in laterally heterogeneous media with less computing time and efficiency. The generalized-screen migration employs the series expansion of the exponential, unlike the phase-screen and the split-step Fourier migrations which assume the vertical propagation in frequency-wavenumber domain. In addition, since the generalized-screen migration generalizes the series expansion of the vertical slowness, it can utilize higher-order terms of that series expansion. As a result, the generalized-screen migration has higher accuracy in computing the propagation with wide angles than the phase-screen and split-step Fourier migrations for media with large and rapid lateral velocity variations. In this study, we developed a 2D prestack generalized-screen migration module for imaging a complex subsurface efficiently, which includes various dips and large lateral variations. We compared the generalized-screen propagator with the phase-screen propagator for a constant perturbation model and the SEG/EAGE salt dome model. The generalized-screen propagator was more accurate than the phase-screen propagator in computing the propagation with wide angles. Furthermore, the more the higher-order terms were added for the generalized-screen propagator, the more the accuracy was increased. Finally, we compared the results of the generalizedscreen migration with those of the phase-screen migration for a model which included various dips and large lateral velocity variations and the synthetic data of the SEG/EAGE salt dome model. In the generalized-screen migration section, reflectors were positioned more accurately than in the phase-screen migration section.