Emilio L. Zapata
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Emilio L. Zapata has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Oscar Plata
Department of Computer Architecture, University of Málaga, Málaga, Spain
4 shared publications - Angeles Navarro
University of Malaga
2 shared publications - Eladio Gutierrez
Department of Computer Architecture, University of Málaga, Málaga, Spain
2 shared publications - Francisco J. Jaime
University of Malaga
2 shared publications - Javier Hormigo
University of Malaga
2 shared publications - Julio Villalba
Department Computer Architecture, University of Malaga, Blvr. Louis Pasteur, 35, Teatinos-Universidad, 29010 Málaga, Spain
2 shared publications
Latest Publications
- Open Access
Comparing assembly strategies for third-generation sequencing technologies across different genomes
- 1 August 2014
- Published by Elsevier in Parallel Computing
- Vol. 40 (8) , 374-393
A case study of different task implementations for multioutput stages in non-trivial parallel pipeline applications
- 1 August 2014
- Published by Elsevier in Parallel Computing
- Vol. 40 (8) , 374-393
A case study of different task implementations for multioutput stages in non-trivial parallel pipeline applications
- 6 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 62 (2) , 322-335
LS-Sig: Locality-Sensitive Signatures for Transactional Memory
Transactional Memory (TM) is an alternative to conventional multithreaded programming to ease the writing of concurrent programs. In the context of unbounded TM, concurrent threads may use hardware signatures to record all the memory addresses issued inside a transaction to detect conflicts. Signatures are usually implemented as per-thread fixed hardware Bloom filters that summarize a very large amount of read and write memory addresses at the cost of false conflicts (detection of nonexisting conflicts). In this paper, to reduce the probability of false conflicts, a novel signature design that exploits spatial locality is proposed. The design is based on new hash function mappings, so that nearby located addresses share some bits inserted in the filters. This is favorable particularly for large transactions that usually exhibit some amount of spatial locality. Besides, its implementation does not require extra hardware. The proposed signature was experimentally evaluated using the GEMS simulator and all the codes of the STAMP benchmark suite. In most cases, the results show significant improvement, particularly in the codes that involve long-running, large-data transactions.
- 6 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 62 (2) , 322-335
LS-Sig: Locality-Sensitive Signatures for Transactional Memory
Transactional Memory (TM) is an alternative to conventional multithreaded programming to ease the writing of concurrent programs. In the context of unbounded TM, concurrent threads may use hardware signatures to record all the memory addresses issued inside a transaction to detect conflicts. Signatures are usually implemented as per-thread fixed hardware Bloom filters that summarize a very large amount of read and write memory addresses at the cost of false conflicts (detection of nonexisting conflicts). In this paper, to reduce the probability of false conflicts, a novel signature design that exploits spatial locality is proposed. The design is based on new hash function mappings, so that nearby located addresses share some bits inserted in the filters. This is favorable particularly for large transactions that usually exhibit some amount of spatial locality. Besides, its implementation does not require extra hardware. The proposed signature was experimentally evaluated using the GEMS simulator and all the codes of the STAMP benchmark suite. In most cases, the results show significant improvement, particularly in the codes that involve long-running, large-data transactions.
- 3 November 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 19 (3) , 512-516
High-Speed Algorithms and Architectures for Range Reduction Computation
Range reduction is a crucial step for accuracy in trigonometric functions evaluation. This paper shows and compares a set of algorithms for additive range reduction computation and their corresponding application-specific integrated circuit implementations (ensuring an accuracy of one unit in the last place). A word-serial architecture implementation has been used as a reference for clearer comparisons. Besides, a new table-based pipelined architecture for range reduction has also been proposed.
- 3 November 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 19 (3) , 512-516
High-Speed Algorithms and Architectures for Range Reduction Computation
Range reduction is a crucial step for accuracy in trigonometric functions evaluation. This paper shows and compares a set of algorithms for additive range reduction computation and their corresponding application-specific integrated circuit implementations (ensuring an accuracy of one unit in the last place). A word-serial architecture implementation has been used as a reference for clearer comparisons. Besides, a new table-based pipelined architecture for range reduction has also been proposed.
- 18 March 2008
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 53 (1-2) , 103-112
Pipelined Architecture for Additive Range Reduction
- 18 March 2008
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 53 (1-2) , 103-112
Pipelined Architecture for Additive Range Reduction
- 1 March 2008
- Published by Elsevier in Parallel Computing
- Vol. 34 (3) , 133-157
An analytical model of locality-based parallel irregular reductions
- 1 March 2008
- Published by Elsevier in Parallel Computing
- Vol. 34 (3) , 133-157
An analytical model of locality-based parallel irregular reductions
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 178-185
Maximum and Sorted Cache Occupation Using Array Padding
The paper describes a framework for analyzing the cache content on affine references to arrays in loops. The framework is based on a small set of key cache parameters. We study the relation between these cache parameters and the data memory layout of arrays to demonstrate how to use array padding (static array re-dimensioning) to optimize the use of the cache. Based on the cache model we present a method to carry out intra-array padding for a maximum cache occupation and for a maximum sorted cache occupation, and a simple method to carry out inter-array padding. We also present an experimental evaluation of our techniques using a cache simulator and actual code executions on the MIPS R10K processor.
- 1 July 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 178-185
Maximum and Sorted Cache Occupation Using Array Padding
The paper describes a framework for analyzing the cache content on affine references to arrays in loops. The framework is based on a small set of key cache parameters. We study the relation between these cache parameters and the data memory layout of arrays to demonstrate how to use array padding (static array re-dimensioning) to optimize the use of the cache. Based on the cache model we present a method to carry out intra-array padding for a maximum cache occupation and for a maximum sorted cache occupation, and a simple method to carry out inter-array padding. We also present an experimental evaluation of our techniques using a cache simulator and actual code executions on the MIPS R10K processor.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15505499,p. 1-8
Bilinear Active Appearance Models
Appearance models have been applied to model the space of human faces over the last two decades. In particular, active appearance models (AAMs) have been successfully used for face tracking, synthesis and recognition, and they are one of the state-of-the-art approaches due to its efficiency and representational power. Although widely employed, AAMs suffer from a few drawbacks, such as the inability to isolate pose, identity and expression changes. This paper proposes Bilinear Active Appearance Models (BAAMs), an extension of AAMs, that effectively decouple changes due to pose and expression/identity. We derive a gradient-descent algorithm to efficiently fit BAAMs to new images. Experimental results show how BAAMs improve generalization and convergence with respect to the linear model. In addition, we illustrate decoupling benefits of BAAMs in face recognition across pose. We show how the pose normalization provided by BAAMs increase the recognition performance of commercial systems.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15505499,p. 1-8
Bilinear Active Appearance Models
Appearance models have been applied to model the space of human faces over the last two decades. In particular, active appearance models (AAMs) have been successfully used for face tracking, synthesis and recognition, and they are one of the state-of-the-art approaches due to its efficiency and representational power. Although widely employed, AAMs suffer from a few drawbacks, such as the inability to isolate pose, identity and expression changes. This paper proposes Bilinear Active Appearance Models (BAAMs), an extension of AAMs, that effectively decouple changes due to pose and expression/identity. We derive a gradient-descent algorithm to efficiently fit BAAMs to new images. Experimental results show how BAAMs improve generalization and convergence with respect to the linear model. In addition, we illustrate decoupling benefits of BAAMs in face recognition across pose. We show how the pose normalization provided by BAAMs increase the recognition performance of commercial systems.
- 20 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 8 (6) , 1299-1304
A Case Study of Load Sharing Based on Popularity in Distributed VoD Systems
In our research, we consider a distributed video-on-demand (VoD) system in which only the most popular videos are replicated in all the servers, whereas the rest of them are distributed through the system following some allocation scheme. In this paper, we present an algorithm to efficiently share the load in such a system and an analytical model that captures the performance of this algorithm, which we validate through simulations. One novelty in our work is that our analytical model lets us relate popularity and partial replication of some of the videos and to predict the user waiting time. We exploit such relationships to assist the system designer to select the size of the servers and network, the optimal number of servers to maintain short waiting time and to predict when the network encounters bottleneck
- 20 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 8 (6) , 1299-1304
A Case Study of Load Sharing Based on Popularity in Distributed VoD Systems
In our research, we consider a distributed video-on-demand (VoD) system in which only the most popular videos are replicated in all the servers, whereas the rest of them are distributed through the system following some allocation scheme. In this paper, we present an algorithm to efficiently share the load in such a system and an analytical model that captures the performance of this algorithm, which we validate through simulations. One novelty in our work is that our analytical model lets us relate popularity and partial replication of some of the videos and to predict the user waiting time. We exploit such relationships to assist the system designer to select the size of the servers and network, the optimal number of servers to maintain short waiting time and to predict when the network encounters bottleneck