This study focuses on the parallel resolution of the matrix chain ordering problem and the optimal convex polygon triangulation problem on the Coarse grain multicomputer model (CGM for short). There has been intensive work on the parallelization of these dynamic programming problems in PRAM, including the use of systolic arrays, but a BSP/CGM solution is necessary for ease of implementation and...

The performance of a fully parallel direct solver for large sparse symmetric positive deenite systems of linear equations is demonstrated. The solver is designed for distributed-memory, message-passing parallel computer systems. All phases of the computation, including symbolic processing as well as numeric factorization and triangular solution, are performed in parallel. A parallel Cartesian n...

In this paper we develop an inventory model, to determine the optimal ordering quantities, for a set of two substitutable deteriorating items. In this inventory model the inventory level of both items depleted due to demands and deterioration and when an item is out of stock, its demands are partially fulfilled by the other item and all unsatisfied demand is lost. Each substituted item incurs a...

We prove that the problem to get an inclusion minimal elimination ordering can be solved in linear time for planar graphs. The basic structure of the linear time algorithm is as follows. We select a vertex r as maximum and get a rst approximation of a minimal elimination ordering considering a vertex x as smaller than y if x has a larger distance than y from r. Using planarity, one can determin...

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

The compiler optimization phase ordering not only possesses challenges to compiler developer but also for multithreaded programmer to enhance the performance of Multicore systems. Many compilers have numerous optimization techniques which are applied in predetermined ordering. These ordering of optimization techniques may not always give an optimal code further it is impossible to find a unanim...

A fundamental problem with runtime monitoring of parallel programs is the intrusion introduced by instrumenting the original program. In order to minimize the amount of intrusion in monitoring parallel programs, the logical clock approach (LCA) was proposed. It uses logical clocks to time and control the ordering of communication events during monitoring, and to reeect the real execution behavi...

Row Parallel Coarse-Grained Reconfigurable Architecture (RPCGRA) has the advantages of maximum parallelism and programmable flexibility. Designing an efficient algorithm to map diverse applications onto RPCGRA is difficult due a number hardware constraints. To solve this problem, nodes data flow graph must be partitioned scheduled RPCGRA. In paper, we present Depth-First Greedy Mapping (DFGM) t...

a facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. an efficient layout contributes to the overall efficiency of operations. it’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. consequently, the efficiency of the current layout decreases or is lost and it ...

While data and workload distribution can be tailored to fit a particular problem to a particular distributed-memory architecture, it is often difficult to do so for various practical issues. This report presents our study on multithreading for distributedmemory multiprocessors. Specifically, we investigate the effects of multithreading on data distribution and workload distribution with variabl...