Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Numerical methods and software
Numerical methods and software
An introduction to parallel programming
An introduction to parallel programming
Compiling Fortran D for MIMD distributed-memory machines
Communications of the ACM
Unstructured scientific computation on scalable multiprocessors
Unstructured scientific computation on scalable multiprocessors
Active messages: a mechanism for integrated communication and computation
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Distributed memory compiler methods for irregular problems—data copy reuse and runtime partitioning
Languages, compilers and run-time environments for distributed memory machines
A methodology for programming scalable architectures
Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Efficient support of location transparency in concurrent object-oriented programming languages
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
IEEE Parallel & Distributed Technology: Systems & Technology
Compiling Global Name-Space Parallel Loops for Distributed Execution
IEEE Transactions on Parallel and Distributed Systems
Distributed Execution of Actor Programs
Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing
Actor-based parallel dataflow analysis
CC'11/ETAPS'11 Proceedings of the 20th international conference on Compiler construction: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
In this paper we present our experience in implementing several irregular problems using a high-level actor language. The problems studied require dynamic computation of object placement and may result in load imbalance as the computation proceeds, thereby requiring dynamic load balancing. The algorithms are expressed as fine-grained computations providing maximal flexibility in adapting the computation load to arbitrary parallel architectures. Such an algorithm may be composed with different partitioning and distribution strategies (PDS's) to result in different performance characteristics. The PDS's are implemented for specific data structures or algorithms and are reusable for different parallel algorithms. We demonstrate how our methodology provides portability of algorithm specification, reusability and ease of expressibility.