#### Filter Results:

#### Publication Year

2005

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling problem and was studied extensively in recent years resulting in a cohesive theory called Divisible Load Theory (DLT). In this paper we augment the existing di-visible load theory… (More)

We design an incentive-compatible mechanism for scheduling n non-malleable parallel jobs on a parallel system comprising m identical processors. Each job is owned by a selfish user who is rational: she performs actions that maximize her welfare even though doing so may cause system-wide suboptimal performance. Each job is characterized by four parameters:… (More)

The underlying assumption of Divisible Load Scheduling is that the processors composing the network are obedient, i.e., they do not " cheat " the algorithm. This assumption is unrealistic if the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and they will manipulate the algorithm if it is… (More)

—We perform a game theoretic investigation of the effects of deception on the interactions between an attacker and a defender of a computer network. The defender can employ camouflage by either disguising a normal system as a honeypot, or by disguising a honeypot as a normal system. We model the interactions between defender and attacker using a signaling… (More)

SUMMARY Applications require the composition of resources to execute in a grid computing environment. The Grid Service Providers (GSPs), the owners of the computational resources, must form Virtual Organizations (VOs) to be able to provide the composite resource. We consider grids as self-organizing systems composed of autonomous, self-interested GSPs that… (More)

—The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world this assumption is unrealistic as the processors are owned and operated by autonomous, rational organizations that have no a priori motivation for… (More)

In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outcome is computed by the agents themselves. We propose a distributed mechanism for solving the problem of scheduling on unrelated machines. This mechanism, called Distributed MinWork… (More)

Divisible Load Theory (DLT) considers the scheduling of arbitrarily partitionable loads in distributed systems. The underlying assumption of DLT is that the processors are obedient (i.e., they do not " cheat " the protocol), which is unrealistic when the processors are owned by autonomous, self-interested organizations that have no a priori motivation for… (More)

In this paper we formulate and study a new scheduling problem called Selfish MultiUser Task Scheduling. This problem assumes that there are several users, each of them having multiple tasks that need processing on a set of parallel identical machines. Each user is selfish and her goal is to minimize the makespan of her own tasks. We model this problem as a… (More)