Results 1  10
of
25
Methods for Task Allocation Via Agent Coalition Formation
, 1998
"... Task execution in multiagent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents that will perform the task. Task allocation to groups of agents is nece ..."
Abstract

Cited by 271 (21 self)
 Add to MetaCart
Task execution in multiagent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents that will perform the task. Task allocation to groups of agents is necessary when tasks cannot be performed by a single agent. However it may also be beneficial when groups perform more efficiently with respect to the single agents' performance. In this paper we present several solutions to the problem of task allocation among autonomous agents, and suggest that the agents form coalitions in order to perform tasks or improve the efficiency of their performance. We present efficient distributed algorithms with low ratio bounds and with low computational complexities. These properties are proven theoretically and supported by simulations and an implementation in an agent system. Our methods are based on both the algorithmic aspects of combinatorics and approximat...
Fairness Measures for Resource Allocation
 Proceedings of 41st IEEE Symposium on Foundations of Computer Science
, 2000
"... In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, with one coordinate representing each individual. Motivated by work in network routing and bandwidth assignment, we conside ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, with one coordinate representing each individual. Motivated by work in network routing and bandwidth assignment, we consider the problem of producing solutions that simultaneously approximate all feasible allocations in a coordinatewise sense. This is a very strong type of "global" approximation guarantee, and we explore its consequences in a range of discrete optimization problems, including facility location, scheduling, and bandwidth assignment in networks. A fundamental issue  one not encountered in the traditional design of approximation algorithms  is that good approximations in this global sense need not exist for every problem instance; there is no a priori reason why there should be an allocation that simultaneously approximates all others. As a result, the existential questions concerning such g...
Identical Parallel Machines Vs UnitTime Shops And Preemptions Vs Chains In Scheduling Complexity
 European Journal of Operational Research
, 2000
"... . This paper surveys, analyses and establishes new polynomialtime reductions among scheduling problems that connect identical parallel machines with unittime shops and the preemption facility with chainlike precedence constraints in equal machine environments. The reductions turn out to be une ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
. This paper surveys, analyses and establishes new polynomialtime reductions among scheduling problems that connect identical parallel machines with unittime shops and the preemption facility with chainlike precedence constraints in equal machine environments. The reductions turn out to be unexpectedly fruitful in clarifying the complexity status of many scheduling problems that were open before. New complexity results in the paper are devoted to identical parallel machines, ow shops and open shops. 1. Introduction Recently found mass polynomialtime reductions between scheduling problems on identical parallel machines and shop scheduling problems with nonpreemptive unit processing time operations proved to be very eective in studying their complexity. The latter problems we simply call unittime shops. Reductions of unittime shops to identical parallel machines we call parallelizings, and the inverse reductions, i.e., of identical parallel machines to unittime shops, we c...
On The LU Factorization Of Sequences Of Identically Structured Sparse Matrices Within A Distributed Memory Environment
, 1994
"... : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : xii CHAPTERS 1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.1 Topic Statement : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.2 Overview : : : : : : : : : : : : : : : : : : : : : : : : : ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : xii CHAPTERS 1 INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.1 Topic Statement : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.2 Overview : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 BACKGROUND AND RELATED EFFORTS : : : : : : : : : : : : : : 5 2.1 LU Factorization : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2 Algorithm Stability and Error Analysis : : : : : : : : : : : : : : : 6 2.3 Sparse Matrix Concepts : : : : : : : : : : : : : : : : : : : : : : : 11 2.4 Multifrontal Methods : : : : : : : : : : : : : : : : : : : : : : : : : 19 2.5 Factorization Sequences of Matrices : : : : : : : : : : : : : : : : : 24 2.6 Parallel Matrix Computations : : : : : : : : : : : : : : : : : : : : 28 2.7 Multiprocessor Scheduling : : : : : : : : : : : : : : : : : : : : : : 32 3 IMPLEMENTATION PLATFORM : : : : : : : : : : : : : : : : : : : : 37 3.1 Hardware Ar...
Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates
 Discrete Applied Mathematics
, 1993
"... This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date first algorithm pro ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date first algorithm provides an optimal nonpreemptive schedule for unitexecution time (UET) tasks, then the preemptive priority scheduling algorithm, referred to as Smallest Laxity First, provides an optimal preemptive schedule for realexecutiontime (RET) tasks. When the objective is to minimize the makespan, we get the same kind of result between Highest Level First schedules solving nonpreemptive tasks with UET and the Longest Remaining Path first schedule for the corresponding preemptive scheduling problem with RET tasks. These results are applied to four specific profile scheduling problems and new optimality results are obtained. Keywords: Preemptive Scheduling, List Schedule, Priority Schedule, Variable P...
A performance study of grid workflow engines
 In GRID ’08: Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
, 2008
"... To benefit from grids, scientists require grid workflow engines that automatically manage the execution of interrelated jobs on the grid infrastructure. So far, the workflows community has focused on scheduling algorithms and on interface tools. Thus, while several grid workflow engines have been de ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
To benefit from grids, scientists require grid workflow engines that automatically manage the execution of interrelated jobs on the grid infrastructure. So far, the workflows community has focused on scheduling algorithms and on interface tools. Thus, while several grid workflow engines have been deployed, little is known about their performancerelated characteristics, and there are no commonlyused testing practices. This situation limits the adoption of the grid workflow engines, and hampers their tuning and their further development. In this work we propose a testing methodology for grid workflow engines that focuses on five characteristics: overhead, raw performance, stability, scalability, and reliability. Using this methodology, we evaluate in a real test environment several middleware stacks that include grid workflow engines, including two based on DAGMan/Condor and on Karajan/Globus. 1
Generating and characterizing the perfect elimination orderings of a chordal graph
, 2003
"... WedevelV a constant time transposition"oraclo for the set of perfectelectdVU orderings of chordal graphs. Using thisoracl; we can generate a Gray code ofal perfectelectd;; orderings in constant amortized time using knownresul: about antimatroids. Using clngd trees, we show how theinitialdW:A: o ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
WedevelV a constant time transposition"oraclo for the set of perfectelectdVU orderings of chordal graphs. Using thisoracl; we can generate a Gray code ofal perfectelectd;; orderings in constant amortized time using knownresul: about antimatroids. Using clngd trees, we show how theinitialdW:A: of theald:::Eq can be performedinlerfo time. Weal develB two new characterizations of perfectelectd::qq orderings: one in terms ofchordlqd paths, and the other in terms uv separators.
Scheduling UET, UCT dags with release dates and deadlines
, 1995
"... The problem of scheduling precedence graphs for which every task has to be executed in a nonuniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that finds minimumlateness schedules. 1. Outforests o ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The problem of scheduling precedence graphs for which every task has to be executed in a nonuniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that finds minimumlateness schedules. 1. Outforests on two processors. 2. Seriesparallel graphs and opposing forests with the least urgent parent property (to be defined) on two processors. 3. Inforests with the least urgent parent property on m processors.
ON THE CHARACTERISTICS OF GRID WORKFLOWS
"... Abstract Grid computing promises to enable a reliable and easytouse computational infrastructure for eScience. To materialize this promise, grids need to provide full automation from the experiment design to the final result. Often, this automation relies on the execution of workflows, that is, o ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract Grid computing promises to enable a reliable and easytouse computational infrastructure for eScience. To materialize this promise, grids need to provide full automation from the experiment design to the final result. Often, this automation relies on the execution of workflows, that is, of jobs comprising many interrelated computing and data transfer tasks. While several grid workflow execution tools already exist, not much is known about their workload. This lack of knowledge hampers the development of new workflow scheduling algorithms, and slows the tuning of existing ones. To address this situation, in this work we present an analysis of two workflowbased workload traces from the Austrian Grid. We introduce a method for analyzing such traces, focused on the intrinsic and on the environmentrelated characteristics of the workflows. Then, we analyze the workflows executed in the Austrian Grid over the last two years. Finally, we identify six categories of workflows based on their intrinsic workflow characteristics. We show that the six categories exhibit distinctive environmentrelated characteristics, and identify the categories that are difficult to execute for common workflow schedulers.
Global kLevel Crossing Reduction
, 2011
"... Directed graphs are commonly drawn by a four phase framework introduced by Sugiyama et al. in 1981. The vertices are placed on parallel horizontal levels. The edge routing between consecutive levels is computed by solving onesided 2level crossing minimization problems, which are repeated in up and ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Directed graphs are commonly drawn by a four phase framework introduced by Sugiyama et al. in 1981. The vertices are placed on parallel horizontal levels. The edge routing between consecutive levels is computed by solving onesided 2level crossing minimization problems, which are repeated in up and down sweeps over all levels. Crossing minimization problems are generally N Phard. We introduce a global crossing reduction, which at any particular time considers all crossings between all levels. Our approach is based on the sifting technique. It yields an improvement of 5 – 10 % in the number of crossings over the levelbylevel onesided 2level crossing reduction heuristics. In addition, it avoids type 2 conflicts which are crossings between edges whose endpoints are dummy vertices. This helps straightening long edges spanning many levels. Finally, the global crossing reduction approach can directly be extended to cyclic, radial, and clustered level graphs achieving similar improvements. The running time is quadratic in the size of the input graph, whereas the common levelbylevel approaches are faster but operate on larger graphs with many dummy vertices for long edges. Submitted: