<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Pozzi, Laura</dc:contributor>
  <dc:creator>Ansaloni, Giovanni</dc:creator>
  <dc:date>2011-05-19</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">Coarse Grained Reconfigurable Arrays have emerged, in recent years,  as promising candidates to realize efficient reconfigurable platforms.  CGRAs feature high computational density, flexible routing interconnect  and rapid reconfiguration, characteristics that make them well-suited to  speed up execution of computational kernels. A number of designs  embodying the CGRA concept have been proposed in literature, most of  them presenting specific, ad-hoc solutions. This thesis instead takes a  more general approach, focusing on techniques that can be adapted to  arrays having different architectural features, enabling experimental  comparisons and exploration of the design space. At the hardware  level, a template virtual prototype, named Expression Grained  Reconfigurable Array, is introduced. Instances can be derived from the  template at design time, varying the architecture structure as well as the  characteristics of its different blocks. Presented design space  explorations include the search of an efficient multi-ALU structure to be  used as computational cell and exploration of heterogenous elements to  support parallel execution of whole kernels. EGRA instances are  defined at the RTL level. This feature makes it possible to simulate their  behavior employing a digital simulation environment. The thesis illustrates  a co-simulation framework to evaluate whole applications compiled for  EGRA-accelerated systems, taking into account the impact of non-kernel  code and reconfiguration overhead. Success of an architecture  paradigm strongly depends on the availability of automated strategies to  map applications onto it. The thesis tackles mapping issues at two  levels: it proposes a recursive algorithm to partition kernels according to  available hardware resources, and it presents a novel modulo  scheduling framework, which considers combinatorial chains of  computation and routing operations. The thesis touches the areas of  architectural exploration, automated kernel mapping and system  integration of CGRAs, providing a quantitative analysis of the efficiency  of proposed methods over State of the Art ones. It also outlines a  comprehensive hardware/software coexploration framewok, able to  investigate opportunities and pitfalls of coarse grained reconfiguration.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://localhost:5000/ark:/12658/srd1318222</dc:identifier>
  <dc:identifier>https://susi.usi.ch/global/documents/318222</dc:identifier>
  <dc:identifier>https://susi.usi.ch/documents/318222/files/2011INFO006.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:rero-006-110364</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/12658/srd1318222</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Reconfigurable architectures</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Coarse grained reconfigurable arrays</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Hardware/Software co-design</dc:subject>
  <dc:subject xmlns:ns4="xml" ns4:lang="en">Modulo scheduling</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns5="xml" ns5:lang="en">Architectural exploration and scheduling methods for coarse grained reconfigurable arrays</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_db06</dc:type>
</oai_dc:dc>
