<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Electrical Engineering</JournalTitle>
				<Issn>2588-2910</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>08</Month>
					<Day>16</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Efficient Dense Matrix Multiplication on UPMEM Processing-in-Memory Architecture: Optimization and Performance Analysis</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">6155</ELocationID>
			
<ELocationID EIdType="doi">10.22060/eej.2026.26237.6085</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Elham</FirstName>
					<LastName>Cheshmikhani</LastName>
<Affiliation>Department of Computer Science and Engineering, Shahid Beheshti University, 1983969411 Tehran, Iran</Affiliation>
<Identifier Source="ORCID">0000-0003-3737-683X</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2026</Year>
					<Month>07</Month>
					<Day>11</Day>
				</PubDate>
			</History>
		<Abstract>Matrix multiplication is a fundamental operation in image processing and many data-intensive applications, and its growing computational and memory demands increasingly challenge conventional CPU- and GPU-based systems. Processing-near/in-Memory (PnM/PiM) architectures address this challenge by reducing data movement between memory and computation units. UPMEM is a commercially available DRAM-based PIM platform that integrates lightweight processors within memory chips; however, efficiently mapping compute-intensive kernels such as dense matrix multiplication onto this architecture remains non-trivial due to limited arithmetic support, restricted on-chip memory, and low per-core frequency. In this work, we investigate the feasibility and performance of dense matrix multiplication on UPMEM. Starting from naive implementation, we apply loop reordering and tiling optimizations tailored to the UPMEM execution model. We analyze the impact of key architectural parameters, including the number of DPUs and tasklets, and compare UPMEM-based implementations against optimized CPU baselines under identical input sizes and precision constraints. Experimental results show that exploiting tasklet-level parallelism and DPU scalability yields significant performance improvements, with the tiling-based UPMEM implementation achieving up to 2.76x speedup over CPU tiling and outperforming loop-reordered CPU implementations for large matrices using 32-bit arithmetic.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Processing in Memory (PiM)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Processing near Memory (PnM)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">UPMEM</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Memory wall</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Von Neumann bottleneck</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Data-intensive computing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Memory-centric architecture</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://eej.aut.ac.ir/article_6155_a47072176bca825aadacf648034e124b.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
