In this paper we propose a mathematical model for studying the phenomenon of division of labor in ant colonies. Inside this model we investigate how simple task allocation mechanisms can be used to achieve an optimal division of labor. We believe the proposed model captures the essential biological features of division of labor in ant colonies and is general enough to study a variety of differe...

Task allocation problems have traditionally focused on cost optimization. However, more and more attention is being given to cases in which cost should not always be the sole or major consideration. In this paper, we study a fair task allocation problem where an optimal allocation not only has low cost but more importantly, it is max-lexmin fair to all participants. To tackle this max-lexmin fa...

This paper makes two contributions. First, we introduce a model for evaluating the performanceof data allocation and replication algorithms in distributed databases. The model is comprehen-sive in the sense that it accounts for I/O cost, for communication cost, and, because of reliabilityconsiderations, for limits on the minimum number of copies of the object. The model captures...

Task allocation is one of the core steps to effectively exploit the capabilities of cooperative control of multiple Uninhabited Aerospace Vehicle (UAV) teams. Task allocation is an NP-complete problem. In this paper, we present a new task allocation algorithm that is based on the principles of genetic algorithm (GA). GA is a class of adaptive search algorithms derived from biological population...

An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...

A may-happen-in-parallel (MHP) analysis infers the sets of pairs of program points that may execute in parallel along a program’s execution. This is an essential piece of information to detect data races, and also to infer more complex properties of concurrent programs, e.g., deadlock freeness, termination and resource consumption analyses can greatly benefit from the MHP relations to increase ...

A single worker is assigned a stream of projects over time. We provide a tractable theoretical model in which the worker allocates her time among di↵erent projects. When the worker works on too many projects at the same time, the output rate decreases and the time it takes to complete each project grows. We call this phenomenon “task juggling,” and we argue that this phenomenon is pervasive in ...

Future platforms are envisioned in which human-machine teams are able to share and trade tasks as demands in situations change. It seems that human-machine coordination has not received the attention it deserves by past and present approaches to task allocation. In this paper a simple way to make coordination requirements explicit is proposed and for dynamic task allocation a dual-route approac...

Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not su er because of limitations on processor-to-memory bandwidth. In this work, we present a comparative study of throughput and contentio...