e management of distributed satellite systems requires the coordination of a large number of heterogeneous spacecraft. Task allocation in such a system is complicated by limited communication and individual satellite dynamics. Previous work has shown that task allocation using a market-based mechanism can provide scalable and efficient management of static networks; in this paper we extend thi...

Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed, reducing the need for communication among agents during their mission. The proposed method uses a Voronoi diagram to partition the task-space among team members and includes two phases: static and dynamic. Static dec...

A sensor network often consists of a large number of sensing devices of different types. Upon deployment in the field, these sensing devices form an ad hoc network using wireless links or cables to communicate with each other. Sensor networks are increasingly used to support emergency responders in the field usually requiring many sensing tasks to be supported at the same time. By a sensing tas...

Task allocation impacts the performance efficiency of agent teams in significant ways. Due to their efficient and proven performance, Market-based task allocation approaches have grown in popularity for many such multi-agent domains. In addition, market-based approaches are very well suited to dynamic domains such as emergency response, in which the set of the tasks or the environment changes i...

A Distributed Computing System (DCS) is a combination of application and system programs that exchanges data across a number of independent terminals connected by a communication network. Cost optimization in DCS can be achieve by optimize the performance of DCS. In task allocation two types of approaches are available and these are dynamic and static. Dynamic approach of task allocation is muc...

In this paper, a coordination method to solve task allocation problems in manufacturing system is proposed. inspired by the ability of the ants to establish the shortest route from their nests to the food source and back, researchers found out that these ants secrete a substance called ‘pheromone’ and use its trails as a medium for communicating information among each other. The pheromone-based...

In this paper, we study the problem of energy and deadline constrained static resource allocation where a collection of independent tasks (“bag-of-tasks”) is assigned to a heterogeneous computing system. Computing systems often operate in environments where task execution times vary (e.g., due to data dependent execution times), therefore we model the execution time of tasks stochastically. Thi...

For partitionable Mesh architectures, a modified QT (Quad Tree)-based processor allocation scheme (MQT) with two new task embedding heuristics is proposed. Existing processor allocation strategies assume any incoming request is also represented as a mesh. This paper introduces flexibility with which the requested task can be a linear array, a ring, or a mesh and still be allocated into a partit...

The task scheduling problem consists in defining a time sharing of system resources that can meet all logical and temporal constraints of the tasks being considered. In real-time distributed systems such a problem can be broken up in two related steps: task allocation and local task scheduling. Task allocation can be performed dynamically or statically. For tasks with predictable behavior (peri...