{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:25Z","timestamp":1750308685365,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T00:00:00Z","timestamp":1387324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2013,12,18]]},"abstract":"<jats:p>This paper proposes novel customisable streaming architectures for the NP-hard set covering problem. Our approach covers both exhaustive and genetic algorithms, supporting coarse-grain parallelism and deep pipelines while allowing trade-offs between performance and resource usage. Experiments targeting Maxeler systems show that our FPGA-based designs are more effective than the corresponding multicore software versions. The speed up of the exhaustive algorithm exceeds 250 times, and that of the genetic algorithm exceeds 60 times. Meanwhile, our implementations are more flexible than other FPGA solutions, allowing users to customise parameters at run time without recompilation.<\/jats:p>","DOI":"10.1145\/2641361.2641378","type":"journal-article","created":{"date-parts":[[2014,7,7]],"date-time":"2014-07-07T11:55:18Z","timestamp":1404734118000},"page":"101-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Customisable architectures for the set covering problem"],"prefix":"10.1145","volume":"41","author":[{"given":"Liucheng","family":"Guo","sequence":"first","affiliation":[{"name":"Imperial College London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Thomas","sequence":"additional","affiliation":[{"name":"Imperial College London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wayne","family":"Luk","sequence":"additional","affiliation":[{"name":"Imperial College London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.486081"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1749603.1749604"},{"key":"e_1_2_1_3_1","first-page":"2","article-title":"Reconfigurable computing: architectures and design methods","volume":"152","author":"Todman T.J.","year":"2005","journal-title":"Proceedings of IEEE Computers and Digital Techniues."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/508352.508353"},{"key":"e_1_2_1_5_1","unstructured":"Balas E. Aclass of location distribution and scheduling problems: Modeling andsolution methods. Tepper School of usiness (1982) 958.  Balas E. Aclass of location distribution and scheduling problems: Modeling andsolution methods. Tepper School of usiness (1982) 958."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Aloisio A. Izzo V. and Rampone S. FPGA implementation of a greedy algorithm for set covering. I4th IEEE-NPSS Real Time Conference. (2005) 446--450.   Aloisio A. Izzo V. and Rampone S. FPGA implementation of a greedy algorithm for set covering. I4th IEEE-NPSS Real Time Conference. (2005) 446--450.","DOI":"10.1109\/RTC.2005.1547493"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795660.795969"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/201310.201319"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010018632078"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1999.815615"},{"key":"e_1_2_1_12_1","unstructured":"Tang W. and yip L. Hardware implementation of genetic algorithms using FPGA. The 4th IEEE International Midwest Svmposium on Circuits and Svstems. 1 (2004) 549--552.  Tang W. and yip L. Hardware implementation of genetic algorithms using FPGA. The 4th IEEE International Midwest Svmposium on Circuits and Svstems. 1 (2004) 549--552."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934449"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2025032"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01039-X"}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641361.2641378","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2641361.2641378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:01:07Z","timestamp":1750276867000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641361.2641378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,18]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,12,18]]}},"alternative-id":["10.1145\/2641361.2641378"],"URL":"https:\/\/doi.org\/10.1145\/2641361.2641378","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2013,12,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}