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)
DISCLAIMER This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor Battelle Memorial Institute, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or(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)
—Address shuffling is a type of moving target defense that prevents an attacker from reliably contacting a system by periodically remapping network addresses. Although limited testing has demonstrated it to be effective, little research has been conducted to examine the theoretical limits of address shuffling. As a result, it is difficult to understand how(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)
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 report the results of two searches made on data recorded at the CERN SPS Proton-Antiproton Collider: one for isolated large-E T electrons, the other for large-E T neutrinos using the technique of missing transverse energy. Both searches converge to the same events, which have the signature of a two-body decay of a particle of mass ~ 80 GeV/c 2. The(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)