• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.173-180
• /
• 2016

SOA has been adopted by enormous number of organizations world-wide. This study has investigated significant factors which affect SOA adoption in positive and negative manner. Unlike the previous similar studies, where they focused on qualitative analysis for SOA adoption, this study conducted a quantitative analysis to investigate the relationship between the adoption of SOA and the performance of IT organizations. In order to conduct the research, an online questionnaire was created and distributed among SOA experts through the social networking platform of professionals, LinkedIn. Total one hundred and four (104) respondents from thirty (30) different countries participated in this study. The results of this study indicate that there are both positive and negative influences upon SOA adoption. The positive influences includes: governance, strategy, culture and communication, business and IT alignment and ROI; whereas complexity, security concerns, and costs have negatively affected SOA adoption.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.631-634
• /
• 2014

When to build a Web and Cloud Computing environment, it is essential to used a database system. Database systems includes commercial programs, such as Oracle and MS-SQL, but also similar to the performance of commercial applications, there are many free programs. In particular, PostgreSQL, MySQL, MariaDB are no costs, but the source is open to the public can be applied to a variety of environments. This paper presents an open source relational database management system, the trends are examined.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.313-326
• /
• 2022

This study presents a noble scheme for distributed and parallel simulations with optimized agent placement for simulation instances. The traditional parallel simulation has some limitations in that it does not provide sufficient performance even though using multiple resources. The main reason for this discrepancy is that supporting parallelism inevitably requires additional costs in addition to the base simulation cost. We present a comprehensive study of parallel simulation architectures, execution flows, and characteristics. Then, we identify critical challenges for optimizing large simulations for parallel instances. Based on our cost-benefit analysis, we propose a novel approach to overcome the performance constraints of agent-based parallel simulations. We also propose a solution for eliminating the synchronizing cost among local instances. Our method ensures balanced performance through optimal deployment of agents to local instances and an adaptive agent placement scheme according to the simulation load. Additionally, our empirical evaluation reveals that the proposed model achieves better performance than conventional methods under several conditions.

• International Journal of Contents
• /
• v.10 no.1
• /
• pp.62-67
• /
• 2014

Usually, cloud storage systems are developed based on DFS (Distributed File System) for scalability and reliability reasons. DFSs are designed to improve throughput than IO response time, and therefore, they are appropriate for batch processing jobs. Recently, cloud storage systems have been used for update intensive applications such as OLTP and so on. However, in DFSs, in-place update operations are not carefully considered. Therefore, when updates are frequent, I/O performance of DFSs are degraded significantly. DFSs with RAID techniques have been proposed to improve their performance and reliability. Their performance degradation caused by frequent update operations can be more significant. In this paper, we propose an in-place update method for DFS RAID exploiting a differential logging technique. The proposed method reduces the I/O costs, network traffic and XOR operation costs for RAID. We demonstrate the efficiency of our proposed in-place update method through various experiments.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1293-1308
• /
• 2020

In fine-tuning-based transfer learning, the size of the dataset may affect learning accuracy. When a dataset scale is small, fine-tuning-based transfer-learning methods use high computing costs, similar to a large-scale dataset. We propose a mid-level feature extractor that retrains only the mid-level convolutional layers, resulting in increased efficiency and reduced computing costs. This mid-level feature extractor is likely to provide an effective alternative in training a small-scale medical image dataset. The performance of the mid-level feature extractor is compared with the performance of low- and high-level feature extractors, as well as the fine-tuning method. First, the mid-level feature extractor takes a shorter time to converge than other methods do. Second, it shows good accuracy in validation loss evaluation. Third, it obtains an area under the ROC curve (AUC) of 0.87 in an untrained test dataset that is very different from the training dataset. Fourth, it extracts more clear feature maps about shape and part of the chest in the X-ray than fine-tuning method.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.363-370
• /
• 2006

Currently, many people have been researching diverse mechansmims related to a resource access control in Grid environment. Mostly Grid user's resource access control was designed to authorize according to their attributes and roles. But, to provide Grid with resources continuously, a resource access based on utility computing must be controlled. So, in this paper we propose and implement mechanism that intergrates Grid accounting concept with resource access control. This mechanism calcuates costs of Grid service on the basis of accounting, and determines based on user's fund availibility whether they continue to make use of site resources or not. Grid jobs will be controlled according to a site resource access control policy only if the amount of available fund is less than its costs. If Grid job completed, resource consumer pays for the costs generated by using provider's idle resources. Therefore, this paper provides mechansim to be able to control user's resource access by Grid accounting, so that it is evaluated as the research to realize utility computing environment corresponding to economic principle.

• Journal of Korea Multimedia Society
• /
• v.16 no.2
• /
• pp.234-240
• /
• 2013

All around the world, numerous scientists have been carried out researches of e-Science to improve performance of computations and accessibility of their experimental flexibilities for a long times. However, they still have been in difficulty securing high-performance computing facilities. In case of Aerodynamics, for example, a single experiment costs a tremendous amount of budget and requires a span of more than 6 months even though researchers have been developed diverse improved mathematical methods as well as relied on advanced computing technologies to reduce runtime and costs. In this paper, we proposed a multiple infrastructure-based scientific workflow environments for engineering education in fields of design optimization of aircraft and demonstrated the superiority. Since it offers diverse kind of computing resources, it can offer elastic resources regardless of the number of tasks for experiments and limitations of spaces. Also, it can improve education efficiency by using this environment to engineering education.

• The Journal of the Convergence on Culture Technology
• /
• v.3 no.4
• /
• pp.199-205
• /
• 2017

As cloud computing can utilize the proper allocation of system resources, it can be expected to have great benefits in terms of maintaining availability and reducing costs when a cloud is applied to a financial company's computer system. Although some provisions of the Financial Supervisory Regulation were revised in October 2016, this is limited to non-critical information processing systems, limits are remain whitch the application of cloud computing to the whole computer system of financial companies including electronic financial systems. In this paper, cloud security requirements are studied for the application of financial company's computational infrastructure system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4364-4384
• /
• 2021

The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

• Journal of the military operations research society of Korea
• /
• v.11 no.1
• /
• pp.8-32
• /
• 1985

The objective of this study is to develop the Transportation Model of Linear Programming in which optimal transportation pattern by regions (origins and destinations) to minimize the total transportation costs can be obtained for handling government-held grains. As a result of computing the Transportation Model, the total transportation costs of transporting 1,058,507 metric tons from origins to destinations are 7,234 million won. So, the transporation cost is 6,834 won per ton in this model. But actual transportation cost in 1983 is 11,498 won per ton. Therefore when we distribute and transport the government-held grains from production factories to consumption warehouses, using this Transportation Model of Linear Programming is benefitable. Especially excluding the cost of computer, we could save more than two billion won of Government budget per year.