Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture are variable partitioning and scheduling. However, there’s little research work that has been done on these problems. In this paper, we present a new graph model for tackling the variable partitioning problem, namely, Va...

This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to minimize the weighted completion time. Surprisingly, we show that the vertex cover graph associated to the scheduling problem is exactly the graph of incomparable pairs defined in dimension theory. This equivalence gives new insi...

In this paper, we present a novel framework of multi-rate scheduling of signal processing programs represented by regular stream ow graphs (RSFGs). The main contribution of this paper is translating the scheduling problem of RSFGs into an equivalent problem in the domain of Karp-Miller computation graphs. A distinct feature of our scheduling framework | called multi-rate software pipelining | i...

Modeling communication networks to predict performance such as delay and jitter is important for evaluating optimizing them. In recent years, neural have been used do this, which may advantages over existing models, example from queueing theory. One of these RouteNet, based on graph networks. However, it simplified assumptions. key simplification the restriction a single scheduling policy, desc...

This paper presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2 in a base graph G2, such that G ′ 2 is isomorphic to G1. The base graph G2 represents the arrangement of the processing elements of a high performance computer architecture named 2D-VLIW and G2 is the set of those proce...

We consider an extension of classic parallel machine scheduling where a set of jobs is scheduled on identical parallel machines and an undirected conflict graph is part of the input. Each node in the graph represents a job and an edge implies that its two jobs are conflicting, meaning that they cannot be scheduled on the same machine. The goal is to find an assignment of the jobs to the machine...

In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware sch...

In a large multi-hop wireless network, nodes are preferable to make distributed link-scheduling decisions with information exchange only among a small number of neighbors. However, for a slowly-decaying channel and densely-populated interfering nodes, a small size neighborhood often results in nontrivial link outages and is thus insufficient for making optimal scheduling decisions. A question a...

Efficient scheduling algorithm is required to use the grid resources properly. List scheduling heuristic algorithms are to schedule the application programs and produces sub optimal solutions. An evolutionary based scheduling algorithm will produce an optimal solution. The proposed algorithm, namely, “Grid Scheduling Strategy using GA” (GSSGA) adopts the genetic algorithm to solve the dependent...