检索结果-内蒙古大学图书馆

15th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC)

作者： Cai, Yang Lu, Xiaofeng Luo, Yuansheng Wang, Kezhi Chen, Dongwei Yang, Kun Xidian Univ State Key Lab Integrated Serv Networks Xian Shaanxi Peoples R China Changsha Univ Sci & Technol Sch Comp & Commun Engn Changsha Hunan Peoples R China Northumbria Univ Dept Comp & Informat Sci Newcastle Upon Tyne Tyne & Wear England Univ Elect Sci & Technol China Zhongshan Inst Zhongshan Peoples R China Univ Essex Sch Elect Engn & Comp Sci Colchester Essex England

ISBN: (纸本)9781538677476

In this paper, we study a general Near-Far Computing Enhanced C-RAN (NFC-RAN), in which users can offload the tasks to the near edge cloud (NEC) or the far edge cloud (FEC). We aim to propose a profit-aware task allocation model by maximizing the profit of the edge cloud operators. We first prove that this problem can be transformed to a Multiple-Choice Multi-Dimensional 0-1 Knapsack Problem (MMKP), which is NP-hard. Then, we solve it by using a low complexity heuristic algorithm. The simulation results show that the proposed algorithm achieves a good tradeoff between the performance and the complexity compared with the benchmark algorithm.

关键词： mobile edge computing task allocation algorithm profit maximization

来源：评论

学校读者我要写书评

暂无评论

task allocation algorithm for virtual design organisation in agile industrial design

引用

INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS 2017年第3期8卷 249-256页

作者： Yang, Gangjun Zhang, Xueliang Taiyuan Univ Sci & Technol Dept Mech Engn 66 Waliu Rd Taiyuan 030024 Shanxi Peoples R China

Agile industrial design is a kind of modern industrial design method to deal with the rapid change of market demand. From the perspective of the development trend of industrial design, virtual design organisation will be an important form of agile design organisations. task allocation of organisation members is the primary work of agile industrial design practice, and it will involve many complex factors. Innovation as the core of industrial design determines its agility. Firstly, the characteristics of industrial design in agile environment were analysed in this paper. On the basis of this study, the influencing factors of virtual organisation task allocation were discussed, and the task allocation factors for virtual organisation were summarised into five aspects, namely, difficulty of innovation, interest degree, ability of comprehensive design, emergency degree of design task, and busy degree of design work. Based on these, the paper focused on the definition of the difficulty coefficient of design exploration, and the calculation method of influencing factors and task allocation algorithm were given, and the results were verified by an example.

关键词： agile industrial design task allocation algorithm virtual design organisation

来源：评论

学校读者我要写书评

暂无评论

A Game Theory-Based Approach for Multiple UAVs Cooperative Target Defense

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2024年第4期71卷 2149-2153页

作者： Tong, Bingda Duan, Haibin Beihang Univ Sch Automat Sci & Elect Engn State Key Lab Virtual Real Technol & Syst Beijing 100083 Peoples R China

Protecting public safety and performing rescue missions by preventing uncontrolled Unmanned Aerial Vehicle (UAV) swarms from invading sensitive areas is critical. This brief investigates a system that utilizes multiple defender UAVs in tracking and intercepting multiple attacker UAVs to prevent them from entering the area. This brief defines a concise dynamics of defender and attacker UAVs, develops and analyzes strategies for both sides, and proposes a game theory-based task allocation strategy for defenders. The proposed framework aims to improve the performance of the defenders' strategy. A series of numerical simulation experiments are conducted to verify the feasibility and effectiveness of the proposed method.

关键词： Unmanned aerial vehicle cooperative game theory target defense problem pursuit-evasion game task allocation algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Complex task Scheduling algorithm in Crowdsourcing 8

Research on Complex Task Scheduling Algorithm in Crowdsourci...

引用

8th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)

作者： Fu, Minglan Li, Jiekun Chen, Lvqiang Chen, Debao Huaibei Normal Univ Sch Comp Sci & Technol Huaibei Peoples R China

ISBN: (纸本)9781665455336

The crowdsourcing reflects the new concept of "pay for work" on the internet. However, the self-interest of users and the rapid growth of user number pose new challenges to the complex task allocation in crowdsourcing. In response to these challenges, two aspects of the work have been done. First, a benefit distribution algorithm based on a new evaluation index was proposed, which can solve the problem that the task scheduling optimization algorithm will reach the nonoptimal Nash equilibrium to some extent. Second, an allocation algorithm for complex tasks was proposed based on the best response strategy and benefit distribution results to improve the stability of task allocation under the premise of ensuring a higher system revenue. This algorithm solves the problem that the existing algorithms for crowdsourcing platform does not consider the users' self-interest and right values. The simulation results verified the effectiveness of the proposed algorithms.

关键词： crowdsourcing task scheduling task allocation algorithm

来源：评论

学校读者我要写书评

暂无评论

Execution-variance-aware task allocation for energy minimization on the *** architecture

引用

SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS 2019年第Jun.期22卷 155-166页

作者： Qin, Yang Zeng, Gang Kurachi, Ryo Matsubara, Yutaka Takada, Hiroaki Nagoya Univ Grad Sch Informat Chikusa Ku Nagoya Aichi 4648603 Japan Nagoya Univ Grad Sch Engn Chikusa Ku Nagoya Aichi 4648603 Japan

With the increasing computational demands of applications, the research of energy-efficient heterogeneous multiprocessor scheduling is becoming more and more important. The problem can be addressed as allocating tasks to the right cores and setting the appropriate operating frequencies. In this paper, we present a task allocation algorithm for a single-ISA *** architecture which consists of two different types of cores: high-performance core and energy-efficient core. Based on the execution variance of two types of cores, a heuristic that approximate the optimal load distribution is proposed. We experimentally simulate our method and compare it with the state-of-the-art solutions. Experimental results show that average 20.4% less energy consumption (and up to 60.2% for some cases) can be saved from the typical Little-Core-First with satisfying the deadline constraints of all tasks. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Energy-efficient scheduling big.LITTLE architecture task allocation algorithm Execution variance Deadline constraints

来源：评论

学校读者我要写书评

暂无评论

Scate: A Scalable Time and Energy Aware Actor task allocation algorithm in Wireless Sensor and Actor Networks

引用

ETRI JOURNAL 2012年第3期34卷 330-340页

作者： Sharifi, Mohsen Okhovvat, Morteza Iran Univ Sci & Technol Distributed Syst Lab Sch Comp Engn Tehran Iran

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

关键词： Wireless sensor actor networks task allocation algorithm energy-awareness scalability max-min min-min

来源：评论

学校读者我要写书评

暂无评论

Toward a real-time and budget-aware task package allocation in spatial crowdsourcing

引用

DECISION SUPPORT SYSTEMS 2018年 110卷 107-117页

作者： Wu, Pengkun Ngai, Eric W. T. Wu, Yuanyuan Harbin Inst Technol Sch Management Harbin Heilongjiang Peoples R China Hong Kong Polytech Univ Dept Management & Mkt Hong Kong Hong Kong Peoples R China

With the development of mobile technology, spatial crowdsourcing has become a popular approach in collecting data or road information. However, as the number of spatial crowdsourcing tasks becomes increasingly large, the accurate and rapid allocation of tasks to suitable workers has become a major challenge in managing spatial outsourcing. Existing studies have explored the task allocation algorithms with the aim of guaranteeing quality information from workers. However, studies focusing on the task allocation rate when allocating tasks are still lacking despite the increasing unallocated rates of spatial crowdsourcing tasks in the real world. Although the task package is a commonly known scheme used to allocate tasks, it has not been applied to allocate spatial crowdsourcing tasks. To fill these gaps in the literature, we propose a real-time, budget-aware task package allocation for spatial crowdsourcing (RB-TPSC) with the dual objectives of improving the task allocation rate and maximizing the expected quality of results from workers under limited budgets. The proposed RB-TPSC enables spatial crowdsourcing task requester to automatically make key task allocation decisions on the following: (1) to whom should the task be allocated, (2) how much should the reward be for the task, and (3) whether and how the task is packaged with other tasks.

关键词： Spatial crowdsourcing task allocation algorithm task package Incentive mechanism Greedy algorithm Reputation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Logic Based task allocation in Ant Colonies Under Grid Computing

Fuzzy Logic Based Task Allocation in Ant Colonies Under Grid...

引用

International Conference on Electrical, Computer and Communication Engineering (ECCE)

作者： Islam, Md. Rashedul Akhtar, Md. Nasim Dhaka Univ Engn & Technol Dept Comp Sci & Engn Gazipur Bangladesh

ISBN: (纸本)9781509056279

Extensive data analysis and a huge computational power is required in every computational grid application such as distributed supercomputing, high-throughput computing etc. task allocation strategy plays a vital role in the grid environment in terms of assigning the task to the appropriate ants of the colonies within a satisfactory allocation time. The uncertainty of available supply energy for completion of a task makes the allocation policy for grid computing more challenging. In this paper, we propose a fuzzy-based method for allocating the task among the members of an ant colony under grid computing and try to minimize the time consumption of task allocation. We believed and observed, our proposed model offers an improving performance comparable with traditional approach of allocating task in full assigning or no assigning. Our proposed method, based on the task and energy available from the grid and ants respectively, chooses the distribution of a task in full, half or no task assigning to ants by using fuzzy logic. During arriving of a task, ants will perform and execute the assigned task by using first in first out method. Successful task allocation, as reaching to equilibrium state will be achieved by allocating the task with half supply energy available from the colony. We show that with the use of fuzzy logic under grid environment task allocation problem shows an enhanced efficiency for assignment of tasks among the members of an ant colony.

关键词： fuzzy logic task allocation ant colony task allocation algorithm grid middleware

来源：评论

学校读者我要写书评

暂无评论

PSO-based Optimal task allocation for Cooperative Timing Missions

引用

IFAC-PapersOnLine 2016年第17期49卷 314-319页

作者： Oh, Gyeongtaek Kim, Youdan Ahn, Jaemyung Choi, Han-Lim Department of Mechanical and Aerospace Engineering Seoul National University Seoul Korea Republic of Department of Aerospace Engineering Korea Advanced Institute of Science and Technology Daejeon Korea Republic of

An optimal task allocation algorithm based on Particle swarm optimization (PSO) is proposed for cooperative timing missions that require involvement of multiple agents. The optimal solution can be utilized in the centralized operation of multi-agent system as well as a benchmark solution of the decentralized task allocation algorithm. However, the optimal solution requires significant computations because this problem is known as NP-hard. Therefore, PSO-based approach can be an alternative because it can be used to obtain a near optimal solution with reduced computational load. In this study, the conventional PSO-based algorithm is modified by adopting graph theory. Numerical simulations are carried out to demonstrate the performance of the proposed algorithm. © 2016

关键词： Particle swarm optimization (PSO) Computation theory Graph theory Multi agent systems Optimal systems Software agents Timing circuits Centralized operations Co operative control Cooperative timing mission Multi UAV Near optimal solutions Optimal task allocations task allocation task allocation algorithm

来源：评论

学校读者我要写书评

暂无评论

An Approach of Finding Maximal Submeshes for task allocation algorithms in Mesh Structures

An Approach of Finding Maximal Submeshes for Task Allocation...

引用

6th Asian Conference on Intelligent Information and Database Systems (ACIIDS)

作者： Jarecki, Radoslaw J. Pozniak-Koszalka, Iwona Koszalka, Leszek Kasprzak, Andrzej Coventry Univ Control Theory & Applicat Ctr Coventry W Midlands England Wroclaw Univ Technol Dept System & Comp Networks Wroclaw Poland

ISBN: (纸本)9783319054766;9783319054759

This paper concerns the problem of finding efficient task allocation algorithms in mesh structures. An allocation algorithm, called Window-Based-Best-Fit with Validated-Submeshes (WBBFVS), has been created. The core of this algorithm lays in the way of finding maximal submeshes what is an important part of the task allocation algorithms based on the stack approach. The new way of finding maximal submeshes avoids post-checking submeshes' redundancy thanks to the proposed initial validation. The elimination of redundancy may increase the speed of the algorithms' performance. The three considered algorithms have been evaluated on the basis of the results of simulation experiments made using the designed and implemented experimentation system. The obtained results of investigation show that the WBBFVS algorithm seems to be very promising.

关键词： mesh structure task allocation algorithm efficiency maximal submeshes simulation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：