A grid has to provide strong incentive for participating sites to join and stay in it. Participating sites are concerned with the performance improvement brought by the gird for the jobs of their own local user communities. Feasible and effective load sharing is key to fulfilling such a concern. This paper explores the load-sharing policies concerning feasibility and heterogeneity on computatio...

Closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However, it often happens that load can be generated from multiple sources as in large-scale data intensive problems with geographically distributed resources. This paper introduces load scheduling strategy for tree networks with two ...

The parameterized computational complexity of a collection of well-known problems including: Bandwidth, Precedence constrained k-processor scheduling, Longest Common Subsequence, DNA physical mapping (or Intervalizing colored graphs), Perfect phylogeny (or Triangulating colored graphs), Colored cutwidth, and Feasible register assignment is explored. It is shown that these problems are hard for ...

It is shown that the Precedence Constrained K-Processor Scheduling problem is W [2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(nc) time, unless an unlikely collapse occurs in the parameterized complexity hierarchy introduced by Downey and Fellows (see [5]). That is, if the problem...

This paper addresses processor design issues for multiprocessor architectures. We assert that some architectural features desirable for a uniprocessor are not as eeective in a multiprocessor. Issues aaecting processor design include granularity, degree of parallelism, cache and network eeects, and dynamic load balancing. We show that using single-instruction-issue processor with dynamic instruc...

We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the slowdown experienced by largest jobs. We consider scheduling policies that bias against large jobs, towards large jobs, and those that are fair, e.g., Processor-Sharing. We prove that as job size increases to infinity, all work conserving policies converge almost surely with...

The performance of statically scheduled VLIW processors is highly sensitive to the instruction scheduling performed by the compiler. In this work we identify a major deficiency in existing instruction scheduling for VLIW processors. Unlike most dynamically scheduled processors, a VLIW processor with no load-use hardware interlocks will completely stall upon a cache-miss of any of the operations...

In parallel and distributed computing, development of an efficient static task scheduling algorithm for directed acyclic graph (DAG) applications is an important problem. The static task scheduling problem is NP-complete in its general form. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, consisting of processors with varying processing...

Instruction scheduling is one of the most important code optimizations because of its role in increasing processor utilization. Instruction scheduling reorders instructions to minimize pipeline stalls while preserving program semantics. For realistic processor models, this problem is NP-hard, and numerous heuristic and optimal (enumerative) techniques have been proposed. Heuristics can sometime...

Contemporary multiprocessor real-time operating systems, such as VxWorks, LynxOS, QNX, and real-time variants of Linux, allow a process to have an arbitrary processor affinity, that is, a process may be pinned to an arbitrary subset of the processors in the system. Placing such a hard constraint on process migrations can help to improve cache performance of specific multi-threaded applications,...