In this paper a novel scheduling model based on resource contention called the interference paradigm is presented. Using this paradigm, a range of scheduling policy options can be expressed. A simulation study of several interference-based scheduling policies in a NOW environment suggests that this approach can produce reduced completion time and high job throughput for a sequential and paralle...

We obtain several sufficient conditions on the degrees of an oriented graph for the existence of long paths and cycles. As corollaries of our results we deduce that a regular tournament contains an edge-disjoint Hamilton cycle and path, and that a regular bipartite tournament is hamiltonian. An orientedgraph is a directed simple graph, that is to say, a digraph without loops, mutiple arcs, or c...