Author of the publication

Reordering Algorithms for Increasing Locality on Multicore Processors.

, , and . HPCC, page 123-130. IEEE Computer Society, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimization of sparse matrix-vector multiplication using reordering techniques on GPUs., , , and . Microprocessors and Microsystems - Embedded Hardware Design, 36 (2): 65-77 (2012)Performance optimization of irregular codes based on the combination of reordering and blocking techniques., , , and . Parallel Computing, 31 (8-9): 858-876 (2005)Polypus: a Big Data Self-Deployable Architecture for Microblogging Text Extraction and Real-Time Sentiment Analysis., , and . CoRR, (2018)A Micromodule Approach for Building Real-Time Systems with Python-Based Models: Application to Early Risk Detection of Depression on Social Media., , , and . ECIR, volume 10772 of Lecture Notes in Computer Science, page 801-805. Springer, (2018)Multiobjective optimization technique based on monitoring information to increase the performance of thread migration on multicores., , , , and . CLUSTER, page 416-423. IEEE Computer Society, (2014)A collective I/O implementation based on Inspector-Executor paradigm., , , and . PDPTA, page 683-689. CSREA Press, (2007)On the Influence of Thread Allocation for Irregular Codes in NUMA Systems., , , and . PDCAT, page 146-153. IEEE Computer Society, (2009)BigBWA: approaching the Burrows-Wheeler aligner to Big Data technologies., , , and . Bioinformatics, 31 (24): 4003-4005 (2015)Reordering Algorithms for Increasing Locality on Multicore Processors., , and . HPCC, page 123-130. IEEE Computer Society, (2008)Using sampled information: is it enough for the sparse matrix-vector product locality optimization?, , , , and . Concurr. Comput. Pract. Exp., 26 (1): 98-117 (2014)