The assignment of computations to processors is a crucial factor determining the
effectiveness of a parallel algorithm. The portability of parallel programs has involved lot of …

Following Karp's discrete Dynamic Programming (DP) approach, this work extends the
sequential model for monadic DP to the parallel case. We propose general parallel DP …

The constant increase in parallelism available on large-scale distributed computers poses
major scalability challenges to many scientific applications. A common strategy to improve …

Emergence of chip multiprocessor systems has dramatically increased the performance
potential of computer systems. Since the amount of exploited parallelism is directly …

Three new optimal parallel algorithms are presented for the single resource allocation
problem. They run in the simplest networks: pipelines and rings. All of them have been …

Dynamic programming is an important paradigm that has been widely used to solve
problems in various areas such as control theory, operation research, biology and computer …

The InteGrade middleware intends to exploit the idle time of computing resources in
computer laboratories. In this work we investigate the performance of running parallel …

We extend the sequential model for dynamic programming to a parallel model. We propose
three general parallel dynamic programming algorithms for pipeline and ring networks for …

Building software that can effectively utilize underlying hardware resources has been a
perennial challenge for the high-performance computing community. In recent years, the …

The emergence of chip-multiprocessor systems has dramatically increased the performance
potential of computer systems. However, harnessing the full potential of these systems …