Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem
IEEE Transactions on Computers
Structuring parallel algorithms in an MIMD, shared memory environment
Parallel Computing
Parallel processing: the Cm* experience
Parallel processing: the Cm* experience
The suitability for master/slave concurrency of concurrent Euclid Ada and Modula
Software—Practice & Experience
Using idle workstations in a shared computing environment
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Distributed game-tree searching
Journal of Parallel and Distributed Computing
A high-level user interface management system
CHI '89 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing remote procedure calls
ACM Transactions on Computer Systems (TOCS)
The “worm” programs—early experience with a distributed computation
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Programming semantics for multiprogrammed computations
Communications of the ACM
The LOCUS distributed operating system
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
The distributed V kernel and its performance for diskless workstations
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Language concepts for distributed processing of large arrays
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic systems and their distributed termination
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
4.2bsd Networking Implementation Notes (Revised July, 1983)
4.2bsd Networking Implementation Notes (Revised July, 1983)
Dynamic Task Allocation Models for Large Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
ACM SIGOPS Operating Systems Review
Performance Models for the Processor Farm Paradigm
IEEE Transactions on Parallel and Distributed Systems
Building parallel applications using design patterns
Advances in software engineering
PVMbuilder - A Tool for Parallel Programming
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
From patterns to frameworks to parallel programs
Parallel Computing - Special issue: Advanced environments for parallel and distributed computing
Using generative design patterns to generate parallel code for a distributed memory environment
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
Views on template-based parallel programming
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Towards a new distributed programming environment (CORDS)
CASCON '91 Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Code Generation for Parallel Applications Modelled with Object-Based Graph Grammars
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A computational model and system for the generation of distributed applications in a workstation environment are presented. The well-known RPC model is modified by a novel concept known as template attachment. A computation consists of a network of sequential procedures which have been encapsulated in templates. A small selection of templates is available from which a distributed application with the desired communication behavior can be rapidly built. The system generates all the required low-level code for correct synchronization, communication, and scheduling. This results in a system that is easy to use and flexible and can provide a programmer with the desired amount of control in using idle processing power over a network of workstations. The practical feasibility of the model has been demonstrated by implementing it for Unix-based workstation environments.