{"language":[{"iso":"eng"}],"_id":"8912","article_number":"114203","article_type":"original","citation":{"ieee":"N. E. Sarac, Ö. F. Altun, K. T. Atam, S. Karahoda, K. Kaya, and H. Yenigün, “Boosting expensive synchronizing heuristics,” <i>Expert Systems with Applications</i>, vol. 167, no. 4. Elsevier, 2021.","mla":"Sarac, Naci E., et al. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>, vol. 167, no. 4, 114203, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>.","short":"N.E. Sarac, Ö.F. Altun, K.T. Atam, S. Karahoda, K. Kaya, H. Yenigün, Expert Systems with Applications 167 (2021).","ama":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. 2021;167(4). doi:<a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">10.1016/j.eswa.2020.114203</a>","apa":"Sarac, N. E., Altun, Ö. F., Atam, K. T., Karahoda, S., Kaya, K., &#38; Yenigün, H. (2021). Boosting expensive synchronizing heuristics. <i>Expert Systems with Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>","chicago":"Sarac, Naci E, Ömer Faruk Altun, Kamil Tolga Atam, Sertac Karahoda, Kamer Kaya, and Hüsnü Yenigün. “Boosting Expensive Synchronizing Heuristics.” <i>Expert Systems with Applications</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.eswa.2020.114203\">https://doi.org/10.1016/j.eswa.2020.114203</a>.","ista":"Sarac NE, Altun ÖF, Atam KT, Karahoda S, Kaya K, Yenigün H. 2021. Boosting expensive synchronizing heuristics. Expert Systems with Applications. 167(4), 114203."},"external_id":{"isi":["000640531100038"]},"publication_identifier":{"issn":["09574174"]},"doi":"10.1016/j.eswa.2020.114203","publication":"Expert Systems with Applications","author":[{"first_name":"Naci E","last_name":"Sarac","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"},{"first_name":"Ömer Faruk","last_name":"Altun","full_name":"Altun, Ömer Faruk"},{"last_name":"Atam","first_name":"Kamil Tolga","full_name":"Atam, Kamil Tolga"},{"last_name":"Karahoda","first_name":"Sertac","full_name":"Karahoda, Sertac"},{"last_name":"Kaya","first_name":"Kamer","full_name":"Kaya, Kamer"},{"full_name":"Yenigün, Hüsnü","last_name":"Yenigün","first_name":"Hüsnü"}],"has_accepted_license":"1","ddc":["000"],"project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"isi":1,"acknowledgement":"This work was supported by The Scientific and Technological Research Council of Turkey (TUBITAK) [grant number 114E569]. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). We would like to thank the authors of (Roman & Szykula, 2015) for providing their heuristics implementations, which we used to compare our SynchroP implementation as given in Table 11.","file_date_updated":"2020-12-02T13:33:51Z","year":"2021","intvolume":"       167","volume":167,"department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shortest synchronizing word. Although using shorter words increases the effectiveness in practice, finding a shortest one (which is not necessarily unique) is NP-hard. For this reason, there exist various heuristics in the literature. However, high-quality heuristics such as SynchroP producing relatively shorter sequences are very expensive and can take hours when the automaton has tens of thousands of states. The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of SynchroP and its variants by using algorithmic techniques. We then focus on adapting SynchroP for many-core architectures,\r\nand overall, we obtain more than 1000× speedup on GPUs compared to naive sequential implementation that has been frequently used as a benchmark to evaluate new heuristics in the literature. We also propose two SynchroP variants and evaluate their performance."}],"publication_status":"published","date_published":"2021-04-01T00:00:00Z","issue":"4","month":"04","article_processing_charge":"No","date_updated":"2023-08-04T11:19:00Z","file":[{"date_updated":"2020-12-02T13:33:51Z","file_id":"8913","date_created":"2020-12-02T13:33:51Z","file_size":634967,"checksum":"600c2f81bc898a725bcfa7cf26ff4fed","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"esarac","file_name":"synchroPaperRevised.pdf"}],"type":"journal_article","day":"01","quality_controlled":"1","title":"Boosting expensive synchronizing heuristics","status":"public","publisher":"Elsevier","scopus_import":"1","oa":1,"oa_version":"Submitted Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-12-02T13:34:25Z"}