• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.140.3-140
• /
• 2001

This paper analyzes a blocking that is due to shared resource in multiprocessor system. A proposed analysis for shared resource suggests a scalable and amendable scheduling method about task allocation. An equation of shared resource blocking is proposed by a throughput at common bus and a ratio of throughput during time period, it is included a parameter of tasks scheduling. Using this equation, a new guideline for task allocation of multiprocessor is presented. Finally, in proposed system a model simulations for the proposed blocking model is given by a deterministic ratio of shared resource.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권3호
• /
• pp.794-815
• /
• 2023

The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

• 대한인간공학회지
• /
• 제23권1호
• /
• pp.49-63
• /
• 2004

In this study. differences in attention allocation patterns between expert and novIce pilots were investigated by a verbal protocol when pilots were engaged in a task during the instrument flight. Ten pilots including experts and novices were participated to conduct a pre-determined task(a fix-to-fix) on F-5E Cockpit Procedure Trainer Simulator. Experts show better performance as expected with more stable variations in speed. altitude. and attitude. In attention allocation patterns. novices allocated about 83% of attentional resources on the primary instruments (airspeed indicator. altitude indicator. and attitude) relating to the task of the basic flight while experts spent 57%. This difference in the availability of attentional resources allowed expert pilots to accomplish the task better than novices. In other words. training a pilot should consider a program for building up wider instrument scanning patterns to become an expert in a shorter time.

• 한국군사과학기술학회지
• /
• 제17권2호
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2021년도 추계학술발표대회
• /
• pp.128-130
• /
• 2021

Smart cities collect data from thousands of IoT-based sensor devices for intelligent application-based services. Centralized cloud servers support application tasks with higher computation resources but introduce network latency. Fog layer-based data centers bring data processing at the edge, but fewer available computation resources and poor task allocation strategy prevent real-time data analysis. In this paper, tasks generated from devices are distributed as high resource and low resource intensity tasks. The novelty of this research lies in deploying a virtual node assigned to each cluster of IoT sensor machines serving a joint application. The node allocates tasks based on the task intensity to either cloud-computing or fog computing resources. The proposed Task Allocation Strategy provides seamless allocation of jobs based on process requirements.

• 감성과학
• /
• 제23권4호
• /
• pp.3-20
• /
• 2020

본 연구의 목적은 노화에 따라 나타나는 시공간 주의배분능력과 정서지각 편향성의 변화에 대해 탐구하는 것이다. 본 연구에서는 시공간 주의배분능력을 측정하기 위해 useful field of view (UFOV) 과제와 정서지각 편향성을 측정하기 위해 정서지각과제(emotional perception task)를 사용하였다. 본 연구에는 노인 집단의 23명과 청년 집단의 25명의 총 48명의 실험참가자가 참여하였다. 실험 결과, UFOV 과제에서는 노인 집단이 청년 집단에 비해 느린 반응속도와 낮은 정답률을 보여 노인 집단이 청년 집단보다 저하된 시공간 주의배분능력을 가지고 있다는 것을 나타냈다. 또한, 정서지각과제에서는 노인 집단이 청년 집단에 비해 긍정적 정서지각 편향성과 부정적 정서지각 편향성 모두 크게 나타났다. 상관분석 결과에서는 정서지각과제의 정답률에 대한 부정적 정서지각 편향성이 UFOV 과제의 시야각 30° 조건의 반응속도와 유의미한 정적 상관관계가 나타났다(r=.289). 또한, 정서지각과제의 정답률에 대한 긍정적 정서지각 편향성은 UFOV 과제의 모든 시야각 조건들의 정답률과 유의미한 정적 상관관계가 나타났으며(r=.305, r=.322, r=.299), 반응속도와 유의미한 부적 상관관계가 나타났다(r=-.345, r=-.295, r=-.308). 이러한 결과는 노화가 저하된 시공간 주의배분능력 그리고 긍정적 정서지각 편향성과 부정적 정서지각 편향성의 증가와 관련있다는 것을 의미하고, 노화에 따라 나타나는 긍정적 및 부정적 정서지각 편향성은 저하된 시공간 주의배분능력과 관련성이 있는 것으로 여겨진다.

• 한국게임학회 논문지
• /
• 제7권4호
• /
• pp.93-104
• /
• 2007

게임과 같은 실시간이며 복잡한 다중 에이전트 환경에서는 시스템의 효율성을 극대화하기 위해 반복적으로 작업 할당이 수행된다. 본 논문에서는 실시간 다중 에이전트 구조에 적합하며 최적화된 작업 할당이 가능한 방안으로 $A^*$ 알고리즘을 적용한 조정 에이전트를 제안한다. 제안하는 조정 에이전트는 수행 가능한 에이전트와 할당 가능한 작업으로 정제된 모든 에이전트와 작업의 조합으로 상태 그래프를 생성하고, $A^*$ 알고리즘을 이용한 평가함수를 적용하여 최적화된 작업 할당을 수행한다. 또한 실시간 재 할당에 따른 지연을 방지하기 위해 그리디 방식을 선택적으로 사용함으로써 재할당 요구에 대한 빠른 처리가 가능하다. 마지막으로 모의실험을 통해 조정 에이전트를 통한 최적화된 작업 할당 결과가 그리디 방식의 작업 할당보다 성능이 25%향상되었음을 입증한다.

• 항공우주시스템공학회지
• /
• 제17권2호
• /
• pp.78-85
• /
• 2023

다수 무인기 체계에서 임무할당은 임무 수행 능력을 결정하는 중요한 요인이다. 본 논문은 유전 알고리즘에 기반한 임무계획기법을 제안한다. 본 기법을 통해 제한 조건을 만족하면서, 임무 완료 시간을 최소화하는 해를 구할 수 있다. 임무 할당 문제의 최적해를 구하기 위해서는 계산량이 많이 필요하므로 본 기법이 해를 구하는 대안이 될 수 있다. 본 기법은 현실 세계의 다양한 종류의 무인기, 임무, 제한 조건을 고려하였다. 제안된 기법은 각 무인기의 임무 시퀀스와 제한 조건 만족을 위한 임무 별 대기 시간을 도출한다. 다양한 수치적 시뮬레이션 결과를 통해 임무 종료 시간을 최소화하는 임무계획 기법의 성능을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권1호
• /
• pp.211-232
• /
• 2024

In this paper, we consider the resource allocation and offloading decisions of device-to-device (D2D) cooperative UAV-assisted mobile edge computing (MEC) system, where the device with task request is served by unmanned aerial vehicle (UAV) equipped with MEC server and D2D device with idle resources. On the one hand, to ensure the fairness of time-delay sensitive devices, when UAV computing resources are relatively sufficient, an optimization model is established to minimize the maximum delay of device computing tasks. The original non-convex objective problem is decomposed into two subproblems, and the suboptimal solution of the optimization problem is obtained by alternate iteration of two subproblems. On the other hand, when the device only needs to complete the task within a tolerable delay, we consider the offloading priorities of task to minimize UAV computing resources. Then we build the model of joint offloading decision and power allocation optimization. Through theoretical analysis based on KKT conditions, we elicit the relationship between the amount of computing task data and the optimal resource allocation. The simulation results show that the D2D cooperation scheme proposed in this paper is effective in reducing the completion delay of computing tasks and saving UAV computing resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4372-4388
• /
• 2014

Robotic sensor network (RSN) contains mobile sensors and robots providing feasible solution for many multi-agent applications. One of the most critical issues in RSN and its application is how to effectively assign tasks. This paper presents a novel connectivity preserving hybrid task allocation strategy to answer the question particularly for RSN. Firstly, we model the task allocation in RSN to distinguish the discovering and allocating processes. Secondly, a fully distributed simple Task-oriented Unoccupied Neighbor Algorithm, named TUNA, is developed to allocate tasks with only partial view of the network topology. A connectivity controller is finally developed and integrated into the strategy to guarantee the global connectivity of entire RSN, which is critical to most RSN applications. The correctness, efficiency and scalability of TUNA are proved with both theoretical analysis and experimental simulations. The evaluation results show that TUNA can effectively assign tasks to mobile robots with the requirements of only a few messages and small movements of mobile agents.