Synchronization using counting semaphores
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Introduction to algorithms
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs Via Optimum Unfolding
IEEE Transactions on Computers
Optimizing the control-unit through the resynchronization of operations
Integration, the VLSI Journal - Special issue on high-level synthesis
Multirate systems and filter banks
Multirate systems and filter banks
Software synthesis for DSP using Ptolemy
Journal of VLSI Signal Processing Systems - Special issue on design environments for DSP
Scheduling Parallel Computations
Journal of the ACM (JACM)
Minimizing Synchronization Overhead in Statically Scheduled Multiprocessor Systems
ASAP '95 Proceedings of the IEEE International Conference on Application Specific Array Processors
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant - that is, their corresponding sequencing requirements are enforced completely by other synchronizations in the system - and can be eliminated without compromising correctness. This paper addresses the problem of adding new synchronization operations in a multiprocessor implementation in such a way that the number of original synchronizations that consequently become redundant significantly exceeds the number of new synchronizations. We refer to this approach to reducing synchronization overhead as resynchronization. In this paper we formally define the resynchronization problem, we show that optimal resynchronization is NP-hard, and we propose a family of heuristics for this problem. Finally we present a practical example where resynchronization is useful.