| A. Pinto, L. P. Carloni, and A. V. Sangiovanni. Constraint driven communication synthesis. In In proc. of Design Automation Conference, June 2002. |
No context found.
A. Pinto, L. P. Carloni, and A. L. Sangiovanni-Vincentelli. Constraint-Driven Communication Synthesis. In Proc. of the Design Automation Conf., pages 783--788. IEEE, June 2002.
....technique is presented for distributed embedded systems with periodic tasks that have realtime deadlines. It includes processing elements selection, task allocation, process priority assignment, and worst case timing analysis. An inverse deadline priority heuristic is used for bus arbitration. In [15], a communication requirements graph is first constructed, and then an optimal implementation graph is selected using elements from a library of channels, multiplexors, and demultiplexors each with associated costs and capabilities. This work does not deal with arbitration between blocks. In ....
....resources, synthesizing protocols for the given arbitration schemes, and adding more flexible mode switching. The simulator should be modified so that it could be easily interfaced with other simulators such as [4] and system level design environments such as [3] as well as point tools such as [15, 14] to create a complete real time system design flow. 7. ACKNOWLEDGEMENTS This research was funded in part by the Semiconductor Research Corporation and the MARCO GSRC program. 8. ....
A. Pinto, L. Carloni, and A. Sangiovanni-Vincentelli. Constraint-driven communication synthesis. In Proceedings 39th Design Automation Conference, pages 783--8, 2002.
....considering all possible k way mergings for incrementing value of k. Using the result of Theorem 3.1, as soon as no k way mergings are possible for an arc a j , the corresponding column (and row) is removed from the matrix #. The algorithm leaves the main The theorem proofs can be found in [10]. a 2 14.44 102.40 105.56 104.00 8.99 8.99 a 4 197.20 195.63 100.62 100.62 Table 1: #(a i , a j ) d(a i ) d(a j ) a 2 5 103.61 98.61 104.00 201.69 201.58 a 4 5 9.05 100.00 100.63 Table 2: #(a i , a j ) p(v # ) loop, when the set of columns of # becomes empty. ....
A. Pinto, L. P. Carloni, and A. L. Sangiovanni-Vincentelli. Constraint-Driven Communication Synthesis. Technical Report available at www-cad.eecs.berkeley.edu/ lcarloni, Apr. 2002.
No context found.
A. Pinto, L. P. Carloni, and A. V. Sangiovanni. Constraint driven communication synthesis. In In proc. of Design Automation Conference, June 2002.
No context found.
A. Pinto, L. Carloni, A. L. Sangiovanni-Vincentelli "Constraint-driven communication synthesis", In Proceedings of DAC 2002
No context found.
A. Pinto, Luca Carloni, A. Sangiovanni-Vincentelli, "Constraint-Driven Communication Synthesis,"' Design Automation Conference, 2002.
No context found.
A. Pinto, L. P. Carloni, and A.Swv(p vanni-Vincentelli, "Constraintdriven communication synthesis," in Proc.Desi4 Automati) June 2002, pp. 783--788.
No context found.
A. Pinto, L. P. Carloni, and A. Sangiovanni-Vincentelli, "Constraint- driven communication synthesis," in Proc. Design Automation Conf., June 2002, pp. 783--788.
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