| K. v. Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij. The VLSI-programming language Tangram and its translation into handshake circuits. In Proc. European Conference on Design Automation, pages 384-- 389, 1991. |
....we find several related ideas. Sutherland, in his Turing award lecture, proposed a scheme to generate local clocks for a synchronous latch based datapath. His goal was to create a design theory for asynchronous designs, which has been exploited successfully by both manual designs [1] and CAD tools [2] [4] This methodology is very efficient for dataflow type of applications but is less suitable to emulate the behavior of synchronous system by firing of local clocks in a sort of asynchronous simultaneity . In a totally different research area, Linder and Harden started from a synchronous ....
K. v. Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij, "The VLSI-programming language Tangram and its translation into handshake circuits," in Proc. European Conference on Design Automation (EDAC), 1991, pp. 384--389.
....two groups: those that use language based speci cations and those that use graph based speci cations. These two di erent groups require di erent design methods, and may generate di erent circuit implementations. The languages that are used to specify circuits include CSP [48] Occam [21] Tangram [13, 12], and VHDL [86] Language based approaches, such as those proposed by van Berkel [79] and Brunvand [22] often directly map language constructs to library blocks using syntax directed translation. The advantage of these approaches is the ability to describe large complex systems hierarchically and ....
....in Figure 5.10(c) Another example is shown 80 a b c or c a c b a b c (a) b) c) Figure 5.10. An example of a sequencing event with a con ict in its preset. a b c d [1,5] 1,3] 4,7] 2,6] a b d a b c or [1,5] 2,6] 1,5] 2,6] 1. 3] 4,7] c d # a b [2,8] [6,13] [3,9] 5,12] a) b) c) Figure 5.11. An example of a sequencing event where its postset has multiple rules but only one con ict place. in Figure 5.11(a) where there are two rules in the postset of the sequencing event, but the enabled events of these two rules are in con ict. Similarly, this ....
Berkel, K. v., Kessels, J., Roncken, M., Saeijs, R., and Schalij, F. The 121 VLSI-programming language Tangram and its translation into handshake circuits. In Proc. European Conference on Design Automation (EDAC) (1991), pp. 384-389.
....circuits are finding a niche in industrial applications that require ultra high performance, low power EM radiation, or multiple timing domains. One of the most significant reasons for the resurrection of asynchronous circuits in the 1980 s and the 90 s was the advent of automatic synthesis [1], 2] 3] 4] 5] 6] 7] which meant tedious and complex tasks, such as hazard free state assignment and logic minimization, could be carried out by computer. Parts I and II of this paper present a new design style for asynchronous control circuits, called extended burst mode, and an ....
K. van Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij, "The VLSI-programming language Tangram and its translation into handshake circuits," in Proc. European Conference on Design Automation (EDAC), 1991, pp. 384--389.
.... design modularity, exhibit average case performance rather than worst case performance and have no clock skew problem [Lav93, Hauck95] Philips Research Laboratories has developed the Tangram programming language which is supported by a set of CAD tools for the design of asynchronous VLSI circuits [Berk88, Berk91, Scha93]. Tangram describes the VLSI circuit as a set of processes which communicate along channels. The Tangram program is translated into an intermediate format called a handshake circuit representation. Handshake circuits are composed of handshake components and channels on which they communicate ....
....from the Tangram specification to a handshake circuit implementation an engineer may replace Tangram synthesised subcircuits with more efficient hand developed design solutions. Handshake circuits can be translated into delay insensitive, speed independent or boundeddelay asynchronous circuits [Berk91, Lav93, Hauck95]. In delay insensitive circuits all delays in gates and wires are allowed to be arbitrary but finite. Gate delays in speed independent circuits are arbitrary and finite but signal transmission along wires is instantaneous. 3 This assumption allows the use of the isochronic fork [Berk91] i.e. ....
[Article contains additional citation context not shown here]
Kees van Berkel, J. Kessels, M. Roncken, R. Saeijs, F. Schalij, "The VLSI programming language Tangram and its translation into handshake circuits," Proc. European DAC, 1991, pp. 384-389.
....schedule of the asynchronous resources or support bounded variable delays. There has only been limited research in the architectural level synthesis of fully asynchronous systems. Several automated asynchronous design methods exist which transform high level algorithmic descriptions down to layout [1, 4, 12]. These methods, however, do not consider design tradeo s such as resource and register sharing in an automated way. Heuristic techniques for high level synthesis of synchronous circuits have been extended to asynchronous circuits [3] A graph based algorithm for synthesis has also been ....
....of r2 is from 20 to 40 (i.e. max(40, 31) Since the lifetimes of r1 and r2 do not overlap, r1 and r2 can be shared. However, in Figure 4(b) the lifetimes of r1 and r2 overlap, so r1 and r2 cannot be shared. f f f f r2 36 10 [19, 27] 22, 31] 17, 21] 29, 36] 8, 12] 10, 15] f f r1 [1,4] 3 17 [8, 10] 12, 17] 3,7] f f f r1 [1,4] 3,7] 3 17 [8, 10] 12, 17] a) b) 15, 18] r2 40 20 [19, 27] 22, 31] 25, 28] 36, 40] 20, 24] Figure 4. Sharing using timing constraints. Case 3: Consider the example shown in Figure 5. The lifetimes of r1 and r2 overlap. According to the ....
[Article contains additional citation context not shown here]
Kees van Berkel, Joep Kessels, Marly Roncken, Ronald Saeijs, and Frits Schalij. The VLSIprogramming language Tangram and its translation into handshake circuits. In Proc. European Conference on Design Automation (EDAC), pages 384-389, 1991.
....and implement VLSI logic. A set of recently developed methods and software tools for asynchronous (control) logic design can be subdivided into two major groups. One is the so called circuit compilation approach, the most vivid example being K. van Berkel s VLSI programming using TANGRAM [12]. The latter is essentially a syntax directed translation of a process algebraic behavioural specification into an interconnection of building blocks called handshake circuits. This method produces implementations that are delay insensitive (operate independently of gate and wire delays) or ....
K. van Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij. The VLSI programming language Tangram and its translation into handshake circuits, In Proceeedings of EDAC'91 , Brussels, March 1991, pp. 384-389.
.... graphs [7] 16] change diagrams [26] asynchronous finite state machines [9] 22] 28] and state graphs [1] Some languages do exist which abstract the behavior of the design, but they use non standard languages such as communicating sequential processes (CSP) 14] Occam [5] and Tangram [4]. Each of these specification methods is also designed for a particular design style and synthesis methodology. Furthermore, none of these methods allows timed systems to be easily specified. Almost all commercial design tools for the simulation and synthesis of synchronous digital systems employ ....
....can occur. The composition of two TEL structures S 0 = hN 0 ; A 0 ; E 0 ; R 0 ; # 0 ; first 0 ; last 0 i and S 1 = hN 1 ; A 1 ; E 1 ; R 1 ; # 1 ; first 1 ; last 1 i (i.e. S 0 op S 1 where op 2 f; k; jg) is defined as follows: zx y b c [8,12] a [3,10] Conjunctive (a) c c a b [1,4] a b [2,6] AND gate (c) xy z [2,4] a b c [2,6] y # zConflict (b) Figure 3.1. Examples of TEL structures. 22 N = N 0 [ N 1 A = A 0 [ A 1 E = E 0 [ E 1 R = R 0 [ R 1 [ fhx; y:e; y:l; y:u; y:bi j x 2 last 0 y 2 first 1 op = g # = # 0 [ # 1 [ f(e; e 0 ) j (e 2 E 0 e 0 2 E ....
[Article contains additional citation context not shown here]
K. v. Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij, The VLSI-programming language Tangram and its translation into handshake circuits, in Proc. European Conference on Design Automation (EDAC), 1991, pp. 384--389.
....and allowing re use of those optimsations in later designs. This is a large scale challenge which we have hardly started to address. There is naturally a great deal of related work, much of which has proven to be very useful in helping us set our own goals. We would refer the interested reader to [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]. This is far from an exhaustive list of relevant related work, but it does give give decent coverage of the topics which we see as closely allied to our endeavours. In parallel with the work on compilation of imperative programs described in this paper, there is also significant activity in ....
Kees van Berkel, Joep Kesels, Marly Roncken, Ronald Saeijs, and Frits Schalij, `The vlsi-programming language Tangram and its translation into handshake circuits', (1991). Philips Research Laboratories, Eindhoven, submitted to EDAC 91.
....in order to find the best one and refine the specification by adding more structural details as soon as architectural and technological decisions are made. 1. 3 Mapping software into hardware One of the directions in hardware software codesign is mapping software specifications into hardware [5, 6, 7, 8], as a result a large variety of CAD tools for special purpose applications has been developed. Starting from a behavioral description of the circuit to be implemented, given in particular languages that are well suited for this task like CSP [10] or OCCAM [11] the first step that leads us toward ....
K. van Berkel, J. Kesels, M. Roncken, R. Saejis, F. Schalij, "The VLSI-programming language Tangram and its translation into handshake circuits", Proc. of EDAC 1991.
....of the compiler. Keywords: Asynchronous circuits, speed independent circuits, verification, concurrency, compilation 1. Introduction A large number of research projects have developed methods for the automatic synthesis of asynchronous circuits from high level specifications [17] 18] [28], 2] 20] These methods are a significant departure from the traditional design methodologies used in circuit development in they are automatic or semi automatic techniques for synthesizing asynchronous circuits from high level specifications. All of the above projects excepting [20] use the ....
Kees van Berkel, Joep Kessels, Marly Roncken, Ronald Saeijs, and Frits Schalij. The VLSIprogramming language Tangram and its translation into handshake circuits. In Proceedings of the European Design Automation Conference, pages 384--389, 1991.
....circuits from Signal Transition Graphs [2] initially proposed by Chu [4] to describe the behavior of asynchronous sequential machines. Other approaches synthesize asynchronous circuits from high level specifications by syntax directed translation, according to production rule sets. In [5] and [6] a similar strategy is used to translate CSP into delay insensitive circuits. We cannot consider, however, these approaches within the category of highlevel synthesis, since no attempt is done to improve the quality of the circuit (size and performance) by using optimization techniques like ....
K. van Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij, "The VLSI-programming language Tangram and its translation into handshake circuits," Proc. European Conference on design Automation, pp. 384-389, Feb. 1991.
.... in mind [18] Brown has suggested the possibility of compiling CSP or occam into asynchronous delayinsensitive circuits [5] Further work on a process algebra called Joy has produced encouraging results [27] Another working example of a silicon compiler that synthesizes asynchronous circuits is [26]. Page has developed a prototype compiler in the functional language Standard ML which converts an occam like language, somewhat more expressive than the one presented here, to a netlist [22] This has been successfully applied to the control of a robot arm, amongst other applications. After ....
C.H. van Berkel, J. Kessels, M. Roncken, R.W.J.J. Saeijs and F. Schalij, The VLSIprogramming language Tangram and its translation into handshake circuits, Proc. European Design Automation Conference, 1991.
No context found.
K. v. Berkel, J. Kessels, M. Roncken, R. Saeijs, and F. Schalij. The VLSI-programming language Tangram and its translation into handshake circuits. In Proc. European Conference on Design Automation, pages 384-- 389, 1991.
No context found.
Kees van Berkel, Joep Kessels, Marly Roncken, Ronald W.J.J. Saeijs, and Frits Schalij. The VLSI programming language Tangram and its translation into handshake circuits. In Proceedings of the European Design Automation Conference, pages 384--389, 1991. CHAPTER 8. BIBLIOGRAPHY 233
No context found.
K. van Berkel, J. Kessels, M. Roncken, R. Saejis, and F. Schalij. The VLSIprogramming language Tangram and its translation into handshake circuits. In Proceedings of the European Design Automation Conference (EDAC), pages 384--389, 1991.
No context found.
Kees van Berkel, Joep Kessels, Marly Roncken, Ronald Saeijs, and Frits Schalij. The VLSI-programming language Tangram and its translation into handshake circuits. In Proceedings of the European Design Automation Conference, pages 384--389, 1991.
No context found.
Kees van Berkel, Joep Kessels, Marly Roncken, Ronald Saeijs, and Frits Schalij. The VLSI-programming language Tangram and its translation into handshake circuits. In Proc. European Conference on Design Automation (EDAC), pages 384--389, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC