• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.62-68
• /
• 1983

We suggest a Quasi- dual graph model in consideration of dynamic module assignment and relocation to assign task optimally to two processors that have different processing abilities. An optimal module partitioning and allocation to minimize total processing cost can be achieved by applying shortest-path algorithm with time complexity 0(n2) on this graph model.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.310-328
• /
• 2022

Internet of things (IoT) has emerged as the most popular technique that facilitates enhancing humans' quality of life. However, most time sensitive IoT applications require quick response time. So, processing these IoT applications in cloud servers may not be effective. Therefore, fog computing has emerged as a promising solution that addresses the problem of managing large data bandwidth requirements of devices and quick response time. This technology has resulted in processing a large amount of data near the data source compared to the cloud. However, efficient management of computing resources involving balancing workload, allocating resources, provisioning resources, and scheduling tasks is one primary consideration for effective computing-based solutions, specifically for time-sensitive applications. This paper provides a comprehensive review of the source management strategies considering resource limitations, heterogeneity, unpredicted traffic in the fog computing environment. It presents recent developments in the resource management field of the fog computing environment. It also presents significant management issues such as resource allocation, resource provisioning, resource scheduling, task offloading, etc. Related studies are compared indifferent mentions to provide promising directions of future research by fellow researchers in the field.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.502-504
• /
• 2000

최근 높은 컴퓨팅 파워를 요구하는 응용문제 처리를 위해 고 비용의 슈퍼컴퓨터 대신 인터넷상에 분산된 다수의 일반 컴퓨터들을 이용하는 병렬처리에 관한 연구가 진행되고 있다. 본 연구에서는 다중 에이전트 시스템을 기반으로 하여 이질적인 성능을 갖는 컴퓨터들을 병렬 컴퓨팅 환경으로 구성하고 각 호스트의 성능측정 결과에 따라 효율적으로 작업을 분산하는 기법을 제안한다. 또한 본 연구에서 제안한 방법을 다중 에이전트 시스템인 IBM의 AgletsTM을 사용하여 실험적으로 성능을 평가하고, 기존 연구와 비교한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.595-597
• /
• 2003

유럽지역에서의 현재 및 차세대 이동통신의 규격화를 추진하고 있는 3GPP(3$^{rd}$ generation partnership project)의 경우, 부족한 단말의 주소 및 네트워킹의 향상성을 위해 적극적으로 IPv6의 도입을 추진하고 있는 상황이다. 한편 IPv6 자체의 규격은 IETF(Internet Engineering Task Force)에서 진행하고 있는데, 현재 상황의 경우 3GPP에서 IPv6할당의 규격은 IETF의 규격과 완전호환이 되어 있지않아 IETF가 권고안을 마련한 상태이다. 본 논문은 이러한 상태에서 IETF의 권고안을 만족하는 3GPP네트워크에서의 IPv6주소 할당 방식을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.631-633
• /
• 2003

인터넷 가반 분산/병렬 처리 프레임 워크 PDP(Parallel/Distributed Processing Scheme on Web)는 네트워크 내 유휴 상태 호스트들을 활용하여 대용량 작업을 병렬로 처리한다. 본 논문에서는 이러한 서브 작업을 할당받는 자원이 동작하는 네트워크 환경을 모니터링 함으로써 수시로 변화하는 네트워크 환경에 대처하는 방안을 제시한다. 특히 네트워크 환경 모니터링 예측 결과를 PDP의 작업 할당 알고리즘에 적용하여 네트워크 과부하 및 결함 등으로 인해 발생되는 작업 지연 요소에 적응적 대처함으로써 전체 작업 수행 처리율 향상을 도모하는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.634-636
• /
• 2004

실시간 운영체제는 멀티태스킹 및 ITC(Inter Task Communication)를 제공한다는 면에서는 범용운영체제와 비슷하나, 시간 결정성을 보장해야 한다는 면에서는 일반 운영체제와 다르다. 실시간 시스템에서는 메모리를 할당하는데 있어서 시간 제약을 어기지 않아야 하기 때문에 동적 메모리 할당은 효율적으로 구성되어야 한다. 본 논문에서는 실시간 운영체제 $_{1}$RTOS$^{TM}$에서 메모리 할당에 소요되는 시간을 향상시키기 위해 최대 힙 알고리즘을 적용한 메모리 할당 기법을 설계 및 구현하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.120-132
• /
• 2008

Networks-on-Chip (NoC) is emerging as a practical development platform for future systems-on-chip products. We propose an energy-efficient static algorithm which optimizes the energy consumption of task communications in NoCs with voltage scalable links. In order to find optimal link speeds, the proposed algorithm (based on a genetic formulation) globally explores the design space of NoC-based systems, including network topology, task assignment, tile mapping, routing path allocation, task scheduling and link speed assignment. Experimental results show that the proposed design technique can reduce energy consumption by 28% on average compared with existing techniques.

• The Journal of the Korean dental association
• /
• v.48 no.10
• /
• pp.738-753
• /
• 2010

Objectives: To deter job migration and to facilitate a more efficient personnel management system, a personality type analysis tool, such as MBTI and Enneagram, may be considered. These tools can facilitate better recognition of talent among prospective employees, as well as more efficient allocation of tasks for greater job satisfaction. Methods: This study conducted direct interviews with dental hygienists currently employed at two major dental organizations, which operate the largest networks of clinics across the greater metropolitan area. Results : First, in terms of number of turnover experiences, the Head Type showed lower task satisfaction, whereas the Body Type exhibited greater task satisfaction. Second, the Head Type showed greater job satisfaction compared to the other types. Third, the SJ Type, often considered the traditionalist in terms of long-term employments, exhibited greater tendencies toward long-term commitment with one employer. Fourth, dental hygienists, in terms of long-term employment, are negatively affected by task satisfaction, and positively affected by job satisfaction. Conclusions: It is thought to be considerable to use personality type analysis tools in clinical human resource management.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.304-310
• /
• 2021

The paper presents problems of optimization of the synthesis of embedded systems, in particular Pareto optimization. The model of such a system for its design for high-level of abstract is based on the classic approach known from the theory of task scheduling, but it is significantly extended, among others, by the characteristics of tasks and resources as well as additional criteria of optimal system in scope structure and operation. The metaheuristic algorithm operating according to this model introduces a new approach to system synthesis, in which parallelism of task scheduling and resources partition is applied. An algorithm based on a genetic approach with simulated annealing and Boltzmann tournaments, avoids local minima and generates optimized solutions. Such a synthesis is based on the implementation of task scheduling, resources identification and partition, allocation of tasks and resources and ultimately on the optimization of the designed system in accordance with the optimization criteria regarding cost of implementation, execution speed of processes and energy consumption by the system during operation. This paper presents examples and results for multi-criteria optimization, based on calculations for specifying non-dominated solutions and indicating a subset of Pareto solutions in the space of all solutions.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.69-88
• /
• 2000

One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.