Analyzing Performance of the Parallel-based Fractal Image Compression Problem on Multicore Systems

Roberto de Quadros Gomes , Vladimir Guerreiro , Rodrigo da Rosa Righi , Luiz Gonzaga da Silveira Jr. , Jinyoung Yang
{"title":"Analyzing Performance of the Parallel-based Fractal Image Compression Problem on Multicore Systems","authors":"Roberto de Quadros Gomes ,&nbsp;Vladimir Guerreiro ,&nbsp;Rodrigo da Rosa Righi ,&nbsp;Luiz Gonzaga da Silveira Jr. ,&nbsp;Jinyoung Yang","doi":"10.1016/j.aasri.2013.10.070","DOIUrl":null,"url":null,"abstract":"<div><p>Both the size and the resolution of images always were key topics in the graphical computing area. Especially, they become more and more relevant in the big data era. We can observe that often a huge amount of data is exchanged by medium/low bandwidth networks or yet, they need to be stored on devices with limited space of memory. In this context, the present paper shows the use of the Fractal method for image compression. It is a lossy method known by providing higher indexes of file reduction through a highly time consuming phase. In this way, we developed a model of parallel application for exploiting the power of multiprocessor architectures in order to get the Fractal method advantages in a feasible time. The evaluation was done with different-sized images as well as by using two types of machines, one with two and another with four cores. The results demonstrated that both the speedup and efficiency are highly dependent of the number of cores. They emphasized that a large number of threads does not always represent a better performance.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 140-146"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.070","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AASRI Procedia","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2212671613000711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Both the size and the resolution of images always were key topics in the graphical computing area. Especially, they become more and more relevant in the big data era. We can observe that often a huge amount of data is exchanged by medium/low bandwidth networks or yet, they need to be stored on devices with limited space of memory. In this context, the present paper shows the use of the Fractal method for image compression. It is a lossy method known by providing higher indexes of file reduction through a highly time consuming phase. In this way, we developed a model of parallel application for exploiting the power of multiprocessor architectures in order to get the Fractal method advantages in a feasible time. The evaluation was done with different-sized images as well as by using two types of machines, one with two and another with four cores. The results demonstrated that both the speedup and efficiency are highly dependent of the number of cores. They emphasized that a large number of threads does not always represent a better performance.

基于并行的分形图像压缩问题在多核系统上的性能分析
图像的大小和分辨率一直是图形计算领域的关键问题。特别是在大数据时代,它们变得越来越重要。我们可以观察到,通常大量的数据是通过中/低带宽网络交换的,或者它们需要存储在内存空间有限的设备上。在这种情况下,本文展示了使用分形方法进行图像压缩。它是一种有损的方法,通过一个非常耗时的阶段提供更高的文件缩减索引。通过这种方式,我们开发了一种利用多处理器架构能力的并行应用模型,以便在可行的时间内获得分形方法的优势。评估是用不同大小的图像完成的,并使用两种类型的机器,一种是两核,另一种是四核。结果表明,加速和效率都高度依赖于核数。他们强调,大量的线程并不总是代表更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信