<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Community:</title>
    <link>http://hdl.handle.net/2117/3111</link>
    <description />
    <pubDate>Tue, 18 Jun 2013 20:42:25 GMT</pubDate>
    <dc:date>2013-06-18T20:42:25Z</dc:date>
    <itunes:owner>
      <itunes:email>webmaster.bupc@upc.edu</itunes:email>
      <itunes:name>Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació</itunes:name>
    </itunes:owner>
    <itunes:explicit>no</itunes:explicit>
    <itunes:keywords />
    <item>
      <title>Evaluación formativa usando exámenes no presenciales</title>
      <link>http://hdl.handle.net/2117/19516</link>
      <description>Title: Evaluación formativa usando exámenes no presenciales
Authors: López Álvarez, David; Sánchez Carracedo, Fermín; Cruz Díaz, Josep Llorenç; Fernández Jiménez, Agustín
Abstract: Los exámenes tradicionales están orientados a la evaluación sumativa, no a la formativa, y provocan un aprendizaje superficial, más que un aprendizaje profundo. Su objetivo es evaluar, no facilitar el aprendizaje. Los estudiantes perciben que su futuro a corto plazo depende de su nota en un examen, por lo que orientan su estudio a aprobar dicho examen. En este artículo se exponen las ventajas e inconvenientes de realizar&#xD;
un examen no presencial, con evaluación sumativa y formativa, que los estudiantes realizan fuera de clase a lo largo de un periodo de tiempo mucho más largo que el de un examen tradicional, lo que les ayuda a conseguir un aprendizaje profundo.&#xD;
&#xD;
Traditional exams are focused on the summative assessment, not on the formative one. Its aim is to evaluate, not to facilitate learning, so it results in&#xD;
superficial learning rather than deep learning. Thus, students perceive that their short-term future depends on their note in the exam, so their study is guided to pass the examination. In this paper we propose a take-home exam in which students have more time to solve the questions and are not&#xD;
restricted by the sources they can consult, thereby providing a highly educational task in which students experience a deep learning process.</description>
      <pubDate>Wed, 05 Jun 2013 09:50:29 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19516</guid>
      <dc:date>2013-06-05T09:50:29Z</dc:date>
      <itunes:author>López Álvarez, David; Sánchez Carracedo, Fermín; Cruz Díaz, Josep Llorenç; Fernández Jiménez, Agustín</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Modelos de evaluación, Evaluación formativa, Evaluación sumativa, Evaluación de competencias, Modelos de aprendizaje</itunes:keywords>
      <itunes:summary>Los exámenes tradicionales están orientados a la evaluación sumativa, no a la formativa, y provocan un aprendizaje superficial, más que un aprendizaje profundo. Su objetivo es evaluar, no facilitar el aprendizaje. Los estudiantes perciben que su futuro a corto plazo depende de su nota en un examen, por lo que orientan su estudio a aprobar dicho examen. En este artículo se exponen las ventajas e inconvenientes de realizar&#xD;
un examen no presencial, con evaluación sumativa y formativa, que los estudiantes realizan fuera de clase a lo largo de un periodo de tiempo mucho más largo que el de un examen tradicional, lo que les ayuda a conseguir un aprendizaje profundo.&#xD;
&#xD;
Traditional exams are focused on the summative assessment, not on the formative one. Its aim is to evaluate, not to facilitate learning, so it results in&#xD;
superficial learning rather than deep learning. Thus, students perceive that their short-term future depends on their note in the exam, so their study is guided to pass the examination. In this paper we propose a take-home exam in which students have more time to solve the questions and are not&#xD;
restricted by the sources they can consult, thereby providing a highly educational task in which students experience a deep learning process.</itunes:summary>
    </item>
    <item>
      <title>Improving the resilience of an IDS against performance throttling attacks</title>
      <link>http://hdl.handle.net/2117/19515</link>
      <description>Title: Improving the resilience of an IDS against performance throttling attacks
Authors: Sreekar Shenoy, Govind; Tubella Murgadas, Jordi; González Colás, Antonio María
Abstract: Intrusion Detection Systems (IDS) have emerged as one of the most promising ways to secure systems in the network. To be effective against evasion attempts, the IDS must provide tight bounds on performance. Otherwise an adversary can bypass the IDS by carefully crafting and sending packets that throttle it. This can render the IDS ineffective, thus resulting in the network becoming vulnerable. We present a performance throttling attack mounted against the computationally intensive string matching algorithm. This algorithm performs string matching by traversing a finite-state-machine (FSM). We observe that there are some input bytes that sequentially traverse a chain of 30 pointers. This chain of traversal drastically degrades performance,&#xD;
and we observe a 22X performance drop in comparison to the average case performance. We investigate hardware and software mechanisms to counter this performance degradation. The software mechanism is targeted for commodity general purpose CPUs. While the hardware-based mechanism uses a parallel traversal suitable for network processor architectures. Our results show that our proposed mechanisms significantly&#xD;
improves (by over 3X magnitude) string matching algorithm’s worst performing cases.</description>
      <pubDate>Wed, 05 Jun 2013 09:31:15 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19515</guid>
      <dc:date>2013-06-05T09:31:15Z</dc:date>
      <itunes:author>Sreekar Shenoy, Govind; Tubella Murgadas, Jordi; González Colás, Antonio María</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>Intrusion Detection Systems (IDS) have emerged as one of the most promising ways to secure systems in the network. To be effective against evasion attempts, the IDS must provide tight bounds on performance. Otherwise an adversary can bypass the IDS by carefully crafting and sending packets that throttle it. This can render the IDS ineffective, thus resulting in the network becoming vulnerable. We present a performance throttling attack mounted against the computationally intensive string matching algorithm. This algorithm performs string matching by traversing a finite-state-machine (FSM). We observe that there are some input bytes that sequentially traverse a chain of 30 pointers. This chain of traversal drastically degrades performance,&#xD;
and we observe a 22X performance drop in comparison to the average case performance. We investigate hardware and software mechanisms to counter this performance degradation. The software mechanism is targeted for commodity general purpose CPUs. While the hardware-based mechanism uses a parallel traversal suitable for network processor architectures. Our results show that our proposed mechanisms significantly&#xD;
improves (by over 3X magnitude) string matching algorithm’s worst performing cases.</itunes:summary>
    </item>
    <item>
      <title>Exámenes no presenciales</title>
      <link>http://hdl.handle.net/2117/19454</link>
      <description>Title: Exámenes no presenciales
Authors: López Álvarez, David; Sánchez Carracedo, Fermín; Cruz Díaz, Josep Llorenç; Fernández Jiménez, Agustín
Abstract: Los exámenes tradicionales están orientados a la evaluación sumativa, no a la formativa. Su objetivo es evaluar, no facilitar el aprendizaje, y debido a ello provocan un aprendizaje superficial más que un aprendizaje profundo: los estudiantes perciben que su futuro a corto plazo depende de su nota en un examen, por lo que orientan su estudio a aprobar dicho examen. En este&#xD;
artículo se propone una alternativa: un examen no presencial que realiza tanto evaluación sumativa como formativa. Es un tipo de examen que los estudiantes realizan fuera de clase a lo largo de un periodo de tiempo mucho más largo que el de un examen&#xD;
tradicional, lo que les ayuda a conseguir un aprendizaje profundo. En el artículo se presentan los resultados de una experiencia&#xD;
de 11 semestres utilizando este tipo de exámenes en una asignatura de la Facultat d’Informàtica de Barcelona.</description>
      <pubDate>Thu, 30 May 2013 09:41:44 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19454</guid>
      <dc:date>2013-05-30T09:41:44Z</dc:date>
      <itunes:author>López Álvarez, David; Sánchez Carracedo, Fermín; Cruz Díaz, Josep Llorenç; Fernández Jiménez, Agustín</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Modelos de evaluación, Evaluación formativa, Evaluación sumativa, Evaluación de competencias, Modelos de aprendizaje</itunes:keywords>
      <itunes:summary>Los exámenes tradicionales están orientados a la evaluación sumativa, no a la formativa. Su objetivo es evaluar, no facilitar el aprendizaje, y debido a ello provocan un aprendizaje superficial más que un aprendizaje profundo: los estudiantes perciben que su futuro a corto plazo depende de su nota en un examen, por lo que orientan su estudio a aprobar dicho examen. En este&#xD;
artículo se propone una alternativa: un examen no presencial que realiza tanto evaluación sumativa como formativa. Es un tipo de examen que los estudiantes realizan fuera de clase a lo largo de un periodo de tiempo mucho más largo que el de un examen&#xD;
tradicional, lo que les ayuda a conseguir un aprendizaje profundo. En el artículo se presentan los resultados de una experiencia&#xD;
de 11 semestres utilizando este tipo de exámenes en una asignatura de la Facultat d’Informàtica de Barcelona.</itunes:summary>
    </item>
    <item>
      <title>Improving the performance efficiency of an IDS by exploiting temporal locality in network traffic</title>
      <link>http://hdl.handle.net/2117/19428</link>
      <description>Title: Improving the performance efficiency of an IDS by exploiting temporal locality in network traffic
Authors: Sreekar Shenoy, Govind; Tubella Murgadas, Jordi; González Colás, Antonio María
Abstract: Network traffic has traditionally exhibited temporal locality in the header field of packets. Such locality is intuitive and is a consequence of the semantics of network protocols. However, in contrast, the locality in the packet payload has not been studied in significant detail. In this work we study temporal locality in the packet payload. Temporal locality can also be viewed as redundancy, and we observe significant redundancy in the packet payload. We investigate mechanisms to exploit it in a networking application.&#xD;
We choose Intrusion Detection Systems (IDS) as a case study. An IDS like the popular Snort operates by scanning packet payload&#xD;
for known attack strings. It first builds a Finite State Machine (FSM) from a database of attack strings, and traverses this FSM&#xD;
using bytes from the packet payload. So temporal locality in network traffic provides us an opportunity to accelerate this&#xD;
FSM traversal. Our mechanism dynamically identifies redundant bytes in the packet and skips their redundant FSM traversal. We &#xD;
further parallelize our mechanism by performing the redundancy identification concurrently with stages of Snort packet processing. IDS are commonly deployed in commodity processors, and we evaluate our mechanism on an Intel Core i3. Our performance study indicates that the length of the redundant chunk is a key factor in performance. We also observe important performance benefits in deploying our redundancy-aware mechanism in the Snort IDS[32].</description>
      <pubDate>Tue, 28 May 2013 11:41:21 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19428</guid>
      <dc:date>2013-05-28T11:41:21Z</dc:date>
      <itunes:author>Sreekar Shenoy, Govind; Tubella Murgadas, Jordi; González Colás, Antonio María</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Deep packet inspection, Intrusion detection systems, Software caches, System performance evaluation, Temporal locality</itunes:keywords>
      <itunes:summary>Network traffic has traditionally exhibited temporal locality in the header field of packets. Such locality is intuitive and is a consequence of the semantics of network protocols. However, in contrast, the locality in the packet payload has not been studied in significant detail. In this work we study temporal locality in the packet payload. Temporal locality can also be viewed as redundancy, and we observe significant redundancy in the packet payload. We investigate mechanisms to exploit it in a networking application.&#xD;
We choose Intrusion Detection Systems (IDS) as a case study. An IDS like the popular Snort operates by scanning packet payload&#xD;
for known attack strings. It first builds a Finite State Machine (FSM) from a database of attack strings, and traverses this FSM&#xD;
using bytes from the packet payload. So temporal locality in network traffic provides us an opportunity to accelerate this&#xD;
FSM traversal. Our mechanism dynamically identifies redundant bytes in the packet and skips their redundant FSM traversal. We &#xD;
further parallelize our mechanism by performing the redundancy identification concurrently with stages of Snort packet processing. IDS are commonly deployed in commodity processors, and we evaluate our mechanism on an Intel Core i3. Our performance study indicates that the length of the redundant chunk is a key factor in performance. We also observe important performance benefits in deploying our redundancy-aware mechanism in the Snort IDS[32].</itunes:summary>
    </item>
    <item>
      <title>Hardware/software mechanisms for protecting an IDS against algorithmic complexity attacks</title>
      <link>http://hdl.handle.net/2117/19426</link>
      <description>Title: Hardware/software mechanisms for protecting an IDS against algorithmic complexity attacks
Authors: Sreekar Shenoy, Govind; Tubella Murgadas, Jordi; González Colás, Antonio María
Abstract: Intrusion Detection Systems (IDS) have emerged as one of the most promising ways to secure systems in the network. An IDS like the popular Snort[17] detects attacks on the network using a database of previous attacks. So in order to detect these attack strings in the packet, Snort uses the Aho-Corasick algorithm. This algorithm first constructs a Finite State Machine (FSM) from the attack strings, and subsequently traverses the FSM using bytes from the packet. We observe that there are input bytes that result in a traversal of a series of FSM states (also viewed as pointers). This chain of pointer traversal significantly degrades (22X) the processing&#xD;
time of an input byte. Such a wide variance in the processing time of an input byte can be exploited by an adversary to throttle the IDS. If the IDS is unable to keep pace with the network traffic, the IDS gets disabled. So in the process the network becomes vulnerable. Attacks done in this manner are&#xD;
referred to as algorithmic complexity attacks, and arise due to weaknesses in IDS processing. In this work, we explore defense mechanisms to the above outlined algorithmic complexity attack. Our proposed mechanisms provide over 3X improvement in the worst-case performance.</description>
      <pubDate>Tue, 28 May 2013 10:21:42 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19426</guid>
      <dc:date>2013-05-28T10:21:42Z</dc:date>
      <itunes:author>Sreekar Shenoy, Govind; Tubella Murgadas, Jordi; González Colás, Antonio María</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Defense mechanisms, Hardware support, Intrusion detection systems</itunes:keywords>
      <itunes:summary>Intrusion Detection Systems (IDS) have emerged as one of the most promising ways to secure systems in the network. An IDS like the popular Snort[17] detects attacks on the network using a database of previous attacks. So in order to detect these attack strings in the packet, Snort uses the Aho-Corasick algorithm. This algorithm first constructs a Finite State Machine (FSM) from the attack strings, and subsequently traverses the FSM using bytes from the packet. We observe that there are input bytes that result in a traversal of a series of FSM states (also viewed as pointers). This chain of pointer traversal significantly degrades (22X) the processing&#xD;
time of an input byte. Such a wide variance in the processing time of an input byte can be exploited by an adversary to throttle the IDS. If the IDS is unable to keep pace with the network traffic, the IDS gets disabled. So in the process the network becomes vulnerable. Attacks done in this manner are&#xD;
referred to as algorithmic complexity attacks, and arise due to weaknesses in IDS processing. In this work, we explore defense mechanisms to the above outlined algorithmic complexity attack. Our proposed mechanisms provide over 3X improvement in the worst-case performance.</itunes:summary>
    </item>
    <item>
      <title>DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support</title>
      <link>http://hdl.handle.net/2117/19158</link>
      <description>Title: DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Authors: Pavlou, Demos; Gibert Codina, Enric; Latorre, Fernando; González Colás, Antonio María
Abstract: Dynamic Binary Translators (DBT) and Dynamic Binary Opti-&#xD;
mization (DBO) by software are used widely for several reasons&#xD;
including performance, design simplification and virtualization.&#xD;
However, the software layer in such systems introduces non-&#xD;
negligible overheads which affect performance and user experi-&#xD;
ence. Hence, reducing DBT/DBO overheads is of paramount im-&#xD;
portance. In addition, reduced overheads have interesting collateral&#xD;
effects in the rest of the software layer, such as allowing optimiza-&#xD;
tions to be applied earlier. A cost-effective solution to this problem&#xD;
is to provide hardware support to speed up the primitives of the&#xD;
software layer, paying special attention to automate DBT/DBO&#xD;
mechanisms and leave the heuristics to the software, which is more&#xD;
flexible.&#xD;
In this work, we have characterized the overheads of a DBO sys-&#xD;
tem using DynamoRIO implementing several basic optimizations.&#xD;
We have seen that the computation of the Data Dependence Graph&#xD;
(DDG) accounts for 5%-10% of the execution time. For this rea-&#xD;
son, we propose to add hardware support for this task in the form&#xD;
of a new functional unit, called DDGacc, which is integrated in a&#xD;
conventional pipeline processor and is operated through new ISA&#xD;
instructions. Our evaluation shows that DDGacc reduces the cost of&#xD;
computing the DDG by 32x, which reduces overall execution time&#xD;
by 5%-10% on average and up to 18% for applications where the&#xD;
DBO optimizes large code footprints.</description>
      <pubDate>Fri, 10 May 2013 12:30:37 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19158</guid>
      <dc:date>2013-05-10T12:30:37Z</dc:date>
      <itunes:author>Pavlou, Demos; Gibert Codina, Enric; Latorre, Fernando; González Colás, Antonio María</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>co-designed processors, dynamic binary optimization, hardware acceleration, start-up overhead</itunes:keywords>
      <itunes:summary>Dynamic Binary Translators (DBT) and Dynamic Binary Opti-&#xD;
mization (DBO) by software are used widely for several reasons&#xD;
including performance, design simplification and virtualization.&#xD;
However, the software layer in such systems introduces non-&#xD;
negligible overheads which affect performance and user experi-&#xD;
ence. Hence, reducing DBT/DBO overheads is of paramount im-&#xD;
portance. In addition, reduced overheads have interesting collateral&#xD;
effects in the rest of the software layer, such as allowing optimiza-&#xD;
tions to be applied earlier. A cost-effective solution to this problem&#xD;
is to provide hardware support to speed up the primitives of the&#xD;
software layer, paying special attention to automate DBT/DBO&#xD;
mechanisms and leave the heuristics to the software, which is more&#xD;
flexible.&#xD;
In this work, we have characterized the overheads of a DBO sys-&#xD;
tem using DynamoRIO implementing several basic optimizations.&#xD;
We have seen that the computation of the Data Dependence Graph&#xD;
(DDG) accounts for 5%-10% of the execution time. For this rea-&#xD;
son, we propose to add hardware support for this task in the form&#xD;
of a new functional unit, called DDGacc, which is integrated in a&#xD;
conventional pipeline processor and is operated through new ISA&#xD;
instructions. Our evaluation shows that DDGacc reduces the cost of&#xD;
computing the DDG by 32x, which reduces overall execution time&#xD;
by 5%-10% on average and up to 18% for applications where the&#xD;
DBO optimizes large code footprints.</itunes:summary>
    </item>
    <item>
      <title>The contribution of Type IA supernovae to the galactic iron abundances</title>
      <link>http://hdl.handle.net/2117/18906</link>
      <description>Title: The contribution of Type IA supernovae to the galactic iron abundances
Authors: Bravo Guil, Eduardo; Isern Vilaboy, Jordi; Canal Corretger, Ramon
Abstract: The thermonuclear explosion of a mass-accreting white dwarf in a close binary system is thought to be at the origin of Type Ia supernovae. Standard models, which ignite carbon at densities higher than 2-4 x 10 exp 9 g/cu cm, give, however, a large production of species like Fe-54, Ni-58, and Cr-54, which has been regarded as incompatible with the solar system abundances. In this paper we analyze the weight of the constraints imposed by nucleosynthesis of the Fe-peak nuclides to the aforementioned scenario for Type Ia supernovae when the contribution of Type II and Type Ib supernovae to the galactic iron abundances is also taken into account. We find that the production of the aforementioned nuclides predicted by standard SNIa models is in fact compatible with the solar system abundances when the yields from gravitational-collapse supernovae are adjusted to reproduce the Ni abundances in low-metallicity stars.</description>
      <pubDate>Fri, 19 Apr 2013 17:11:40 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18906</guid>
      <dc:date>2013-04-19T17:11:40Z</dc:date>
      <itunes:author>Bravo Guil, Eduardo; Isern Vilaboy, Jordi; Canal Corretger, Ramon</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>The thermonuclear explosion of a mass-accreting white dwarf in a close binary system is thought to be at the origin of Type Ia supernovae. Standard models, which ignite carbon at densities higher than 2-4 x 10 exp 9 g/cu cm, give, however, a large production of species like Fe-54, Ni-58, and Cr-54, which has been regarded as incompatible with the solar system abundances. In this paper we analyze the weight of the constraints imposed by nucleosynthesis of the Fe-peak nuclides to the aforementioned scenario for Type Ia supernovae when the contribution of Type II and Type Ib supernovae to the galactic iron abundances is also taken into account. We find that the production of the aforementioned nuclides predicted by standard SNIa models is in fact compatible with the solar system abundances when the yields from gravitational-collapse supernovae are adjusted to reproduce the Ni abundances in low-metallicity stars.</itunes:summary>
    </item>
    <item>
      <title>On the photometric homogeneity of type IA supernovae</title>
      <link>http://hdl.handle.net/2117/18905</link>
      <description>Title: On the photometric homogeneity of type IA supernovae
Authors: Bravo Guil, Eduardo; Domínguez, Inmaculada; Isern, Jordi; Canal Corretger, Ramon; Höflich, P.; Labay, Javier
Abstract: The dependence of the characteristics of the light curves of Type Ia supernovae on the ignition density of the progenitor white dwarf is studied with the aid of two models of propagation of the thermonuclear burning front: as a deflagration and as a delayed detonation. The light curve is computed from opacities which take into account the velocity gradients. The results show that in all cases the resulting light curves roughly agree with observations and that they are not sensitive to the ignition density of the white dwarf. Only the model corresponding to a deflagration starting at a density of 8 x 10 exp 9 g/cu cm shows a deviation from the general behavior, having a significantly lower luminosity at maximum. A dispersion of about 1000 km/s is found in the computed expansion velocities at maximum, which compares well with that found in the observations.</description>
      <pubDate>Fri, 19 Apr 2013 17:02:57 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18905</guid>
      <dc:date>2013-04-19T17:02:57Z</dc:date>
      <itunes:author>Bravo Guil, Eduardo; Domínguez, Inmaculada; Isern, Jordi; Canal Corretger, Ramon; Höflich, P.; Labay, Javier</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>The dependence of the characteristics of the light curves of Type Ia supernovae on the ignition density of the progenitor white dwarf is studied with the aid of two models of propagation of the thermonuclear burning front: as a deflagration and as a delayed detonation. The light curve is computed from opacities which take into account the velocity gradients. The results show that in all cases the resulting light curves roughly agree with observations and that they are not sensitive to the ignition density of the white dwarf. Only the model corresponding to a deflagration starting at a density of 8 x 10 exp 9 g/cu cm shows a deviation from the general behavior, having a significantly lower luminosity at maximum. A dispersion of about 1000 km/s is found in the computed expansion velocities at maximum, which compares well with that found in the observations.</itunes:summary>
    </item>
    <item>
      <title>A Novel variation-tolerant 4T-DRAM with enhance soft-error tolerance</title>
      <link>http://hdl.handle.net/2117/18455</link>
      <description>Title: A Novel variation-tolerant 4T-DRAM with enhance soft-error tolerance
Authors: Ganapathy, Shrikanth; Canal Corretger, Ramon; Alexandrescu, Dan; Costenaro, Enrico; González Colás, Antonio María; Rubio Sola, Jose Antonio
Abstract: In view of device scaling issues, embedded DRAM (eDRAM) technology is being considered as a strong alternative to conventional SRAM for use in on-chip memories. Memory cells designed using eDRAM technology in addition to being logic-compatible, are variation tolerant and immune to noise present at low supply voltages. However, two major causes of concern are the data retention capability which is worsened by parameter variations leading to frequent data refreshes (resulting in large dynamic power overhead) and the transient reduction of stored charge increasing soft-error (SE) susceptibility. In this paper, we present a novel variation-tolerant 4T-DRAM cell whose power consumption is 20.4% lower when compared to a similar sized eDRAM cell. The retention time on-average is improved by 2.04X while incurring a delay overhead of 3% on the read-access time. Most importantly, using a soft-error (SE) rate analysis tool, we have confirmed that the cell sensitivity to SEs is reduced by 56% on-average in a natural working environment.</description>
      <pubDate>Thu, 21 Mar 2013 13:41:03 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18455</guid>
      <dc:date>2013-03-21T13:41:03Z</dc:date>
      <itunes:author>Ganapathy, Shrikanth; Canal Corretger, Ramon; Alexandrescu, Dan; Costenaro, Enrico; González Colás, Antonio María; Rubio Sola, Jose Antonio</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In view of device scaling issues, embedded DRAM (eDRAM) technology is being considered as a strong alternative to conventional SRAM for use in on-chip memories. Memory cells designed using eDRAM technology in addition to being logic-compatible, are variation tolerant and immune to noise present at low supply voltages. However, two major causes of concern are the data retention capability which is worsened by parameter variations leading to frequent data refreshes (resulting in large dynamic power overhead) and the transient reduction of stored charge increasing soft-error (SE) susceptibility. In this paper, we present a novel variation-tolerant 4T-DRAM cell whose power consumption is 20.4% lower when compared to a similar sized eDRAM cell. The retention time on-average is improved by 2.04X while incurring a delay overhead of 3% on the read-access time. Most importantly, using a soft-error (SE) rate analysis tool, we have confirmed that the cell sensitivity to SEs is reduced by 56% on-average in a natural working environment.</itunes:summary>
    </item>
    <item>
      <title>Analysis of CPI variance for dynamic binary translators/optimizers modules</title>
      <link>http://hdl.handle.net/2117/18448</link>
      <description>Title: Analysis of CPI variance for dynamic binary translators/optimizers modules
Authors: Brankovic, Aleksandar; Stavrou, Kyriakos; Gibert Codina, Enric; González Colás, Antonio María
Abstract: Dynamic Binary Translators and Optimizers&#xD;
(DBTOs) have been established as a hot research topic. They are used in many different systems, such as emulation, instrumentation tools and innovative HW/SW co-designed microarchitectures.&#xD;
Although many researchers worked on characterizing and reducing the emulation overhead, to the best of our knowledge, there are no published results that explain how the microarchitectural&#xD;
behavior of the emulation software is affected by the guest application which is emulated.&#xD;
In this paper we study the DBTO as an independent application, which is divided into the modules with specific functionality.&#xD;
We show the variance in microarchitectural behavior of DBTO among 48 applications. Moreover, we locate and explain the&#xD;
sources of variance. The results show that the variance is caused&#xD;
by interaction with the code cache (emulated application) and non&#xD;
uniform module execution characteristics. The insights presented&#xD;
in this paper can be exploited towards the design of more efficient&#xD;
DBTOs</description>
      <pubDate>Wed, 20 Mar 2013 19:11:15 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18448</guid>
      <dc:date>2013-03-20T19:11:15Z</dc:date>
      <itunes:author>Brankovic, Aleksandar; Stavrou, Kyriakos; Gibert Codina, Enric; González Colás, Antonio María</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>Dynamic Binary Translators and Optimizers&#xD;
(DBTOs) have been established as a hot research topic. They are used in many different systems, such as emulation, instrumentation tools and innovative HW/SW co-designed microarchitectures.&#xD;
Although many researchers worked on characterizing and reducing the emulation overhead, to the best of our knowledge, there are no published results that explain how the microarchitectural&#xD;
behavior of the emulation software is affected by the guest application which is emulated.&#xD;
In this paper we study the DBTO as an independent application, which is divided into the modules with specific functionality.&#xD;
We show the variance in microarchitectural behavior of DBTO among 48 applications. Moreover, we locate and explain the&#xD;
sources of variance. The results show that the variance is caused&#xD;
by interaction with the code cache (emulated application) and non&#xD;
uniform module execution characteristics. The insights presented&#xD;
in this paper can be exploited towards the design of more efficient&#xD;
DBTOs</itunes:summary>
    </item>
    <item>
      <title>Setting an error detection infrastructure with low cost acoustics wave detectors</title>
      <link>http://hdl.handle.net/2117/18242</link>
      <description>Title: Setting an error detection infrastructure with low cost acoustics wave detectors
Authors: Upasani, Gaurang; Vera Rivera, Francisco Javier; González Colás, Antonio María
Abstract: The continuing decrease in dimensions and operating voltage of transistors has increased their sensitivity against radiation phenomena making soft errors an important challenge in future chip multiprocessors (CMPs). Hence, new techniques for detecting errors in the logic and memories that allow meeting the desired failures-in-time (FIT) budget in CMPs are required. This paper proposes a low-cost dynamic particle strike detection mechanism through acoustic wave detectors. Our results show that our mechanism can protect both the logic and the memory arrays. As a case study, we also show how this technique can be combined with error codes to protect the last-level cache at low cost.</description>
      <pubDate>Tue, 12 Mar 2013 18:17:30 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18242</guid>
      <dc:date>2013-03-12T18:17:30Z</dc:date>
      <itunes:author>Upasani, Gaurang; Vera Rivera, Francisco Javier; González Colás, Antonio María</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>The continuing decrease in dimensions and operating voltage of transistors has increased their sensitivity against radiation phenomena making soft errors an important challenge in future chip multiprocessors (CMPs). Hence, new techniques for detecting errors in the logic and memories that allow meeting the desired failures-in-time (FIT) budget in CMPs are required. This paper proposes a low-cost dynamic particle strike detection mechanism through acoustic wave detectors. Our results show that our mechanism can protect both the logic and the memory arrays. As a case study, we also show how this technique can be combined with error codes to protect the last-level cache at low cost.</itunes:summary>
    </item>
    <item>
      <title>Enhancing 3T DRAMs for SRAM replacement under 10nm tri-gate SOI FinFETs</title>
      <link>http://hdl.handle.net/2117/18207</link>
      <description>Title: Enhancing 3T DRAMs for SRAM replacement under 10nm tri-gate SOI FinFETs
Authors: Jaksic, Zoran; Canal Corretger, Ramon
Abstract: In this paper, we&#xD;
pr&#xD;
esent the dynamic 3T memory&#xD;
cell for future 10nm tri-gate FinFETs as a potential replacement&#xD;
for classical 6T SRAM cell for implementation in high speed&#xD;
cache memories. We investigate read access time, retention time,&#xD;
and static power consumption of the cell when it is exposed&#xD;
to the effects of process and environmental variations. Process&#xD;
variations are extracted from the ITRS predictions and they are&#xD;
modeled at device level. For simulation, we use 10nm SOI tri-gate&#xD;
FinFET BSIM-CMG model card developed by the University&#xD;
of Glasgow, Device Modeling Group. When compared to the&#xD;
classical 6T SRAM, 3T cell has 40% smaller area, leakage is&#xD;
reduced up to 14 times while access time is approximately the&#xD;
same. In order to achieve higher retention times, we propose&#xD;
several cell extensions which, at the same time, enable post-&#xD;
fabrication/run-time adaptability.</description>
      <pubDate>Tue, 12 Mar 2013 13:17:05 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18207</guid>
      <dc:date>2013-03-12T13:17:05Z</dc:date>
      <itunes:author>Jaksic, Zoran; Canal Corretger, Ramon</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In this paper, we&#xD;
pr&#xD;
esent the dynamic 3T memory&#xD;
cell for future 10nm tri-gate FinFETs as a potential replacement&#xD;
for classical 6T SRAM cell for implementation in high speed&#xD;
cache memories. We investigate read access time, retention time,&#xD;
and static power consumption of the cell when it is exposed&#xD;
to the effects of process and environmental variations. Process&#xD;
variations are extracted from the ITRS predictions and they are&#xD;
modeled at device level. For simulation, we use 10nm SOI tri-gate&#xD;
FinFET BSIM-CMG model card developed by the University&#xD;
of Glasgow, Device Modeling Group. When compared to the&#xD;
classical 6T SRAM, 3T cell has 40% smaller area, leakage is&#xD;
reduced up to 14 times while access time is approximately the&#xD;
same. In order to achieve higher retention times, we propose&#xD;
several cell extensions which, at the same time, enable post-&#xD;
fabrication/run-time adaptability.</itunes:summary>
    </item>
    <item>
      <title>A novel variation-tolerant 4T-DRAM cell with enhanced soft-error tolerance</title>
      <link>http://hdl.handle.net/2117/18176</link>
      <description>Title: A novel variation-tolerant 4T-DRAM cell with enhanced soft-error tolerance
Authors: Ganapathy, Shrikanth; Canal Corretger, Ramon; Alexandrescu, Dan; Costenaro, Enrico; González Colás, Antonio María; Rubio Sola, Jose Antonio
Abstract: In view of device scaling issues, embedded DRAM (eDRAM)&#xD;
technology is being considered as a strong alternative to conventional&#xD;
SRAM for use in on-chip memories. Memory cells designed using eDRAM&#xD;
technology in addition to being logic-compatible, are variation tolerant&#xD;
and immune to noise present at low supply voltages. However, two major&#xD;
causes of concern are the data retention capability which is worsened by&#xD;
parameter variations leading to frequent data refreshes (resulting in large&#xD;
dynamic power overhead) and the transient reduction of stored charge&#xD;
increasing soft-error (SE) susceptibility. In this paper, we present a novel&#xD;
variation-tolerant 4T-DRAM cell whose power consumption is 20.4%&#xD;
lower when compared to a similar sized eDRAM cell. The retention time&#xD;
on-average is improved by 2.04X while incurring a delay overhead of&#xD;
3% on the read-access time. Most importantly, using a soft-error (SE)&#xD;
rate analysis tool, we have confirmed that the cell sensitivity to SEs is&#xD;
reduced by 56% on-average in a natural working environment</description>
      <pubDate>Mon, 11 Mar 2013 14:33:59 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18176</guid>
      <dc:date>2013-03-11T14:33:59Z</dc:date>
      <itunes:author>Ganapathy, Shrikanth; Canal Corretger, Ramon; Alexandrescu, Dan; Costenaro, Enrico; González Colás, Antonio María; Rubio Sola, Jose Antonio</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>In view of device scaling issues, embedded DRAM (eDRAM)&#xD;
technology is being considered as a strong alternative to conventional&#xD;
SRAM for use in on-chip memories. Memory cells designed using eDRAM&#xD;
technology in addition to being logic-compatible, are variation tolerant&#xD;
and immune to noise present at low supply voltages. However, two major&#xD;
causes of concern are the data retention capability which is worsened by&#xD;
parameter variations leading to frequent data refreshes (resulting in large&#xD;
dynamic power overhead) and the transient reduction of stored charge&#xD;
increasing soft-error (SE) susceptibility. In this paper, we present a novel&#xD;
variation-tolerant 4T-DRAM cell whose power consumption is 20.4%&#xD;
lower when compared to a similar sized eDRAM cell. The retention time&#xD;
on-average is improved by 2.04X while incurring a delay overhead of&#xD;
3% on the read-access time. Most importantly, using a soft-error (SE)&#xD;
rate analysis tool, we have confirmed that the cell sensitivity to SEs is&#xD;
reduced by 56% on-average in a natural working environment</itunes:summary>
    </item>
    <item>
      <title>Reducing energy consumption in human-centric wireless sensor networks</title>
      <link>http://hdl.handle.net/2117/18025</link>
      <description>Title: Reducing energy consumption in human-centric wireless sensor networks
Authors: Meseguer Pallarès, Roc; Molina Clemente, Carlos; Ochoa, Sergio; Santos, Rodrigo
Abstract: Energy consumption is a main research issue in&#xD;
wireless sensor networks; and particularly in those where nodes&#xD;
collaborate to reach a goal. This article explores the energy&#xD;
consumption in mobile devices participating in a human-based&#xD;
wireless sensor network. Specifically, the paper proposes the use&#xD;
of a message predictor to help detect and reduce the number of&#xD;
unnecessary control packets delivered by the nodes as a way to&#xD;
keep updated the network topology. In order to evaluate this&#xD;
proposal, the Optimized Link State Routing protocol was&#xD;
modified to add a message predictor between the routing and the&#xD;
network layers. Eleven simulations were performed using a&#xD;
particular setting. The preliminary results indicate the use of the&#xD;
message predictor can help reduce considerably the nodes energy&#xD;
consumption without affecting the routing capability of the&#xD;
protocol. Although these results are still preliminary, they are&#xD;
highly encouraging.</description>
      <pubDate>Thu, 28 Feb 2013 17:25:11 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/18025</guid>
      <dc:date>2013-02-28T17:25:11Z</dc:date>
      <itunes:author>Meseguer Pallarès, Roc; Molina Clemente, Carlos; Ochoa, Sergio; Santos, Rodrigo</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Human-centric, wireless sensor network, energy consumption, messages prediction, opportunistic network</itunes:keywords>
      <itunes:summary>Energy consumption is a main research issue in&#xD;
wireless sensor networks; and particularly in those where nodes&#xD;
collaborate to reach a goal. This article explores the energy&#xD;
consumption in mobile devices participating in a human-based&#xD;
wireless sensor network. Specifically, the paper proposes the use&#xD;
of a message predictor to help detect and reduce the number of&#xD;
unnecessary control packets delivered by the nodes as a way to&#xD;
keep updated the network topology. In order to evaluate this&#xD;
proposal, the Optimized Link State Routing protocol was&#xD;
modified to add a message predictor between the routing and the&#xD;
network layers. Eleven simulations were performed using a&#xD;
particular setting. The preliminary results indicate the use of the&#xD;
message predictor can help reduce considerably the nodes energy&#xD;
consumption without affecting the routing capability of the&#xD;
protocol. Although these results are still preliminary, they are&#xD;
highly encouraging.</itunes:summary>
    </item>
    <item>
      <title>Cómo formar ingenieros en informática en la competencia sostenibilidad y compromiso social</title>
      <link>http://hdl.handle.net/2117/16935</link>
      <description>Title: Cómo formar ingenieros en informática en la competencia sostenibilidad y compromiso social
Authors: Franquesa, David; Cruz Díaz, Josep Llorenç; Álvarez Martínez, Carlos; Sánchez Carracedo, Fermín; Fernández Jiménez, Agustín; López Álvarez, David
Abstract: In addition to he technical skills, the new trends in engineering education include the so-called professional skills. These skills are usually hard to teach and to evaluate, and some of them are difficult to include in technical subjects. In this paper, we analyze the "Sustainability and Social Responsibility" skill, an we present several techniques to develop it, both at the comprehension and the application levels according to the Bloom taxonomy. Besides, we also analyze the main requirements in an Educational Institution in order to implement this skill. / En los nuevos planes de estudios hay que desarrollar competencias que resultan novedosas: prácticamente no han sido trabajadas con anterioridad. Cómo enseñarlas y cómo evaluarlas es una preocupación para los diseñadores de los nuevos planes. Este artículo analiza la competencia "Sostenibilidad y Compromiso Social", explicando técnicas para desarrollarla tanto a nivel de comprensión como al de aplicación, según la taxonomía de Bloom, y analiza las condiciones que deben darse en un centro para poder implementar estas técnicas en las asignaturas de su plan de estudios.</description>
      <pubDate>Fri, 16 Nov 2012 11:04:58 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/16935</guid>
      <dc:date>2012-11-16T11:04:58Z</dc:date>
      <itunes:author>Franquesa, David; Cruz Díaz, Josep Llorenç; Álvarez Martínez, Carlos; Sánchez Carracedo, Fermín; Fernández Jiménez, Agustín; López Álvarez, David</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Sostenibilidad, Organización de planes de estudio, Organización de la Universidad, Responsabilidad social, Professional skills, Social responsibility, Studies organization, Sustainability, University organization, Competencias transversales</itunes:keywords>
      <itunes:summary>In addition to he technical skills, the new trends in engineering education include the so-called professional skills. These skills are usually hard to teach and to evaluate, and some of them are difficult to include in technical subjects. In this paper, we analyze the "Sustainability and Social Responsibility" skill, an we present several techniques to develop it, both at the comprehension and the application levels according to the Bloom taxonomy. Besides, we also analyze the main requirements in an Educational Institution in order to implement this skill. / En los nuevos planes de estudios hay que desarrollar competencias que resultan novedosas: prácticamente no han sido trabajadas con anterioridad. Cómo enseñarlas y cómo evaluarlas es una preocupación para los diseñadores de los nuevos planes. Este artículo analiza la competencia "Sostenibilidad y Compromiso Social", explicando técnicas para desarrollarla tanto a nivel de comprensión como al de aplicación, según la taxonomía de Bloom, y analiza las condiciones que deben darse en un centro para poder implementar estas técnicas en las asignaturas de su plan de estudios.</itunes:summary>
    </item>
  </channel>
</rss>

