集群应用程序基准测试

2006 IEEE International Symposium on Workload Characterization Pub Date : 2006-10-01 DOI:10.1109/IISWC.2006.302742

Oguz Altun, Nilgun Dursunoglu, M. Amasyali

{"title":"集群应用程序基准测试","authors":"Oguz Altun, Nilgun Dursunoglu, M. Amasyali","doi":"10.1109/IISWC.2006.302742","DOIUrl":null,"url":null,"abstract":"An application benchmark based on a set of clustering algorithms is described in this paper. The details of algorithms (K-means online, K-means batch, SOM-1 dimension, SOM-2 dimension, hierarchical K-means online and hierarchical SOM-1 dimension) are given. The code provided complies with ANSI C specifications, as a result is highly portable. The benchmark has been tested on various platforms using different compilers","PeriodicalId":222041,"journal":{"name":"2006 IEEE International Symposium on Workload Characterization","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Clustering Application Benchmark\",\"authors\":\"Oguz Altun, Nilgun Dursunoglu, M. Amasyali\",\"doi\":\"10.1109/IISWC.2006.302742\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An application benchmark based on a set of clustering algorithms is described in this paper. The details of algorithms (K-means online, K-means batch, SOM-1 dimension, SOM-2 dimension, hierarchical K-means online and hierarchical SOM-1 dimension) are given. The code provided complies with ANSI C specifications, as a result is highly portable. The benchmark has been tested on various platforms using different compilers\",\"PeriodicalId\":222041,\"journal\":{\"name\":\"2006 IEEE International Symposium on Workload Characterization\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Workload Characterization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IISWC.2006.302742\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Workload Characterization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IISWC.2006.302742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

本文描述了基于一组聚类算法的应用基准。给出了k -均值在线、k -均值批处理、SOM-1维、SOM-2维、分层k -均值在线和分层SOM-1维算法的细节。所提供的代码符合ANSI C规范，因此具有很高的可移植性。这个基准已经在不同的平台上使用不同的编译器进行了测试

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Clustering Application Benchmark

An application benchmark based on a set of clustering algorithms is described in this paper. The details of algorithms (K-means online, K-means batch, SOM-1 dimension, SOM-2 dimension, hierarchical K-means online and hierarchical SOM-1 dimension) are given. The code provided complies with ANSI C specifications, as a result is highly portable. The benchmark has been tested on various platforms using different compilers

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE International Symposium on Workload Characterization

自引率

0.00%

发文量