{"title":"对不同架构的计算机系统进行排序","authors":"R. Chamberlain, N. Ganesan","doi":"10.1145/1646461.1646466","DOIUrl":null,"url":null,"abstract":"Sorting is an important problem that forms an essential component of many high-performance applications. Here, we explore the design space of sorting algorithms in recon-figurable hardware, looking to maximize the benefit associated with high-bandwidth, multiple-port access to memory. Rather than focus on an individual implementation, we investigate a family of approaches that exploit characteristics fairly unique to reconfigurable hardware.","PeriodicalId":59014,"journal":{"name":"高性能计算技术","volume":"51 1","pages":"39-46"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Sorting on architecturally diverse computer systems\",\"authors\":\"R. Chamberlain, N. Ganesan\",\"doi\":\"10.1145/1646461.1646466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sorting is an important problem that forms an essential component of many high-performance applications. Here, we explore the design space of sorting algorithms in recon-figurable hardware, looking to maximize the benefit associated with high-bandwidth, multiple-port access to memory. Rather than focus on an individual implementation, we investigate a family of approaches that exploit characteristics fairly unique to reconfigurable hardware.\",\"PeriodicalId\":59014,\"journal\":{\"name\":\"高性能计算技术\",\"volume\":\"51 1\",\"pages\":\"39-46\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"高性能计算技术\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1145/1646461.1646466\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"高性能计算技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1145/1646461.1646466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sorting on architecturally diverse computer systems
Sorting is an important problem that forms an essential component of many high-performance applications. Here, we explore the design space of sorting algorithms in recon-figurable hardware, looking to maximize the benefit associated with high-bandwidth, multiple-port access to memory. Rather than focus on an individual implementation, we investigate a family of approaches that exploit characteristics fairly unique to reconfigurable hardware.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
