• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.73-83
• /
• 2010

The scalability of a grid system should be efficiently designed to handle the increasing number of grid users. This paper presents a scalable resource sharing mechanism among virtual organizations (VO) in grid environment by the scalable virtual organizations (SVO). The proposed grid architecture is composed of standard services of a grid system to manage the SVO. We propose a group similarity function which is used to determine similarities among VOs to select the VOs to merge. We compared other similarity functions to the GSF and determined the throughput performance of the SVO using simulation for grid system.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.1-7
• /
• 2016

When multiple applications are running concurrently on a multi-processor system, interferences between applications make it difficult to guarantee real-time constraints. We propose a novel interference analysis technique that allows sharing of share processors among dataflow applications, while satisfying real-time constraints. Based on the interference analysis, we develop a co-scheduling technique that aims to minimize the resource usage. Compared to an existent technique that involves converting application graphs to real-time tasks, the proposed technique shows better results in terms of resource usage, especially when it is applied to applications with tight time constraints.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.3
• /
• pp.45-49
• /
• 2022

The fourth industrial revolution, internet of things, and the expansion of online web services have increased an exponential growth and deployment in the number of cloud data centers (CDC). The cloud is emerging as new paradigm for delivering the Internet-based computing services. Due to the dynamic and non-linear workload and availability of the resources is a critical problem for efficient workload and resource management. In this paper, we propose the particle swarm optimization (PSO) based gated recurrent unit (GRU) neural network for efficient prediction the future value of the CPU and memory usage in the cloud data centers. We investigate the hyper-parameters of the GRU for better model to effectively predict the cloud resources. We use the Google Cluster traces to evaluate the aforementioned PSO-GRU prediction. The experimental shows the effectiveness of the proposed algorithm.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.111-119
• /
• 2023

Mobile Ad-hoc Network (MANET) is an infrastructure-less network that can configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is the Resource Consumption Attack (RCA). In this type of attack, the attacker consumes the normal node energy by flooding it with bogus packets. Routing in MANET is susceptible to RCA and this is a crucial issue that deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of RCA on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new RCA model (RCAM) which applies RCA on the two chosen routing protocols using the NS-2 simulator.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1153-1156
• /
• 1987

This paper presents a distributed algorithm for deadlock detection in distributed computing system. The deadlock could be detected optimally from cycle. This algorithm maintains the Process-Resource Table and it could be found the deadlock from the table.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.99-102
• /
• 2003

Computing environments of Embedded Systems are different from those of desktop computers so that they have resource constraints such as CPU processing, memory capacity, power, and etc.. Thus, when a desktop S/W is ported into embedded systems, optimization should be seriously considered. In this paper, we investigate several S/W optimization techniques to be considered for porting H.263 encoder into a high performance DSP, TMS320C6711. Through experiments, it is found that optimization techniques employed can make a big performance improvement.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.208-209
• /
• 2013

클라우드 환경에서 Scientific Application Service와 같이 computing intensive한 job을 최소한의 자원을 이용해 성능을 보장하면서 서비스를 제공할 수 있는 어플리케이션 프로파일링(Application Profiling) 기술을 제안한다.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.53 no.1
• /
• pp.50-56
• /
• 2020

Determination of the precise size at sexual maturity is very important for science-based stock assessment and fisheries resource management. In this study, two different models, (1) a visual method and (2) a gonadosomatic index (GSI) method, were employed to estimate length at sexual maturity of the small yellow croaker Larimichthys polyactis in the Yellow Sea of Korea. The visual method is a common qualitative method using visual gonadal identification. Conversely, the GSI method is a quantitative method using the GSI, which can be easily and precisely collected. We compared results from these methods to determine the best approach, and to examine the practicality of the GSI method. Logistic regression of the maturity ogive was conducted using a general linear model (GLM) with the R statistics program. Also, the bootstrapped 95% confidence intervals of all estimates were calculated. The best-fit model was the visual method (R_Mc²=0.805, AUC=0.989, L₅₀=15.1). Among models using the GSI method, the model computing GSI_ref=0.94 was the best-fit model (R_Mc²=0.792, AUC=0.989, L₅₀=15.2). There was no significant difference between the two models, evidencing the effectiveness and accuracy of the GSI method.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.1-14
• /
• 2007

IF handoff events are occurred during the transmission of multimedia traffic, the efficient resource allocation and handoff procedures are necessary to maintain the same QoS of transmitted multimedia traffic because the QoS may be defected by some delay and information loss, This paper proposes a handoff scheme to accommodate multimedia traffic based on the resource reservation procedure using direction estimation, This scheme uses a novel mobile tracking method based on Fuzzy Multi Criteria Decision Making, in which uncertain parameters such as PSS (Pilot Signal Strength), the distance between the mobile and the base station, the moving direction, and the previous location are used in the decision process using the aggregation function in fuzzy set theory, With the position information, the moving direction is determined, The handoff requests for real time sessions are handled based on the direction prediction and the resource reservation scheme, The resources in the estimated adjacent cells should be reserved and allocated to guarantee the continuity of the real time sessions, Through simulation results, we show that our proposed resource reservation method provides a better performance than that of the conventional method.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.3
• /
• pp.72-83
• /
• 2017

GPUs can provide high throughput with latency hiding by executing many warps in parallel. MSHR(Miss Status Holding Registers) for L1 data cache tracks cache miss requests until required data is serviced from lower level memory. In recent GPUs, excessive requests for cache resources cause underutilization problem of GPU resources due to cache resource reservation fails. In this paper, we propose a new warp scheduling technique to reduce stall cycles under MSHR resource shortage. Cache miss rates for each warp is predicted based on the observation that each warp shows similar cache miss rates for long period. The warps showing low miss rates or computation-intensive warps are given high priority to be issued when MSHR is full status. Our proposal improves GPU performance by utilizing cache resource more efficiently based on cache miss rate prediction and monitoring the MSHR entries. According to our experimental results, reservation fail cycles can be reduced by 25.7% and IPC is increased by 6.2% with the proposed scheduling technique compared to loose round robin scheduler.