Proceedings Article10.1109/IPPS.1996.508058
Self-timed resynchronization: a post-optimization for static multiprocessor schedules
Shuvra S. Bhattacharyya,Sundararajan Sriram,Edward A. Lee +2 more
- 15 Apr 1996
- pp 199-205
TL;DR: 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 thenumber of new synchronizations.
read more
Abstract: 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. 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Resynchronization for multiprocessor DSP systems
TL;DR: This paper introduces a technique, called resynchronization, for reducing synchronization overhead in multiprocessor implementations of digital signal processing (DSP) systems, and applies to arbitrary collections of dedicated, programmable or configurable processors, such as combinations of programmable DSP's, ASICs, and FPGA subsystems.
Latency-constrained resynchronization for multiprocessor DSP implementation
Shuvra S. Bhattacharyya,Sundararajan Sriram,Edward A. Lee +2 more
- 19 Aug 1996
TL;DR: This paper addresses the problem of computing an optimal resynchronization (one that results in the lowest average rate at which synchronization operations have to be performed) among all resynchronizations that do not increase the latency beyond a prespecified upper bound L/sub max/.
Resynchronization of Cyclo-Static Dataflow graphs
Joost P. H. M. Hausmans,Marco J. G. Bekooij,Henk Corporaal +2 more
- 14 Mar 2011
TL;DR: A Linear Programming (LP) algorithm for minimizing synchronization by means of resynchronization that is based on the properties of dataflow models is presented that is demonstrated with an extended Constant Modulus Algorithm (CMA) in a beam-forming application.
8
Resynchronization of multiprocessor schedules: part 1 — fundamental concepts and unbounded-latency analysis
Shuvra S. Bhattacharyya,Edward A. Lee +1 more
- 01 Jan 1996
TL;DR: It is shown that for a broad class of iterative dataflow graphs, optimal resynchronizations can be computed by means of an efficient polynomial-time algorithm.
Resynchronizatio n for multiprocessor dsp implementation — part 1: maximum throughput resynchronizatio n
Shuvra S. Bhattacharyya,Sundararajan Sriram,Edward A. Lee +2 more
- 01 Jan 1998
TL;DR: This paper introduces a technique, called resynchronization, for reducing synchronization overhead in multiprocessor implementations of digital signal processing (DSP) systems, and applies to arbitrary collections of dedicated, programmable or configurable processors, such as combinations of programmable DSPs, ASICS, and FPGA subsystems.
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•Book
Multirate Systems and Filter Banks
P.P. Vaidyanathan
- 01 Jul 1992
TL;DR: In this paper, a review of Discrete-Time Multi-Input Multi-Output (DIMO) and Linear Phase Perfect Reconstruction (QLP) QMF banks is presented.
5.8K
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
2.5K
Synchronous data flow
Edward A. Lee,David G. Messerschmitt +1 more
- 01 Sep 1987
TL;DR: A preliminary SDF software system for automatically generating assembly language code for DSP microcomputers is described, and two new efficiency techniques are introduced, static buffering and an extension to SDF to efficiently implement conditionals.
2K
Approximation algorithms for combinatorial problems
David S. Johnson
- 30 Apr 1973
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm.
1.6K
Related Papers (5)
Guan-Joe Lai,Cheng Chen +1 more
- 03 Jun 1996
Edward A. Lee,Soonhoi Ha +1 more
- 27 Nov 1989