<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>DEP41 - Capítulos de monografías</title>
<link href="https://uvadoc.uva.es/handle/10324/1336" rel="alternate"/>
<subtitle>Dpto. Informática (Arquitectura y Tecnología de Computadores, Ciencias de la Computación e Inteligencia ...) - Capítulos de monografías</subtitle>
<id>https://uvadoc.uva.es/handle/10324/1336</id>
<updated>2026-04-08T20:22:06Z</updated>
<dc:date>2026-04-08T20:22:06Z</dc:date>
<entry>
<title>Thread-level Speculative Parallelization</title>
<link href="https://uvadoc.uva.es/handle/10324/72208" rel="alternate"/>
<author>
<name>Llanos Ferraris, Diego Rafael</name>
</author>
<id>https://uvadoc.uva.es/handle/10324/72208</id>
<updated>2024-12-04T20:02:00Z</updated>
<published>2004-01-01T00:00:00Z</published>
<summary type="text">The basic idea under speculative parallelization (also called thread-level speculation) is to assign the execution of different blocks of consecutive iterations to different threads, running each one on its own processor. While execution proceeds, software monitor ensures that no thread consumes an incorrect version of a value that should be calculated by a predecessor, therefore violating sequential semantics. If such a dependence violation occur, the monitor stops the parallel execution of the offending threads, discards iterations incorrectly calculated, and restart their execution using the correct values.
</summary>
<dc:date>2004-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>The All-Pair Shortest-Path Problem in Shared-Memory Heterogeneous Systems</title>
<link href="https://uvadoc.uva.es/handle/10324/71119" rel="alternate"/>
<author>
<name>Ortega Arranz, Héctor</name>
</author>
<author>
<name>Torres de la Sierra, Yuri</name>
</author>
<author>
<name>Llanos Ferraris, Diego Rafael</name>
</author>
<author>
<name>González Escribano, Arturo</name>
</author>
<id>https://uvadoc.uva.es/handle/10324/71119</id>
<updated>2024-10-30T20:01:43Z</updated>
<published>2014-01-01T00:00:00Z</published>
<summary type="text">This chapter faces the All-Pair Shortest-Path problem for sparse graphs combining parallel algorithms and parallel-productivity methods in heterogeneous systems. As this problem can be divided into independent Single-Source ShortestPath subproblems, we distribute this computation space into different processing units, CPUs and graphical processing units (GPUs), that are usually present in modern shared-memory systems. Although the powerful GPUs are signiﬁcantly faster than the CPUs, its combined use leads to better execution times. Furthermore, two different policies have been used for the scheduling issue, an equitable scheduling, where the workspace is equitably divided between all computational units independently of its nature, and a work-stealing scheduling, where a computational unit steals a new task when it has ﬁnished its previous work.
</summary>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Applying Gamification in a Parallel Programming Course</title>
<link href="https://uvadoc.uva.es/handle/10324/70851" rel="alternate"/>
<author>
<name>Fresno Bausela, Javier</name>
</author>
<author>
<name>Ortega Arranz, Héctor</name>
</author>
<author>
<name>Ortega-Arranz, Alejandro</name>
</author>
<author>
<name>González Escribano, Arturo</name>
</author>
<author>
<name>Llanos Ferraris, Diego Rafael</name>
</author>
<id>https://uvadoc.uva.es/handle/10324/70851</id>
<updated>2025-02-06T08:28:44Z</updated>
<published>2017-01-01T00:00:00Z</published>
<summary type="text">Pursuing a college degree is a task that requires a great amount of time and effort. Universities are facing a big challenge to attract students and keep them motivated. The gamification of education is a practice that expects to increase the students' engagement, which in turn increases learning outcomes. Nevertheless, obtaining beneficial results from gamification requires educators to mold the teaching to include this new practice, usually involving a lot of effort. In this chapter, the authors present a new software tool developed to encourage gamification dynamics, and they describe their experience using this tool in a Parallel Programming course. The chapter describes the structure of the course, the different proposed activities, the organization of hardware resources, the design of the developed software tool, and an evaluation of the gamified course. The results show that the use of gamification techniques has been a great success. The authors have had a very positive response from their students, and there has been also a big percentage of passing students.
</summary>
<dc:date>2017-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Consideraciones tecnológicas en los mercados electrónicos</title>
<link href="https://uvadoc.uva.es/handle/10324/40694" rel="alternate"/>
<author>
<name>Martínez González, María Mercedes</name>
</author>
<id>https://uvadoc.uva.es/handle/10324/40694</id>
<updated>2021-06-23T11:18:12Z</updated>
<published>2014-01-01T00:00:00Z</published>
<summary type="text">Este capítulo revisa los aspectos técnicos que afectan a las plataformas utilizadas&#13;
en los mercados electrónicos. Los aspectos abordados en este capítulo se han clasificado en tres categorías, que son a su vez las que determinan sus apartados. En primer lugar abordamos los aspectos relacionados con la búsqueda de información. En segundo lugar nos ocuparemos de los aspectos relacionados con la seguridad y la privacidad.  Por último, se abordan algunas consideraciones adicionales, que no encajan en ninguna de las dos categorías anteriores.
</summary>
<dc:date>2014-01-01T00:00:00Z</dc:date>
</entry>
</feed>
