Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Automatic translation of FORTRAN programs to vector form
ACM Transactions on Programming Languages and Systems (TOPLAS)
Guided self-scheduling: A practical scheduling scheme for parallel supercomputers
IEEE Transactions on Computers
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Factoring: a method for scheduling parallel loops
Communications of the ACM
Algorithms in C++
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Loop parallelization algorithms: from parallelism extraction to code generation
Parallel Computing - Special issues on languages and compilers for parallel computers
Parallel programming: techniques and applications using networked workstations and parallel computers
How to build a Beowulf: a guide to the implementation and application of PC clusters
How to build a Beowulf: a guide to the implementation and application of PC clusters
Science of Computer Programming - Special issue on program comprehension (IWPC '99)
High Performance Cluster Computing: Architectures and Systems
High Performance Cluster Computing: Architectures and Systems
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers
IEEE Transactions on Parallel and Distributed Systems
Message passing without send-receive
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
Extracting the Parallelism in Program with Unstructured Control Statements
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
A package for automatic parallelization of serial C-programs for distributed systems
PMMP '95 Proceedings of the conference on Programming Models for Massively Parallel Computers
Locality and Loop Scheduling on NUMA Multiprocessors
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Beowulf cluster design for scientific PDE models
ALS '01 Proceedings of the 5th annual Linux Showcase & Conference - Volume 5
The Journal of Supercomputing
| Hi-index | 0.00 |
Computation requirements in scientific fields are getting heavier and heavier. The advent of clustering systems provides an affordable alternative to expensive conventional supercomputers. However, parallel programming is not easy for noncomputer scientists to do. We developed the Directive-Based MPI Code Generator (DMCG) that transforms C program codes from sequential form to parallel message-passing form. We also introduce a loop scheduling method for load balancing that depends on a message-passing analyzer, and is easy and straightforward to use. This approach provides a completely different view of loop parallelism from that in the literature, which relies on dependence abstractions. Experimental results show our approach can achieve efficient outcomes, and DMCG could be a general-purpose tool to help parallel programming beginners construct programs quickly and port existing sequential programs to PC Clusters.