Studying overheads in massively parallel MIN/MAX-tree evaluation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Parallel Divide and Conquer on Meshes
IEEE Transactions on Parallel and Distributed Systems
ATLAS: an infrastructure for global computing
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
Efficient Parallel Execution of Irregular Recursive Programs
IEEE Transactions on Parallel and Distributed Systems
Satin: Efficient Parallel Divide-and-Conquer in Java
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Efficient Parallel Divide-and-Conquer for a Class of Interconnection Topologies
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Dynamic Assignment with Process Migration in Distributed Environments
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Dynamic Partitioning of the Divide-and-Conquer Scheme with Migration in PVM Environment
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Dynamic Process Partitioning and Migration for Irregular Applications
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
The APHID Parallel alpha-beta Search Algorithm
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Asynchronous parallel game-tree search
Asynchronous parallel game-tree search
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
| Hi-index | 0.00 |
This work presents implementations and tuning experiences with parallel irregular applications developed using the object oriented framework DAM-PVM/DAC. It is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-and-conquer (DAC) applications at runtime and dynamic mapping to processors taking into account their speeds and even loads by other user processes. New implementations of parallel applications tuned for shortest execution time are investigated. They include 驴脽 search, recursive Fibonacci, (kn) and finding twin prime numbers in parallel. Various DAC parameters were tuned for specific applications including costs of computing vectors/- subtrees, maximum partitioning levels etc. Moreover, the overhead of DAMPVM/DAC compared to sequential implementations is shown including previously implemented adaptive quadrature integration and image recognition.