Synchronization and control of distributed systems and programs
Synchronization and control of distributed systems and programs
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Dagger: Combining Benefits of Synchronous and Asynchronous Communication Styles
Proceedings of the 8th International Symposium on Parallel Processing
Towards More Powerful and Flexible Synchronization Primitives
PARELEC '00 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
The Topological Barrier: A Synchronization Abstraction for Regularly-Structured Parallel Applications
Modeling Communication with Synchronized Environments
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Global asynchronous parallel program control for multicore processors
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume Part I
A parallel genetic algorithm based on global program state monitoring
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Modeling Communication with Synchronized Environments
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Hi-index | 0.00 |
Parallel programs require an interprocess synchronization. There are many synchronization paradigms, but almost all of them explicitly or implicitly use waiting. We propose another approach. Instead of waiting for a condition, a process can interrupt / abandon the current activity when the condition is met. We propose to use conditions reflecting the global application state and we give a proposal how to construct such conditions. We discuss questions concerning semantics of the pro-Posed system - how and when the conditions are evaluated and in what situations an interrupt can occur. The synchronization system allows simple and compact parallel algorithm implementations. As a practical example a parallel branch and bound algorithm with dynamic load balancing is shown. The usage of interrupts and cancellations enabled us to avoid superfluous computations, which often decrease the efficiency in parallel branch and bound programs.