Uintah is a computational framework for fluid-structure interaction problems using a combination of adaptive mesh refinement(AMR) and MPM particle methods. Uintah uses domain decomposition and a task graph based approach for asynchronous communication and automatic message combination . The original task scheduler for Uintah ran computational tasks in a predefined order. To improve the performa...

The performance of the multiprocessor system depends on how the tasks are scheduled in multiprocessors. If we allocate tasks wisely then we can get good performance of the system. The primary goal of task scheduling in multiprocessor system is to minimize the total execution time, so that we can achieve maximum speed-up and efficiency. The application program is represented by directed acyclic ...

This dissertation addresses the complexities involved with scheduling in the presence of conditional branches. This is a particularly important problem for processors that execute multiple operations per cycle and are not fully utilized by local scheduling techniques. Since conditional branches introduce multiple execution paths, it is diicult for a global scheduler to keep track of the various...

This study aims to increase the productivity of grid systems by an improved scheduling method. A brief overview and analysis of the main scheduling methods in grid systems are presented. A method for increasing efficiency by optimizing the task graph structure considering the grid system node structure is proposed. Task granularity (the ratio between the amount of computation and transferred da...

In contrast to standard constraint satisfaction problems (CSPs) practical applications often require both, the management of changing validity of constraints and variables. Based on experiences made with the development of a commercial nurse scheduling system this paper suggests the application of local optimization algorithms for knowledge-based connguration systems, which strongly rely on dyn...

In contrast to standard constraint satisfaction problems (CSPs) practical applications often require both, the management of changing validity of constraints and variables. Based on experiences made with the development of a commercial nurse scheduling system this paper suggests the application of local optimization algorithms for knowledge-based conngura-tion systems, which strongly rely on dy...

We consider the problem of link scheduling for throughput maximization in multihop wireless networks. Majority of previous methods are restricted to graph-based interference models. In this paper we study the link scheduling problem using a more realistic physical interference model. Through some key observations about this model, we develop efficient link scheduling algorithms by exploiting th...