{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:54Z","timestamp":1750307214139,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"crossref","award":["2010\/28"],"award-info":[{"award-number":["2010\/28"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of Education and Science of Spain and FEDER","award":["TIN 2010-27541"],"award-info":[{"award-number":["TIN 2010-27541"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>With the advent of chip multiprocessors, new techniques have been developed to make parallel programing easier and more reliable. New parallel programing paradigms and new methods of making the execution of programs more efficient and more reliable have been developed. Usually, these improvements require hardware support to avoid a system slowdown.<\/jats:p>\n          <jats:p>Signatures based on Bloom filters are widely used as hardware support for parallel programing in chip multiprocessors. Signatures are used in Transactional Memory, thread-level speculation, parallel debugging, deterministic replay and other tools and applications. The main limitation of hardware signatures is the lack of flexibility: if signatures are designed with a given configuration, tailored to the requirements of a specific tool or application, it is likely that they do not fit well for other different requirements.<\/jats:p>\n          <jats:p>\n            In this paper a new hardware signature organization, called\n            <jats:italic>Flexible Signatures<\/jats:italic>\n            (\n            <jats:italic>FlexSig<\/jats:italic>\n            ), is proposed.\n            <jats:italic>FlexSig<\/jats:italic>\n            can change dynamically the resources assigned to a given signature and the number of signatures in the system, by redistributing the available hardware resources according to the system requirements. This allows higher flexibility than with traditional fixed-resources signatures based on Bloom filters, while maintaining a low false positive rate.\n          <\/jats:p>\n          <jats:p>\n            <jats:italic>FlexSig<\/jats:italic>\n            has been evaluated by comparing it with signatures based on parallel Bloom filters, and we conclude that\n            <jats:italic>FlexSig<\/jats:italic>\n            outperforms (in terms of false positive rate) conventional parallel Bloom filters in most cases, due to its ability to use all the signature resources available.\n          <\/jats:p>","DOI":"10.1145\/2086696.2086709","type":"journal-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T16:47:14Z","timestamp":1327423634000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["FlexSig"],"prefix":"10.1145","volume":"8","author":[{"given":"Lois","family":"Orosa","sequence":"first","affiliation":[{"name":"University of Santiago de Compostela, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisardo","family":"Antelo","sequence":"additional","affiliation":[{"name":"University of Santiago de Compostela, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier D.","family":"Bruguera","sequence":"additional","affiliation":[{"name":"University of Santiago de Compostela, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/115952.115976"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.007"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.41"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"volume-title":"IISWC '08: Proceedings of the IEEE International Symposium on Workload Characterization.","author":"Cao Minh C.","key":"e_1_2_1_6_1","unstructured":"Cao Minh , C. , Chung , J. , Kozyrakis , C. , and Olukotun , K . 2008. STAMP: Stanford transactional applications for multi-processing . In IISWC '08: Proceedings of the IEEE International Symposium on Workload Characterization. Cao Minh, C., Chung, J., Kozyrakis, C., and Olukotun, K. 2008. STAMP: Stanford transactional applications for multi-processing. In IISWC '08: Proceedings of the IEEE International Symposium on Workload Characterization."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803400"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950372"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250697"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.13"},{"key":"e_1_2_1_11_1","volume-title":"INFOCOM 2004. Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"4","author":"Chang F.","unstructured":"Chang , F. , chang Feng , W. , and Li , K . 2004. Approximate caches for packet classification . In INFOCOM 2004. Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol. 4 , 2196--2207. Chang, F., chang Feng, W., and Li, K. 2004. Approximate caches for packet classification. In INFOCOM 2004. Proceedings of the 23th Annual Joint Conference of the IEEE Computer and Communications Societies. Vol. 4, 2196--2207."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354643"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512560"},{"volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium.","author":"Choi W.","key":"e_1_2_1_14_1","unstructured":"Choi , W. and Draper , J . 2011. Implementation of unified signatures for transactional memory systems . In Proceedings of the IEEE International Parallel and Distributed Processing Symposium. Choi, W. and Draper, J. 2011. Implementation of unified signatures for transactional memory systems. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"volume-title":"Proceedings of the 31st Annual International Symposium on Computer Architecture, (ISCA '04)","author":"Hammond L.","key":"e_1_2_1_16_1","unstructured":"Hammond , L. , Wong , V. , Chen , M. , Carlstrom , B. D. , Davis , J. D. , Hertzberg , B. , Prabhu , M. K. , Wijaya , H. , Kozyrakis , C. , and Olukotun , K . 2004. Transactional memory coherence and consistency . In Proceedings of the 31st Annual International Symposium on Computer Architecture, (ISCA '04) . IEEE Computer Society, Los Alamitos, CA, 102. Hammond, L., Wong, V., Chen, M., Carlstrom, B. D., Davis, J. D., Hertzberg, B., Prabhu, M. K., Wijaya, H., Kozyrakis, C., and Olukotun, K. 2004. Transactional memory coherence and consistency. In Proceedings of the 31st Annual International Symposium on Computer Architecture, (ISCA '04). IEEE Computer Society, Los Alamitos, CA, 102."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"volume-title":"Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing.","author":"Lev Y.","key":"e_1_2_1_19_1","unstructured":"Lev , Y. and Moir , M . 2006. Debugging with transactional memory . In Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing. Lev, Y. and Moir, M. 2006. Debugging with transactional memory. In Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.4"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542495"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555797"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/109625.109640"},{"volume-title":"Proceedings of the 1990 Workshop on Advances in Languages and Compilers for Parallel Computing. MIT Press, 109--129","author":"Netzer R. N.","key":"e_1_2_1_24_1","unstructured":"Netzer , R. N. and Miller , B. P . 1989. Detecting data races in parallel program executions . In Proceedings of the 1990 Workshop on Advances in Languages and Compilers for Parallel Computing. MIT Press, 109--129 . Netzer, R. N. and Miller, B. P. 1989. Detecting data races in parallel program executions. In Proceedings of the 1990 Workshop on Advances in Languages and Compilers for Parallel Computing. MIT Press, 109--129."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781528"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/859618.859632"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2009.25"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.641938"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504202"},{"volume-title":"Proceedings of the ACM\/IFIP\/USENIX International Conference on Middleware, (Middleware '03)","author":"Reynolds P.","key":"e_1_2_1_30_1","unstructured":"Reynolds , P. and Vahdat , A . 2003. Efficient peer-to-peer keyword searching . In Proceedings of the ACM\/IFIP\/USENIX International Conference on Middleware, (Middleware '03) . Springer-Verlag, Berlin, 21--40. Reynolds, P. and Vahdat, A. 2003. Efficient peer-to-peer keyword searching. In Proceedings of the ACM\/IFIP\/USENIX International Conference on Middleware, (Middleware '03). Springer-Verlag, Berlin, 21--40."},{"key":"e_1_2_1_31_1","first-page":"1248","article-title":"Probabilistic location and routing. In INFOCOM 2002. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"3","author":"Rhea S.","year":"2002","unstructured":"Rhea , S. and Kubiatowicz , J. 2002 . Probabilistic location and routing. In INFOCOM 2002. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies . IEEE. Vol. 3 , 1248 -- 1257 . Rhea, S. and Kubiatowicz, J. 2002. Probabilistic location and routing. In INFOCOM 2002. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE. Vol. 3, 1248--1257.","journal-title":"IEEE."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248415"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1331699.1331713"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.2009.84"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the International Forum on Information Technology and Applications, (IFITA '09)","volume":"2","author":"Shenghua Z.","unstructured":"Shenghua , Z. , Zheng , Q. , Yuan , Z. , and Xiaolan , P . 2009. A cascade hash design of bloom filter for signature detection . In Proceedings of the International Forum on Information Technology and Applications, (IFITA '09) . Vol. 2 , 559--562. Shenghua, Z., Zheng, Q., Yuan, Z., and Xiaolan, P. 2009. A cascade hash design of bloom filter for signature detection. In Proceedings of the International Forum on Information Technology and Applications, (IFITA '09). Vol. 2, 559--562."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378583"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346300"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346204"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1521747.1521793"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095832"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346191"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2086696.2086709","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2086696.2086709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:42Z","timestamp":1750241202000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2086696.2086709"}},"subtitle":["Implementing flexible hardware signatures"],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1145\/2086696.2086709"],"URL":"https:\/\/doi.org\/10.1145\/2086696.2086709","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}