<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article  PUBLIC '-//OASIS//DTD DocBook XML V4.4//EN'  'http://www.docbook.org/xml/4.4/docbookx.dtd'><article><articleinfo><title>Doc</title><revhistory><revision><revnumber>11</revnumber><date>2009-09-17 09:20:15</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>10</revnumber><date>2009-09-17 09:16:37</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>9</revnumber><date>2009-06-25 16:50:10</date><authorinitials>94.142.235.132</authorinitials></revision><revision><revnumber>8</revnumber><date>2009-04-24 18:02:11</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>7</revnumber><date>2009-04-24 17:32:48</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>6</revnumber><date>2009-04-24 17:31:45</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>5</revnumber><date>2009-04-24 17:31:35</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>4</revnumber><date>2009-04-24 17:30:34</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>3</revnumber><date>2009-04-24 17:29:58</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>2</revnumber><date>2009-04-24 17:29:20</date><authorinitials>elfe.enst.fr</authorinitials></revision><revision><revnumber>1</revnumber><date>2009-04-24 17:19:44</date><authorinitials>elfe.enst.fr</authorinitials></revision></revhistory></articleinfo><section><title>DOCUMENTATION</title><para>Thèse de Zied Marrakchi sur les FPGAs en arbre : &quot;EXPLORATION AND OPTIMIZATION OF TREE-BASED FPGA ARCHITECTURES&quot; : <ulink url="https://sefpga.telecom-paristech.fr/Doc/Doc?action=AttachFile&amp;do=get&amp;target=Phd_Zied.pdf">Phd_Zied.pdf</ulink> </para><para>Poster présenté à la 3ème convention du pôle System@tic : <ulink url="https://sefpga.telecom-paristech.fr/Doc/Doc?action=AttachFile&amp;do=get&amp;target=SEFPGA.pdf">SEFPGA.pdf</ulink> </para><section><title>Bibliographie</title><para>- Routing architectures for hierarchical field programmable gate arrays.  A.Agarwal and Lewis D.  In Proceedings 1994 IEEE International Conference on Computer Design, pages 475–478. </para><para>- Balancing Interconnect and Computation in a Reconfigurable Computing Array (or, why you don’t reallywant 100%LUT utilization). A.<ulink url="https://sefpga.telecom-paristech.fr/Doc/DeHon#">DeHon</ulink>   Proceedings 1999 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, Montery, CA. </para><para>- Compact Multilayer Layout for Butterfly Fat-Tree. A.<ulink url="https://sefpga.telecom-paristech.fr/Doc/DeHon#">DeHon</ulink>.  ACM Symposium on Parallel Algorithms and Architectures, pages 206–215. Bar Harbor, Maine, USA.2000. </para><itemizedlist><listitem override="none"><para>- Rent’s Rule Based Switching Requirements.  </para></listitem></itemizedlist><para>A.<ulink url="https://sefpga.telecom-paristech.fr/Doc/DeHon#">DeHon</ulink>.  System Level Interconnect Prediction Workshop(SLIP). CA, 2001. </para><para>- Unifing Mesh and Tree-Based Programmable Interconnect. A.<ulink url="https://sefpga.telecom-paristech.fr/Doc/DeHon#">DeHon</ulink>   IEEE Transactions on VLSI Systems, (12):10, 2004 </para><para>- Fat-trees: Universal networks for hardware efficient C.Leiserson  supercomputing. IEEE Transactions on Computers, C-34(10):892–901, 1985. </para><para>- HSRA: High Speed, Hierarchical Synchronous Reconfigurable Array William Tsu, Kip Macy, Atul Joshi, Ramy Huang, Norman Walker, Tony Tung, Omid Rowhani, Varghese George, John Wawrzynek, Andre <ulink url="https://sefpga.telecom-paristech.fr/Doc/DeHon#">DeHon</ulink>.  Proceedings of the International Symposium on Field Programmable Gate Arrays, 20(1469-1479):125–134. 1999. </para><para>- Hierarchical Interconnection Structures for Field Programmable Gate Arrays.  Y.Lay and P.Wang  IEEE Transactions on VLSI Systems,5(2):186–196. 1997 </para></section></section></article>