{"title":"基于FPGA的常规阵列实现的最优分区","authors":"Steven Derrien, S. Rajopadhye, S. Sur-Kolay","doi":"10.1109/PCEE.2000.873620","DOIUrl":null,"url":null,"abstract":"Reconfigurable Accelerators (RAs) have the potential to provide significant speed-up over many traditional software implementations. However, their effective performance is often limited by their input/output (IO) capabilities rather than by their computational power. Hence it important to take these constraints into consideration when implementing an algorithm on such an architecture. We propose an IO conscious optimal partitioning strategy for RA based regular array implementations.","PeriodicalId":369394,"journal":{"name":"Proceedings International Conference on Parallel Computing in Electrical Engineering. PARELEC 2000","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Optimal partitioning for FPGA based regular array implementations\",\"authors\":\"Steven Derrien, S. Rajopadhye, S. Sur-Kolay\",\"doi\":\"10.1109/PCEE.2000.873620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reconfigurable Accelerators (RAs) have the potential to provide significant speed-up over many traditional software implementations. However, their effective performance is often limited by their input/output (IO) capabilities rather than by their computational power. Hence it important to take these constraints into consideration when implementing an algorithm on such an architecture. We propose an IO conscious optimal partitioning strategy for RA based regular array implementations.\",\"PeriodicalId\":369394,\"journal\":{\"name\":\"Proceedings International Conference on Parallel Computing in Electrical Engineering. PARELEC 2000\",\"volume\":\"121 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Parallel Computing in Electrical Engineering. PARELEC 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCEE.2000.873620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Parallel Computing in Electrical Engineering. PARELEC 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCEE.2000.873620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal partitioning for FPGA based regular array implementations
Reconfigurable Accelerators (RAs) have the potential to provide significant speed-up over many traditional software implementations. However, their effective performance is often limited by their input/output (IO) capabilities rather than by their computational power. Hence it important to take these constraints into consideration when implementing an algorithm on such an architecture. We propose an IO conscious optimal partitioning strategy for RA based regular array implementations.