Iratxe Soraluze
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Iratxe Soraluze has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Roberto Cortiñas
Computer Science Faculty, University of the Basque Country UPV/EHU, Paseo M. Lardizábal 1, 20018 Donostia-San Sebastián, Spain
9 shared publications Alberto Lafuente
7 shared publicationsMikel Larrea
6 shared publications- Javier Muguerza
University of the Basque Country (UPV/EHU)
4 shared publications - Mikel Larrea
University of the Basque Country UPV/EHU
4 shared publications - Alberto Lafuente
Distributed Systems Group, University of the Basque Country (UPV/EHU), 48940 Leioa, Spain
3 shared publications
Latest Publications
- Open Access
- 20 May 2016
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 16 (3) , 1-17
Using a Real Bare Machine in a Project-Based Learning Environment for Teaching Computer Structure
The computer input/output (I/O) subsystem and its functioning are very abstract concepts that are difficult for undergraduate freshmen to understand. However, it is important that freshmen assimilate these low-level concepts if they are going to be taught about the operating systems (OS) working over that architecture layer, or working directly with them in embedded systems, real-time systems, or in the area of human--computer interaction (HCI). This article describes the use of a game console (Nintendo® DS, NDS) in a project-based learning (PBL or PjBL) environment in which the design of a game is the basis of the project in order to encourage the students to get more involved with the computer I/O subsystem abstraction. A 4yr experience is reported in which the action research model (planning, acting, observing, and reflecting) has been followed. The general procedure for the 4yr and the specific characteristics and achieved results for each year are reported. The aim of the study was twofold: to assess the learning effectiveness of the active PjBL educational approach and some related factors, and to analyze the motivation toward the subject fostered by the game console. The first aim is analyzed using the scores achieved by the students; the second aim is analyzed via satisfaction questionnaires.
- 20 May 2016
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 16 (3) , 1-17
Open AccessUsing a Real Bare Machine in a Project-Based Learning Environment for Teaching Computer Structure
The computer input/output (I/O) subsystem and its functioning are very abstract concepts that are difficult for undergraduate freshmen to understand. However, it is important that freshmen assimilate these low-level concepts if they are going to be taught about the operating systems (OS) working over that architecture layer, or working directly with them in embedded systems, real-time systems, or in the area of human--computer interaction (HCI). This article describes the use of a game console (Nintendo® DS, NDS) in a project-based learning (PBL or PjBL) environment in which the design of a game is the basis of the project in order to encourage the students to get more involved with the computer I/O subsystem abstraction. A 4yr experience is reported in which the action research model (planning, acting, observing, and reflecting) has been followed. The general procedure for the 4yr and the specific characteristics and achieved results for each year are reported. The aim of the study was twofold: to assess the learning effectiveness of the active PjBL educational approach and some related factors, and to analyze the motivation toward the subject fostered by the game console. The first aim is analyzed using the scores achieved by the students; the second aim is analyzed via satisfaction questionnaires.
- 1 March 2015
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 81 (2) , 383-397
Communication-optimal eventually perfect failure detection in partially synchronous systems
- 1 March 2015
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 81 (2) , 383-397
Communication-optimal eventually perfect failure detection in partially synchronous systems
- Open Access
- 1 January 2015
- Published by INSTICC
- p. 97-102
Evaluation of a Fault-tolerant WSN Routing Algorithm Based on Link Quality
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 1 January 2015
- Published by INSTICC
- p. 97-102
Open AccessEvaluation of a Fault-tolerant WSN Routing Algorithm Based on Link Quality
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 15 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Education
- Vol. 56 (4) , 453-458
Game-Console-Based Projects for Learning the Computer Input/Output Subsystem
The input/output (I/O) subsystem is an important topic within computer architecture (CA) because it determines how the computer interacts with its environment. For this reason, computer scientists and engineers must understand how the computer manages this interaction, which is usually taught in introductory CA courses. Of course, there are many different styles of teaching, ranging from purely theoretical to completely practical. The CA course considered in this paper has already applied a practical approach for some time. For the I/O subsystem, students must be able to describe what polling and interrupts are and handle them through low-level programming. However, programming at this level in operating system (OS)-driven computers is not possible without being familiar with the kernel and drivers, which is not usually the case for students in an introductory course. Fortunately, there are many bare and specialized embedded systems around that are not OS-driven. In this proposal, the Nintendo DS (NDS) console was used in a classroom setting. It proved to be an appropriate infrastructure for developing attractive and engaging projects and was useful in providing a better understanding of the mechanisms related to the I/O subsystem. At the same time, the teaching methods were altered to make the transition from classical, passive, lecture-based classes to an active project-based learning (PBL) approach. It has been a very rewarding experience to see students learning to control the NDS devices on their own. In addition to describing the implementation of the proposed changes in two subsequent school years, this paper also presents some data and conclusions.
- 15 April 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Education
- Vol. 56 (4) , 453-458
Game-Console-Based Projects for Learning the Computer Input/Output Subsystem
The input/output (I/O) subsystem is an important topic within computer architecture (CA) because it determines how the computer interacts with its environment. For this reason, computer scientists and engineers must understand how the computer manages this interaction, which is usually taught in introductory CA courses. Of course, there are many different styles of teaching, ranging from purely theoretical to completely practical. The CA course considered in this paper has already applied a practical approach for some time. For the I/O subsystem, students must be able to describe what polling and interrupts are and handle them through low-level programming. However, programming at this level in operating system (OS)-driven computers is not possible without being familiar with the kernel and drivers, which is not usually the case for students in an introductory course. Fortunately, there are many bare and specialized embedded systems around that are not OS-driven. In this proposal, the Nintendo DS (NDS) console was used in a classroom setting. It proved to be an appropriate infrastructure for developing attractive and engaging projects and was useful in providing a better understanding of the mechanisms related to the I/O subsystem. At the same time, the teaching methods were altered to make the transition from classical, passive, lecture-based classes to an active project-based learning (PBL) approach. It has been a very rewarding experience to see students learning to control the NDS devices on their own. In addition to describing the implementation of the proposed changes in two subsequent school years, this paper also presents some data and conclusions.
- 1 February 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10666192,p. 180-188
An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems
This paper presents an evaluation of three communication-efficient algorithms implementing the Omega class of failure detectors, which provides an eventual leader election functionality, in distributed systems where processes can crash and recover. Communication efficiency means that eventually only a correct process, i.e., the elected leader, keeps sending a message periodically to the rest of processes. The first algorithm relies on the use of stable storage to store the identity of the leader and an incarnation number. The second algorithm does not use stable storage, but requires a majority of correct processes. Also, it is near-communication-efficient, since besides the leader, unstable processes, i.e., those that crash and recover infinitely often, may send messages periodically before they receive a message from the leader. Finally, the third algorithm does neither use stable storage nor require a majority of correct processes, but assumes that each process has access to a nondecreasing and persistent local clock. Using the OMNeT++ network simulation framework, we evaluate the performance and the quality of service provided by these algorithms, in terms of the number of messages exchanged among processes and the capability of the failure detector to provide a single leader, respectively.
- 1 February 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10666192,p. 180-188
An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems
This paper presents an evaluation of three communication-efficient algorithms implementing the Omega class of failure detectors, which provides an eventual leader election functionality, in distributed systems where processes can crash and recover. Communication efficiency means that eventually only a correct process, i.e., the elected leader, keeps sending a message periodically to the rest of processes. The first algorithm relies on the use of stable storage to store the identity of the leader and an incarnation number. The second algorithm does not use stable storage, but requires a majority of correct processes. Also, it is near-communication-efficient, since besides the leader, unstable processes, i.e., those that crash and recover infinitely often, may send messages periodically before they receive a message from the leader. Finally, the third algorithm does neither use stable storage nor require a majority of correct processes, but assumes that each process has access to a nondecreasing and persistent local clock. Using the OMNeT++ network simulation framework, we evaluate the performance and the quality of service provided by these algorithms, in terms of the number of messages exchanged among processes and the capability of the failure detector to provide a single leader, respectively.
- Open Access
- 3 July 2012
- Published by Association for Computing Machinery (ACM)
- p. 373
Nintendo® DS projects to learn computer input-output
- 3 July 2012
- Published by Association for Computing Machinery (ACM)
- p. 373
Open AccessNintendo® DS projects to learn computer input-output
- 21 February 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 9 (4) , 610-625
Secure Failure Detection and Consensus in TrustedPals
We present a modular redesign of TrustedPals, a smart card-based security framework for solving Secure Multiparty Computation (SMC). Originally, TrustedPals assumed a synchronous network setting and allowed to reduce SMC to the problem of fault-tolerant consensus among smart cards. We explore how to make TrustedPals applicable in environments with less synchrony and show how it can be used to solve asynchronous SMC. Within the redesign we investigate the problem of solving consensus in a general omission failure model augmented with failure detectors. To this end, we give novel definitions of both consensus and the class oP of failure detectors in the omission model, which we call ◇P(om), and show how to implement ◇P(om) and have consensus in such a system with very weak synchrony assumptions. The integration of failure detection and consensus into the TrustedPals framework uses tools from privacy enhancing techniques such as message padding and dummy traffic.
- 21 February 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 9 (4) , 610-625
Secure Failure Detection and Consensus in TrustedPals
We present a modular redesign of TrustedPals, a smart card-based security framework for solving Secure Multiparty Computation (SMC). Originally, TrustedPals assumed a synchronous network setting and allowed to reduce SMC to the problem of fault-tolerant consensus among smart cards. We explore how to make TrustedPals applicable in environments with less synchrony and show how it can be used to solve asynchronous SMC. Within the redesign we investigate the problem of solving consensus in a general omission failure model augmented with failure detectors. To this end, we give novel definitions of both consensus and the class oP of failure detectors in the omission model, which we call ◇P(om), and show how to implement ◇P(om) and have consensus in such a system with very weak synchrony assumptions. The integration of failure detection and consensus into the TrustedPals framework uses tools from privacy enhancing techniques such as message padding and dummy traffic.
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 81-84
A Message Omission Failure Approach to Detect the Quality of Links in WSN
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 81-84
A Message Omission Failure Approach to Detect the Quality of Links in WSN
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Web and Grid Services
- Vol. 8 (3) , 204-224
Specifying and implementing an eventual leader service for dynamic systems
The election of an eventual leader in an asynchronous system prone to process crashes is an important problem of fault-tolerant distributed computing. This problem is known as the implementation of the failure detector Ω. Nearly all papers that propose algorithms implementing such an eventual leader service consider a static system. In contrast this paper considers a dynamic system, i.e. a system in which processes can join and leave. The paper has three main contributions. It first proposes a specification of Ω suited to dynamic systems. Then, it presents and proves correct two algorithms implementing this specification. Finally, the paper discusses the notion of an eventual leader suited to dynamic systems. It introduces an additional property related to system stability. The design of an algorithm satisfying this last property remains an open challenging problem.
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Web and Grid Services
- Vol. 8 (3) , 204-224
Specifying and implementing an eventual leader service for dynamic systems
The election of an eventual leader in an asynchronous system prone to process crashes is an important problem of fault-tolerant distributed computing. This problem is known as the implementation of the failure detector Ω. Nearly all papers that propose algorithms implementing such an eventual leader service consider a static system. In contrast this paper considers a dynamic system, i.e. a system in which processes can join and leave. The paper has three main contributions. It first proposes a specification of Ω suited to dynamic systems. Then, it presents and proves correct two algorithms implementing this specification. Finally, the paper discusses the notion of an eventual leader suited to dynamic systems. It introduces an additional property related to system stability. The design of an algorithm satisfying this last property remains an open challenging problem.
- 1 December 2011
- Published by Elsevier in Journal of Systems and Software
- Vol. 84 (12) , 2186-2195
Communication-efficient leader election in crash–recovery systems
- 1 December 2011
- Published by Elsevier in Journal of Systems and Software
- Vol. 84 (12) , 2186-2195
Communication-efficient leader election in crash–recovery systems