O. D. Robles, J. L. Bosque, L. Pastor, Angel Rodríguez
{"title":"Performance analysis of a CBIR system on shared-memory systems and heterogeneous clusters","authors":"O. D. Robles, J. L. Bosque, L. Pastor, Angel Rodríguez","doi":"10.1109/CAMP.2005.40","DOIUrl":null,"url":null,"abstract":"This paper presents a parallel implementation of a CBIR system which has been designed for several multiprocessor architectures. The paradigm that best fits the problem's needs is a farm based solution: a master process distributes the work load among the slave processes, and when they have finished, the master collects the partial results computed on each slave process. The multiprocessors used in the tests are a shared memory machine with eight processors - a Silicon Graphics Origin 2000 - and a cluster with 16 PC. In order to evaluate both architectures, the experimental results have been collected under several configurations, considering dynamic load balancing for the cluster based implementation. This paper analyzes the performance achieved by the different setups from the viewpoints of speed, price and scalability, presenting the conclusions that can be extracted from the results' comparison.","PeriodicalId":393875,"journal":{"name":"Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Workshop on Computer Architecture for Machine Perception (CAMP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAMP.2005.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16
Abstract
This paper presents a parallel implementation of a CBIR system which has been designed for several multiprocessor architectures. The paradigm that best fits the problem's needs is a farm based solution: a master process distributes the work load among the slave processes, and when they have finished, the master collects the partial results computed on each slave process. The multiprocessors used in the tests are a shared memory machine with eight processors - a Silicon Graphics Origin 2000 - and a cluster with 16 PC. In order to evaluate both architectures, the experimental results have been collected under several configurations, considering dynamic load balancing for the cluster based implementation. This paper analyzes the performance achieved by the different setups from the viewpoints of speed, price and scalability, presenting the conclusions that can be extracted from the results' comparison.