• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.187-198
• /
• 2008

This paper develops a framework for efficient resource management within the grid service environment. Resource management is the core element of the grid service; therefore, GridRMF(Grid Resource Management Framework) is modeled and developed in order to respond to such variable characteristics of resources as accordingly as possible. GridRMF uses the participation level of grid resource as a basis of its hierarchical management. This hierarchical management divides managing domains into two parts: VMS(Virtual Organization Management System) for virtual organization management and RMS(Resource Management System) for metadata management. VMS mediates resources according to optimal virtual organization selection mechanism, and responds to malfunctions of the virtual organization by LRM(Local Resource Manager) automatic recovery mechanism. RMS, on the other hand, responds to load balance and fault by applying resource status monitoring information into adaptive performance-based task allocation algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.230-236
• /
• 2007

This paper presents a resource management mechanism for the mesh networking in IEEE 802.15.3 High-rate WPAN. IEEE 802.15 TGS is standardizing the MAC and PHY for mese networking. This task group researches the mechanism that are extension of network coverage without increasing transmit power of receive sensitivity, and studies the enhanced reliability via route redundancy. In this paper we propose the distributed resource management scheme that is fairly using the channel resource in the piconet without centralized piconet coordinator. Each DEV reserves the channel time and broadcasts its information. This scheme has unfairness for later associated DEV because of preoccupation of earlier associated DEVs. This paper presents the method that fairly allocates the channel time in MAC layer. And we evaluate the performance enhancement using simple simulations.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.245-252
• /
• 2001

Multicomputer systems achieve high performance by utilizing a number of computing nodes. Multidimensional meshes have become popular as multicomputer architectures due to their simplicity and efficiency. In this paper we propose an efficient processor allocation scheme for 3D torus based on first-fit approach. The scheme minimizes the allocation time by effectively manipulating the 3D information an 2D information using CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the proposed scheme is always smaller than the earlier scheme based on best-fit approach, while allowing comparable processor utilization. The difference gets more significant as the input load increases. To investigate the performance of the proposed scheme with different scheduling environment, non-FCFs scheduling policy along with the typical FCFS policy is also studied.

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

Large database processing is one of the most important technique in the information society, Since most large database is regionally distributed, the distributed database processing has been brought into relief. Communications and data compressions are the basic technologies for large database processing. In order to maximize those technologies, the execution time for the task, the size of data, and communication time between processors should be considered. In this paper, the dataflow scheme and vertically layered allocation algorithm have been used to optimize the distributed large database processing. The basic concept of this method is rearrangement of processes considering the communication time between processors. The paper also introduces measurement model of the execution time, the size of output data, and the communication time in order to implement the proposed scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.723-724
• /
• 2017

Recently, researches are being conducted to build a smart environment using various sensors and devices and to provide customized services to users through inter object communication. However, the existing system utilizes a centralized method of transmitting measured sensor data in real time to the server and processing it in batches and As the system is expanded, there is a problem that a high-end server must be configured. In this paper, we design a Resource Allocation Algorithm for IoT distributed processing environment to solve these problems. The resources required for the device to operate are transferred to the server and the server allocates resources in comparison to the task in progress. Therefore, it is expected that the data throughput of the server will be reduced and various devices can be configured in a server having a low specification.

• The Journal of the Korea Contents Association
• /
• v.20 no.7
• /
• pp.161-168
• /
• 2020

Local decentralization is a rational allocation of power and responsibilities between the state and local governments, but it is not just a transfer of administrative affairs and transfer of funds. In order to look at the task of moving administrative affairs to the districts, this paper first considered the relevant prior study. Next, we looked at the assessment of the level of function transfer and direction of transfer for government employees. Finally, the task for the transfer of functions has been drawn. Revitalizing functions or affair transfers requires the president's firm will and continued support, efforts to divide roles between central and local governments, increased responsibilities of local governments, revitalizing civic participation and establishing democracy. In addition, in order to expand the function transfer problem, the affair allocation system must be newly established. The discussion of such a system should take into account the issue of regional equity as well as financial transfers. Localization through transfer of functions requires, among other things, a change in perception of the relevant groups. Local decentralization requires long-term time and the participation and cooperation of not only the central but also related stakeholders are important, as seen in existing studies and in the nation's experience.

• Journal of Aerospace System Engineering
• /
• v.18 no.2
• /
• pp.56-63
• /
• 2024

As the safety of unmanned vehicles continues to improve, their usage in urban environments, which are full of obstacles such as buildings, is expected to increase. When numerous unmanned vehicles are operated in such environments, an algorithm that takes into account mutual collision avoidance, as well as static and dynamic obstacle avoidance, is necessary. In this paper, we propose an algorithm that handles task assignment and path planning. To efficiently plan paths, we construct a grid-based map and derive the paths from it. To enable quick re-planning in dynamic environments, we focus on reducing computational time. Through simulation, we explain obstacle avoidance and mutual collision avoidance in small-scale problems and confirm their performance by observing the entire mission completion time (Makespan) in large-scale problems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.5
• /
• pp.153-160
• /
• 2015

The effectiveness of multicores depends on how well a scheduler can assign tasks onto the cores efficiently. In a heterogeneous multicore platform, the execution time of an application depends on which core it executes on. That is to say, the effectiveness of task assignment is one of the important components for a multicore systems' performance. This work proposes a load scheduling technique that analyzes execution time of each task by profiling. The profiling result provides a basic information to predict which task-to-core mapping is likely to provide the best performance. By using such information, the proposed technique is about 26% performance gain.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4081-4098
• /
• 2022

With the aim of tackling the contradiction between computation intensive industrial applications and resource-weak Edge Devices (EDs) in Industrial Internet of Things (IIoT), a novel computation task offloading scheme in SDIN-enabled MEC based IIoT is proposed in this paper. With the aim of reducing the task accomplished latency and energy consumption of EDs, a joint optimization method is proposed for optimizing the local CPU-cycle frequency, offloading decision, and wireless and computation resources allocation jointly. Based on the optimization, the task offloading problem is formulated into a Mixed Integer Nonlinear Programming (MINLP) problem which is a large-scale NP-hard problem. In order to solve this problem in an accessible time complexity, a sub-optimal algorithm GPCOA, which is based on hybrid evolutionary computation, is proposed. Outcomes of emulation revel that the proposed method outperforms other baseline methods, and the optimization result shows that the latency-related weight is efficient for reducing the task execution delay and improving the energy efficiency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.347-352
• /
• 2004

This thesis deals with a task scheduling on a message-passing system. Scheduling and allocation are very important issues since the inappropriate scheduling of tasks cannot exploit the true potential of the system and it can offset the grain from parallelization. It is difficult to apply previous schemes to message-passing system, because previous schemes assume the shared memory system. This thesis proposes an modified priority function and processor selection technique that consider the problems caused by the difference between previous models and message-passing environments. The priority function includes the cumulative communication cost which causes task execution to be delayed. The processor selection technique avoids the situation that a child task is assigned to the same Processor allocated to its parent task that has other unscheduled child tasks. We showed by some simulations that our modified features of task scheduling algorithm can make the better scheduling results than the previous algorithms.