NDLI: Reordering Algorithms for Increasing Locality on Multicore Processors

Content Provider	IEEE Xplore Digital Library
Author	Pichel, J.C. Singh, D.E. Carretero, J.
Copyright Year	2008
Description	Author affiliation: Comput. Sci. Dpt,, Univ. Carlos III de Madrid, Madrid (Pichel, J.C.; Singh, D.E.; Carretero, J.)
Abstract	In order to efficiently exploit available parallelism, multicore processors must address contention for shared resources as cache hierarchy. This fact becomes even more important when irregular codes are executed on them, which is the case for sparse matrix ones. In this paper a technique for increasing locality of sparse matrix codes on multicore platforms is presented. The technique consists on reorganizing the data guided by a locality model which introduces the concept of windows of locality. The evaluation of the reordering technique has been performed on two different leading multicore platforms: Intel Core2Duo and Intel Xeon. Experimental results show important performance improvements when using our reordered matrices with respect to original ones. In particular, an average execution time reduction of about 30% is achieved considering different number of running threads. These results are due to an improved overall cache behavior. Likewise, a comparison of our proposal with some standard reordering techniques is included in the paper. Results point out that the reordering technique always outperforms standard algorithms and is effective for matrices with any structure.
Starting Page	123
Ending Page	130
File Size	714230
Page Count	8
File Format	PDF
ISBN	9780769533520
DOI	10.1109/HPCC.2008.96
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-09-25
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Program processors Symmetric matrices Magnetic cores Computer architecture Distance measurement Data models Sparse matrices
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A multilevel compressed sparse row format for efficient sparse computations on multicore processors

Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication

Cache-aware matrix multiplication on multicore systems for IPM-based LP solvers

Data locality exploitation in algorithms including sparse communications

Performance Evaluation of Clusters with ccNUMA Nodes - A Case Study

Memory-Aware Algorithms and Scheduling Techniques: From Multicore Processors to Petascale Supercomputers

Parallelization of data mining algorithms for multicore processors

Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication

Two-Stage Tridiagonal Reduction for Dense Symmetric Matrices Using Tile Algorithms on Multicore Architectures

Reordering Algorithms for Increasing Locality on Multicore Processors

Similar Documents

A multilevel compressed sparse row format for efficient sparse computations on multicore processors

Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication

Cache-aware matrix multiplication on multicore systems for IPM-based LP solvers

Data locality exploitation in algorithms including sparse communications

Performance Evaluation of Clusters with ccNUMA Nodes - A Case Study

Memory-Aware Algorithms and Scheduling Techniques: From Multicore Processors to Petascale Supercomputers

Parallelization of data mining algorithms for multicore processors

Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication

Two-Stage Tridiagonal Reduction for Dense Symmetric Matrices Using Tile Algorithms on Multicore Architectures

Reordering Algorithms for Increasing Locality on Multicore Processors