• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.75-84
• /
• 2005

Grid computing enables a shift from a localized resource computing model to a fully-distributed virtual organization with shared resources, Accounting is one of the main obstacles to widespread adoption of the Grid. Accounting has until recently, been a sparsely-addressed problem, particularly in practice. In this paper, we design and implement the accounting information gathering system. Accounting information gathered at each local system does not include grid-aware information. To be useful in grid environment, grid user information must be included in accounting information. To make it useful in grid environment, we add grid user information with PGAM. Implemented system is based on OGSA, following GSAX framework of RUS-WG in GGF. And the schema of accounting information is following usage Record Fields of UR-WG in GGF. Also, the accounting information integrating and monitoring tool for system management in the Grid environment are implemented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.789-798
• /
• 2016

In this paper, we propose a cache algorithm based on user's context for enterprise/urban smallcell environments. The smallcell caching method is to store mobile users' data traffic at a storage which is equipped in smallcell base station and it has an effect of reducing core networks traffic volume. In our algorithm, contrary to existing smallcell cache algorithms, the cache storage is equipped in a edge server by using a concept of the Mobile Edge Computing. In order to reflect user's characteristics, the edge server classifies users into several groups based on user's context. Also the edge server changes the storage size and the cache replacement frequency of each group to improve the cache efficiency. As the result of performance evaluation, the proposed algorithm can improve the cache hit ratio by about 11% and cache efficiency by about 5.5% compared to the existing cache algorithm.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.5
• /
• pp.103-110
• /
• 2010

If an exterior computer wants to join the Grid/cloud computing platform for a while, all of the related firewalls' filtering rule should be immediately updated. As the platform of Internet application is gradually evolving into the Grid/Cloud environment, the R&D requirement for the dynamic traversing of the multiple firewalls by a single try is also increasing. In this paper, we introduce the new mechanism for the dynamic traversing of the multiple firewalls using the concept of the one-time master key that can dynamically unlock the tiers of firewalls simultaneously instead of the existed filtering rule based method like a lock management at each firewall. The proposed master keys are like one-time password, consisted of IP addresses, port numbers, and TCP's initial sequence numbers, and generated by end users not administrators. They're exchanged mutually in advance and used to make a hole at local-side firewalls for the other's packet incoming. Therefore, the proposed mechanism can function regardless of the number or type of firewalls.

• Korean Journal of Remote Sensing
• /
• v.36 no.5_3
• /
• pp.1027-1036
• /
• 2020

In this study, a cloud-based processing method using Agisoft Metashape, a commercial software, and Amazon web service, a cloud computing service, is introduced and evaluated to quickly generate high-precision 3D realistic data from large volume UAV images acquired in disaster sites. Compared with on-premises method using a local computer and cloud services provided by Agisoft and Pix4D, the processes of aerial triangulation, 3D point cloud and DSM generation, mesh and texture generation, ortho-mosaic image production recorded similar time duration. The cloud method required uploading and downloading time for large volume data, but it showed a clear advantage that in situ processing was practically possible. In both the on-premises and cloud methods, there is a difference in processing time depending on the performance of the CPU and GPU, but notso much asin a performance benchmark. However, it wasfound that a laptop computer equipped with a low-performance GPU takes too much time to apply to in situ processing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2952-2971
• /
• 2016

Outsourcing jobs to a public cloud is a cost-effective way to address the problem of satisfying the peak resource demand when the local cloud has insufficient resources. In this paper, we studied the management of deadline-constrained bag-of-tasks jobs on hybrid clouds. We presented a binary nonlinear programming (BNP) problem to model the hybrid cloud management which minimizes rent cost from the public cloud while completes the jobs within their respective deadlines. To solve this BNP problem in polynomial time, we proposed a heuristic algorithm. The main idea is assigning the task closest to its deadline to current core until the core cannot finish any task within its deadline. When there is no available core, the algorithm adds an available physical machine (PM) with most capacity or rents a new virtual machine (VM) with highest cost-performance ratio. As there may be a workload imbalance between/among cores on a PM/VM after task assigning, we propose a task reassigning algorithm to balance them. Extensive experimental results show that our heuristic algorithm saves 16.2%-76% rent cost and improves 47.3%-182.8% resource utilizations satisfying deadline constraints, compared with first fit decreasing algorithm, and that our task reassigning algorithm improves the makespan of tasks up to 47.6%.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.5
• /
• pp.77-87
• /
• 2000

In this paper, we propose a Over-The-Cell channel routing algorithm for the advanced three-layer process. The proposed algorithm makes the channel routing problem to simplified one and makes use of simulated annealing technique to achieve the global optimal solution. And, a new method to remove the cyclic vertical constraints which are known to be the hardest element in the channel routing problem is proposed, and a way to detect the local minimal solution and escape from it successfully is presented. Futhermore, genetic algorithm based channel router is implemented and comparison is performed with the simulated annealing based one. All algorithms are written in C++ and GUI is made using Motif under Linux environment.

• Journal of Intelligence and Information Systems
• /
• v.14 no.2
• /
• pp.83-102
• /
• 2008

Ubiquitous computing requires timely supply of contextual information in order to upgrade decision quality. In this sense, this study is aimed at proposing a multi-dynamic decision support system for highly ill-structured problems. Especially, it is very important for decision makers in the ubiquitous computing to coordinate conflicts among local goals and global goal harmoniously. The proposed Multi-Dynamic Decision Support System (MDDSS) is basically composed of both central structure and distributed structure, in which central structure supports multi objects decision making and distributed structure supports individual decision making. Its hybrid architecture consists of decision processor, multi-agent controller and intelligent knowledge management processor. Decision processor provides decision support using contexts which come from individual agents. Multi-agent controller coordinates tension among multi agents to resolve conflicts among them. Meanwhile, intelligent knowledge management processor manages knowledge to support decision making such as rules, knowledge, cases and so on. To prove the validity of the proposed MDDSS, we applied it to an u-fulfillment problem system in which many kinds of decision makers exist trying to satisfy their own objectives, and timely adjustment of action strategy is required. Therefore, the u-fulfillment problem is a highly ill-structured problem. We proved its effectiveness with the aid of multi-agent simulation comprising 60 customers and 10 vehicles under three experimental modes.

• The Journal of the Korea Contents Association
• /
• v.11 no.9
• /
• pp.85-95
• /
• 2011

Recently, sudden interests of mobile cloud computing as well as conventional internet environment are rapidly increased as cloud computing spread out in our web society. Mobile devices including smart phone are rapidly changing in a wholesale way that covers hardwares, applications, and services. However, the Internet access using mobile device is not quite smooth in this local mobile internet environment which suffers from lack of understanding and observance of Web Standards. Although most of domestic web sites are developed focusing on various functions and eye-catching designs, this should became one of the main factors that make the usability and accessability decrease when accessing web with smart phones or table PCs. Therefore, this paper suggested a web interface that considered usability and accessability under mobile cloud environment and we tried to prove it via usability test. It could be found that there was an improvement of usability of interface of the main page that has been optimized to the mobile device environment suggested from the previous research we present, but this paper aimed to prove a usability improvement of total website as a whole by performing the usability test on the entire website. Selecting a special website optimized for mobile cloud computing, we prove an improvement of usability and accessibility. Therefore, we offer a guideline about user interface design applications to developers or companies who want to construct mobile website.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.304-313
• /
• 2016

We present a novel memory-efficient parallel ray casting algorithm for unstructured grid volume rendering on multi-core CPUs. Our method is based on the Bunyk ray casting algorithm. To solve the high memory overhead problem of the Bunyk algorithm, we allocate a fixed size local buffer for each thread and the local buffers contain information of recently visited faces. The stored information is used by other rays or replaced by other face's information. To improve the utilization of local buffers, we propose an image-plane based ray grouping algorithm that makes ray groups have high coherency. The ray groups are then distributed to computing threads and each thread processes the given groups independently. We also propose a novel hash function that uses the index of faces as keys for calculating the buffer index each face will use to store the information. To see the benefits of our method, we applied it to three unstructured grid datasets with different sizes and measured the performance. We found that our method requires just 6% of the memory space compared with the Bunyk algorithm for storing face information. Also it shows compatible performance with the Bunyk algorithm even though it uses less memory. In addition, our method achieves up to 22% higher performance for a large-scale unstructured grid dataset with less memory than Bunyk algorithm. These results show the robustness and efficiency of our method and it demonstrates that our method is suitable to volume rendering for a large-scale unstructured grid dataset.